#*Optimal parallel selection.
#@Yijie Han
#t2007
#cACM Transactions on Algorithms
#index1077233
#%493330
#%609811
#%614005
#%623278
#%798291
#%839427
#%930665
#%933498
#%952846
#%1035616
#%1058956
#!
  
#*Approximating rank-width and clique-width quickly.
#@Sang-il Oum
#t2008
#cACM Transactions on Algorithms
#index1077234
#%228655
#%481148
#%621985
#%660576
#%836522
#%837340
#%950771
#%974785
#%974787
#%977408
#%977717
#%978691
#%978746
#%979168
#%1059520
#%1060875
#%1091459
#!
  
#*Pricing multicasting in more flexible network models.
#@Micah Adler,Dan Rubenstein
#t2005
#cACM Transactions on Algorithms
#index1077235
#%2616
#%210039
#%210923
#%588450
#%588823
#%588853
#%597003
#%610807
#%621976
#%622360
#%622819
#%623312
#%1059341
#%1117386
#!
  
#*Oblivious routing on node-capacitated and directed graphs.
#@Mohammad Taghi Hajiaghayi,Robert D. Kleinberg,Harald Räcke,Tom Leighton
#t2007
#cACM Transactions on Algorithms
#index1077236
#%211434
#%211664
#%267305
#%609732
#%614107
#%614323
#%614463
#%621308
#%621341
#%621336
#%621697
#%623212
#%952981
#%953214
#%1059290
#!
  
#*Maintaining information in fully dynamic trees with top trees.
#@Stephen Alstrup,Jacob Holm,Kristian de Lichtenberg,Mikkel Thorup
#t2005
#cACM Transactions on Algorithms
#index1077237
#%267310
#%267191
#%268868
#%609733
#%610224
#%610603
#%611309
#%622935
#%623171
#%950693
#%951628
#%951701
#%952947
#%952971
#%972981
#%1013710
#%1014346
#%1059550
#%1089003
#!
  
#*Provably good moving least squares.
#@Ravi Krishna Kolluri
#t2008
#cACM Transactions on Algorithms
#index1077238
#%110754
#%110925
#%586668
#%586702
#%586763
#%586759
#%586753
#%593164
#%593474
#%593221
#%593627
#%593637
#%594090
#%605821
#%621518
#%1088871
#%1118916
#%1119153
#%1119412
#%1119536
#%1119436
#%1133405
#!
  
#*Black box for constant-time insertion in priority queues (note).
#@Stephen Alstrup,Thore Husfeldt,Theis Rauhe,Mikkel Thorup
#t2005
#cACM Transactions on Algorithms
#index1077239
#%209884
#%211877
#%610098
#%949610
#%1058870
#!
  
#*Compact name-independent routing with minimum stretch.
#@Ittai Abraham,Cyril Gavoille,Dahlia Malkhi,Noam Nisan,Mikkel Thorup
#t2008
#cACM Transactions on Algorithms
#index1077240
#%610315
#%614083
#%614640
#%620253
#%623175
#%776463
#%841397
#%951701
#%952546
#%952882
#%953052
#%972793
#%988805
#%1341809
#!
  
#*An () algorithm for ear decompositions of matching-covered graphs.
#@Marcelo H. de Carvalho,Joseph Cheriyan
#t2005
#cACM Transactions on Algorithms
#index1077241
#% 
#!
  
#*Clustering, community partition and disjoint spanning trees.
#@Cun-Quan Zhang,Yongbin Ou
#t2008
#cACM Transactions on Algorithms
#index1077242
#%2333
#%334561
#%567081
#%610561
#%832677
#%950463
#%971975
#%1059429
#!
  
#*On a generalization of the stable roommates problem.
#@Katarína Cechlárová,Tamás Fleiner
#t2005
#cACM Transactions on Algorithms
#index1077243
#%836363
#%838174
#%953161
#%953417
#%971900
#%973104
#%1013205
#%1014182
#%1060505
#%3003855
#!
  
#*Optimal branch-decomposition of planar graphs in () Time.
#@Qian-Ping Gu,Hisao Tamaki
#t2008
#cACM Transactions on Algorithms
#index1077244
#% 
#!
  
#*The greedy algorithm for the minimum common string partition problem.
#@Marek Chrobak,Petr Kolman,Jiri Sgall
#t2005
#cACM Transactions on Algorithms
#index1077245
#%1086962
#%610308
#%1093093
#%118820
#%1117642
#!
  
#*Average-case lower bounds for the plurality problem.
#@Laurent Alonso,Edward M. Reingold
#t2008
#cACM Transactions on Algorithms
#index1077246
#%929619
#%1058325
#%1077250
#!
  
#*Fixed-parameter algorithms for (, )-center in planar graphs and map graphs.
#@Erik D. Demaine,Fedor V. Fomin,Mohammad Taghi Hajiaghayi,Dimitrios M. Thilikos
#t2005
#cACM Transactions on Algorithms
#index1077247
#% 
#!
  
#*Testing Euclidean minimum spanning trees in the plane.
#@Artur Czumaj,Christian Sohler
#t2008
#cACM Transactions on Algorithms
#index1077248
#%211772
#%621820
#%931554
#%949983
#%950466
#%950839
#%951313
#%1052224
#%1059038
#%1058992
#%1060906
#%1078186
#!
  
#*A maiden analysis of longest wait first.
#@Jeff Edmonds,Kirk Pruhs
#t2005
#cACM Transactions on Algorithms
#index1077249
#%210727
#%505524
#%609984
#%609953
#%610845
#%621905
#%622481
#%750173
#%950817
#%1054465
#!
  
#*Determining plurality.
#@Laurent Alonso,Edward M. Reingold
#t2008
#cACM Transactions on Algorithms
#index1077250
#%929617
#%929619
#%933968
#%1058325
#%1077246
#%1088659
#!
  
#*Computing almost shortest paths.
#@Michael Elkin
#t2005
#cACM Transactions on Algorithms
#index1077251
#%110857
#%211640
#%211876
#%543943
#%610084
#%611237
#%614640
#%620258
#%621749
#%623175
#%653618
#%949653
#%960127
#%971278
#%971983
#%972947
#%1058483
#%1059068
#%1060192
#%1104039
#!
  
#*Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem.
#@Yefim Dinitz,Shay Solomon
#t2008
#cACM Transactions on Algorithms
#index1077252
#% 
#!
  
#*On network design problems: fixed cost flows and the covering steiner problem.
#@Guy Even,Guy Kortsarz,Wolfgang Slany
#t2005
#cACM Transactions on Algorithms
#index1077253
#%46516
#%210342
#%210737
#%610968
#%621393
#%836524
#%836968
#%837402
#%839234
#%952980
#%1052141
#%1060340
#%1061754
#!
  
#*Balanced parentheses strike back.
#@Hsueh-I Lu,Chia-Chi Yeh
#t2008
#cACM Transactions on Algorithms
#index1077254
#%211020
#%267701
#%481151
#%610586
#%622070
#%749749
#%953385
#%1058805
#%1060106
#%1061461
#%3006743
#!
  
#*Editor's foreword.
#@Harold N. Gabow
#t2005
#cACM Transactions on Algorithms
#index1077255
#% 
#!
  
#*Improved algorithms for the minmax-regret 1-center and 1-median problems.
#@Hung-I Yu,Tzu-Chin Lin,Biing-Feng Wang
#t2008
#cACM Transactions on Algorithms
#index1077256
#%651124
#%835959
#%924059
#%1125988
#!
  
#*Approximate majorization and fair online load balancing.
#@Ashish Goel,Adam Meyerson,Serge A. Plotkin
#t2005
#cACM Transactions on Algorithms
#index1077257
#%211207
#%609923
#%793203
#%949605
#%952498
#%972404
#!
  
#*Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
#@Guy Even,Retsef Levi,Dror Rawitz,Baruch Schieber,Shimon Shahar,Maxim Sviridenko
#t2008
#cACM Transactions on Algorithms
#index1077258
#%609958
#%622980
#%839117
#%953021
#%952982
#%1060690
#%1089125
#%1288543
#!
  
#*Analysis of linear combination algorithms in cryptography.
#@Peter J. Grabner,Clemens Heuberger,Helmut Prodinger,Jörg M. Thuswaldner
#t2005
#cACM Transactions on Algorithms
#index1077259
#%842186
#%864660
#%953015
#%985841
#%1077259
#%1079956
#%1091588
#!
  
#*Roundtrip spanners and roundtrip routing in directed graphs.
#@Liam Roditty,Mikkel Thorup,Uri Zwick
#t2008
#cACM Transactions on Algorithms
#index1077260
#%543840
#%610317
#%611144
#%614640
#%842963
#%951701
#%952810
#%952821
#%953052
#%1058483
#!
  
#*Individual displacements for linear probing hashing with different insertion policies.
#@Svante Janson
#t2005
#cACM Transactions on Algorithms
#index1077261
#%953513
#%1051845
#%1052070
#%1052256
#%1077271
#!
  
#*Writing-all deterministically and optimally using a nontrivial number of asynchronous processors.
#@Dariusz R. Kowalski,Alexander A. Shvartsman
#t2008
#cACM Transactions on Algorithms
#index1077262
#%209854
#%209969
#%210711
#%296621
#%297192
#%544261
#%544399
#%614172
#%614190
#%614276
#%621718
#%622468
#%622469
#%933870
#%952669
#%953405
#%1058362
#%1059057
#%1059955
#%1060153
#%1089005
#!
  
#*The NP-completeness column.
#@David S. Johnson
#t2005
#cACM Transactions on Algorithms
#index1077263
#%104315
#%104558
#%104569
#%119855
#%210268
#%210463
#%210492
#%211143
#%211445
#%269003
#%610033
#%610446
#%610985
#%621122
#%621138
#%621144
#%621355
#%621253
#%622157
#%622146
#%622996
#%775450
#%798033
#%817197
#%852950
#%861853
#%862000
#%861886
#%861124
#%862023
#%930288
#%950007
#%950475
#%971353
#%1060061
#%1059809
#%1060060
#%1060454
#%1060436
#%1060553
#%1088861
#%1094479
#!
  
#*Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ.
#@William S. Evans,David G. Kirkpatrick
#t2006
#cACM Transactions on Algorithms
#index1077264
#%489576
#%609965
#%610439
#%1011365
#!
  
#*Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.
#@Raja Jothi,Balaji Raghavachari
#t2005
#cACM Transactions on Algorithms
#index1077265
#%950399
#%1059341
#%931999
#%843693
#%611183
#!
  
#*Approximation schemes for wireless networks.
#@Tim Nieberg,Johann Hurink,Walter Kern
#t2008
#cACM Transactions on Algorithms
#index1077266
#%155434
#%210848
#%225015
#%803577
#%852820
#%952711
#%953139
#%953547
#%1059129
#!
  
#*Problems column.
#@Samir Khuller
#t2005
#cACM Transactions on Algorithms
#index1077267
#%621300
#%1058744
#%1059998
#!
  
#*Atomic congestion games among coalitions.
#@Dimitris Fotakis,Spyros C. Kontogiannis,Paul G. Spirakis
#t2008
#cACM Transactions on Algorithms
#index1077268
#%267992
#%610475
#%610335
#%611153
#%621725
#%621936
#%622274
#%622717
#%1051922
#%1052105
#%1091181
#%1122595
#!
  
#*A linear-time approximation algorithm for weighted matchings in graphs.
#@Doratha E. Drake Vinkemeier,Stefan Hougardy
#t2005
#cACM Transactions on Algorithms
#index1077269
#%610559
#%930911
#%950363
#%950366
#%950365
#%1035274
#%1275170
#!
  
#*Approximation algorithms for a facility location problem with service capacities.
#@Jens Maßberg,Jens Vygen
#t2008
#cACM Transactions on Algorithms
#index1077270
#%210488
#%211097
#%282259
#%446409
#%611165
#%949569
#!
  
#*Exact distribution of individual displacements in linear probing hashing.
#@Alfredo Viola
#t2005
#cACM Transactions on Algorithms
#index1077271
#%193057
#%770305
#%933363
#%950979
#%953242
#%953513
#%1052256
#%1077261
#%1091218
#%3006037
#%3006743
#!
  
#*Label-guided graph exploration by a finite automaton.
#@Reuven Cohen,Pierre Fraigniaud,David Ilcinkas,Amos Korman,David Peleg
#t2008
#cACM Transactions on Algorithms
#index1077272
#%210154
#%493588
#%544171
#%543910
#%611411
#%614683
#%952849
#%1091236
#!
  
#*Fast sparse matrix multiplication.
#@Raphael Yuster,Uri Zwick
#t2005
#cACM Transactions on Algorithms
#index1077273
#%861707
#%621652
#%971731
#%210380
#%960021
#%993684
#%931063
#%1121411
#%1059566
#%960157
#%211500
#%3193
#%953541
#%1060140
#%211638
#%972947
#%211786
#%816365
#%611381
#%951918
#!
  
#*Algorithmic construction of sets for -restrictions.
#@Noga Alon,Dana Moshkovitz,Shmuel Safra
#t2006
#cACM Transactions on Algorithms
#index1077274
#% 
#!
  
#*Approximate distance oracles for unweighted graphs in expected () time.
#@Surender Baswana,Sandeep Sen
#t2006
#cACM Transactions on Algorithms
#index1077275
#% 
#!
  
#*Faster fixed parameter tractable algorithms for finding feedback vertex sets.
#@Venkatesh Raman,Saket Saurabh,C. R. Subramanian
#t2006
#cACM Transactions on Algorithms
#index1077276
#%415899
#%493919
#%610529
#%1058524
#!
  
#*Finding 3-shredders efficiently.
#@Rajneesh Hegde
#t2006
#cACM Transactions on Algorithms
#index1077277
#%210686
#%622722
#%839384
#%951702
#%1091664
#!
  
#*Succinct ordinal trees with level-ancestor queries.
#@Richard F. Geary,Rajeev Raman,Venkatesh Raman
#t2006
#cACM Transactions on Algorithms
#index1077278
#%118467
#%210612
#%481153
#%749749
#%971514
#%1058805
#%1060106
#!
  
#*Bipartite roots of graphs.
#@Lap Chi Lau
#t2006
#cACM Transactions on Algorithms
#index1077279
#%837737
#%953170
#%1061638
#!
  
#*The cyclic multi-peg Tower of Hanoi.
#@Daniel Berend,Amir Sapir
#t2006
#cACM Transactions on Algorithms
#index1077280
#%837299
#%940291
#%953353
#%1058907
#!
  
#*Secure multiparty computation of approximations.
#@Joan Feigenbaum,Yuval Ishai,Tal Malkin,Kobbi Nissim,Martin J. Strauss,Rebecca N. Wright
#t2006
#cACM Transactions on Algorithms
#index1077281
#%119728
#%120234
#%210282
#%210998
#%211219
#%543695
#%597975
#%610310
#%621440
#%622228
#%622346
#%622398
#%622795
#%622888
#%623082
#%771543
#%861308
#%861657
#%950020
#%950791
#%971408
#%972035
#%1059154
#%1059658
#%1059902
#%1060117
#!
  
#*When indexing equals compression: Experiments with compressing suffix arrays and applications.
#@Luca Foschini,Roberto Grossi,Ankur Gupta,Jeffrey Scott Vitter
#t2006
#cACM Transactions on Algorithms
#index1077282
#%522
#%2526
#%118525
#%118704
#%146315
#%147009
#%210951
#%610502
#%610658
#%610659
#%770019
#%933329
#%950285
#%950286
#%951134
#%953385
#%953463
#%979471
#%1058717
#%1059410
#%1060106
#%1059931
#%1060203
#%1073975
#%1073887
#%1074534
#%1089264
#%1120219
#!
  
#*Minimizing mean flow time for UET tasks.
#@Yumei Huo,Joseph Y.-T. Leung
#t2006
#cACM Transactions on Algorithms
#index1077283
#% 
#!
  
#*The register function for -ary trees.
#@Michael Drmota,Helmut Prodinger
#t2006
#cACM Transactions on Algorithms
#index1077284
#% 
#!
  
#*Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms.
#@David Eppstein
#t2006
#cACM Transactions on Algorithms
#index1077285
#%110733
#%133250
#%211756
#%610003
#%610159
#%610441
#%816660
#%816691
#%817916
#%950130
#%952590
#%1059292
#!
  
#*Online topological ordering.
#@Irit Katriel,Hans L. Bodlaender
#t2006
#cACM Transactions on Algorithms
#index1077286
#%185911
#%522539
#%609762
#%621842
#%660844
#%932869
#%933479
#%950342
#%1094149
#!
  
#*Problems column.
#@Samir Khuller
#t2006
#cACM Transactions on Algorithms
#index1077287
#%1059161
#%1122442
#!
  
#*This side up!
#@Leah Epstein,Rob van Stee
#t2006
#cACM Transactions on Algorithms
#index1077288
#%210294
#%609957
#%610313
#%610461
#%836593
#%989228
#%1091305
#!
  
#*Dense subgraph problems with output-density conditions.
#@Akiko Suzuki,Takeshi Tokuyama
#t2008
#cACM Transactions on Algorithms
#index1077289
#%597957
#%599529
#%641841
#%835951
#%952625
#%953079
#%1059273
#%1061309
#!
  
#*Experimental analysis of dynamic all pairs shortest path algorithms.
#@Camil Demetrescu,Giuseppe F. Italiano
#t2006
#cACM Transactions on Algorithms
#index1077290
#%38747
#%211160
#%621833
#%950231
#%950140
#%950342
#%953565
#%971798
#%979979
#%979920
#%1013527
#%1059719
#%1122550
#%1122548
#%1288762
#!
  
#*An approximation algorithm for scheduling malleable tasks under general precedence constraints.
#@Klaus Jansen,Hu Zhang
#t2006
#cACM Transactions on Algorithms
#index1077291
#%196082
#%611040
#%614358
#%614478
#%614517
#%614647
#%750253
#%771074
#%1034891
#%1059593
#%1061275
#!
  
#*The minimum generalized vertex cover problem.
#@Refael Hassin,Asaf Levin
#t2006
#cACM Transactions on Algorithms
#index1077292
#%953272
#!
  
#*Generic quantum Fourier transforms.
#@Cristopher Moore,Daniel N. Rockmore,Alexander Russell
#t2006
#cACM Transactions on Algorithms
#index1077293
#%210884
#%611047
#%611083
#%614355
#%621408
#%622233
#%622179
#%623259
#%1060454
#%1089373
#%1090132
#!
  
#*Minimizing total completion time on uniform machines with deadline constraints.
#@Teofilo F. Gonzalez,Joseph Y.-T. Leung,Michael Pinedo
#t2006
#cACM Transactions on Algorithms
#index1077294
#%950483
#%951515
#%952864
#%1059911
#%1090718
#!
  
#*Fault-tolerant facility location.
#@Chaitanya Swamy,David B. Shmoys
#t2008
#cACM Transactions on Algorithms
#index1077295
#%406996
#%611305
#%622359
#%623147
#%817978
#%950780
#%953022
#%953023
#%953262
#%1058856
#%1058849
#%1060057
#%1060732
#!
  
#*Efficient algorithms for bichromatic separability.
#@Pankaj K. Agarwal,Boris Aronov,Vladlen Koltun
#t2006
#cACM Transactions on Algorithms
#index1077296
#%267846
#%837238
#%837240
#%842887
#%843564
#%887713
#%1058418
#!
  
#*Robust subgraphs for trees and paths.
#@Refael Hassin,Danny Segev
#t2006
#cACM Transactions on Algorithms
#index1077297
#%210737
#%268009
#%1061455
#!
  
#*Oracles for bounded-length shortest paths in planar graphs.
#@Lukasz Kowalik,Maciej Kurowski
#t2006
#cACM Transactions on Algorithms
#index1077298
#%185864
#%211876
#%610368
#%610908
#%621710
#%660526
#%1058809
#%1059210
#%1090178
#%3005546
#!
  
#*The NP-completeness column: The many limits on approximation.
#@David S. Johnson
#t2006
#cACM Transactions on Algorithms
#index1077299
#%702
#%104482
#%210576
#%211144
#%211148
#%211146
#%211488
#%211925
#%610578
#%621296
#%621294
#%621265
#%621264
#%621678
#%621731
#%621855
#%621962
#%622215
#%622132
#%622104
#%622234
#%622266
#%622971
#%622680
#%622878
#%623246
#%798622
#%861234
#%861616
#%861617
#%861924
#%861892
#%930852
#%949573
#%949575
#%951026
#%971353
#%1059760
#%1061309
#%1062210
#%1180679
#!
  
#*Online scheduling of splittable tasks.
#@Leah Epstein,Rob van Stee
#t2006
#cACM Transactions on Algorithms
#index1077300
#%1058437
#%929957
#%1090980
#%610508
#%1059258
#%610649
#%953152
#%1059846
#%933084
#%933796
#!
  
#*An improved algorithm for CIOQ switches.
#@Yossi Azar,Yossi Richter
#t2006
#cACM Transactions on Algorithms
#index1077301
#%621169
#%609843
#%949528
#%621345
#%949761
#%949831
#%614315
#%1059757
#%953176
#%1092561
#%614383
#%794758
#!
  
#*Foreword.
#@Alejandro López-Ortiz,J. Ian Munro
#t2006
#cACM Transactions on Algorithms
#index1077302
#% 
#!
  
#*Improved results for data migration and open shop scheduling.
#@Rajiv Gandhi,Magnús M. Halldórsson,Guy Kortsarz,Hadas Shachnai
#t2006
#cACM Transactions on Algorithms
#index1077303
#%267579
#%406975
#%610701
#%611189
#%887133
#%953101
#%1014115
#%1059762
#%1060466
#!
  
#*Optimal constrained graph exploration.
#@Christian A. Duncan,Stephen G. Kobourov,V. S. Anil Kumar
#t2006
#cACM Transactions on Algorithms
#index1077304
#%2022
#%108713
#%587830
#%610028
#%610413
#%835964
#%887049
#%887166
#%889254
#%950143
#%952593
#%953462
#%1009277
#%1058315
#%1058483
#%1058643
#%1058646
#%1059558
#%1093901
#!
  
#*Rank-maximal matchings.
#@Robert W. Irving,Telikepalli Kavitha,Kurt Mehlhorn,Dimitrios Michail,Katarzyna E. Paluch
#t2006
#cACM Transactions on Algorithms
#index1077305
#%620416
#%1059253
#%3003855
#!
  
#*A loopless Gray code for rooted trees.
#@James F. Korsh,Paul LaFollette
#t2006
#cACM Transactions on Algorithms
#index1077306
#%609867
#%770131
#%848222
#%931016
#%934291
#%950173
#%953256
#%1060384
#%1094435
#%1095028
#!
  
#*Generating rooted and free plane trees.
#@Joe Sawada
#t2006
#cACM Transactions on Algorithms
#index1077307
#%609867
#%611193
#%933071
#%952707
#%1060666
#%1061784
#!
  
#*Pattern matching for arc-annotated sequences.
#@Jens Gramm,Jiong Guo,Rolf Niedermeier
#t2006
#cACM Transactions on Algorithms
#index1077308
#%522
#%118842
#%558877
#%650522
#%972515
#%1059769
#%1086981
#%1088709
#%1095073
#!
  
#*Melding priority queues.
#@Ran Mendelson,Robert Endre Tarjan,Mikkel Thorup,Uri Zwick
#t2006
#cACM Transactions on Algorithms
#index1077309
#%210905
#%211877
#%610843
#%611141
#%622416
#%798187
#%930208
#%949983
#%950342
#%950839
#%951313
#%951702
#%951710
#%971959
#%971958
#%1077239
#!
  
#*A general approach to online network optimization problems.
#@Noga Alon,Baruch Awerbuch,Yossi Azar,Niv Buchbinder,Joseph Naor
#t2006
#cACM Transactions on Algorithms
#index1077310
#%211358
#%211664
#%609914
#%614107
#%614323
#%621531
#%621191
#%621940
#%952980
#%1059290
#!
  
#*An improved algorithm for radio broadcast.
#@Michael Elkin,Guy Kortsarz
#t2007
#cACM Transactions on Algorithms
#index1077311
#%210321
#%210426
#%211252
#%544178
#%610554
#%610772
#%611016
#%841269
#%841342
#%971401
#%971445
#%1061282
#%1090150
#!
  
#*Frugal path mechanisms.
#@Aaron Archer,Éva Tardos
#t2007
#cACM Transactions on Algorithms
#index1077312
#%209925
#%210923
#%211092
#%211257
#%268839
#%543849
#%544140
#%592785
#%592914
#%592721
#%609871
#%610435
#%620850
#%622872
#%841355
#%924261
#%972650
#!
  
#*On the difficulty of some shortest path problems.
#@John Hershberger,Subhash Suri,Amit M. Bhosle
#t2007
#cACM Transactions on Algorithms
#index1077313
#%209865
#%210925
#%210923
#%212076
#%609871
#%622819
#%934063
#%951918
#%1059719
#%1093689
#!
  
#*Querying priced information in databases: The conjunctive case.
#@Renato Carmo,Tomás Feder,Yoshiharu Kohayakawa,Eduardo Sany Laber,Rajeev Motwani,Liadan O'Callaghan,Rina Panigrahy,Dilys Thomas
#t2007
#cACM Transactions on Algorithms
#index1077314
#%62340
#%186358
#%299481
#%598861
#%610265
#%621732
#%971682
#%1118443
#%642318
#!
  
#*The string edit distance matching problem with moves.
#@Graham Cormode,S. Muthukrishnan
#t2007
#cACM Transactions on Algorithms
#index1077315
#%522
#%2487
#%118820
#%210998
#%609764
#%610292
#%610310
#%610603
#%621767
#%622137
#%622339
#%622448
#%622791
#%623038
#%890620
#%932074
#%953287
#%1058319
#!
  
#*Tight bounds for worst-case equilibria.
#@Artur Czumaj,Berthold Vöcking
#t2007
#cACM Transactions on Algorithms
#index1077316
#%267992
#%268839
#%621818
#%622717
#%622872
#%622875
#%950478
#%951491
#%972886
#!
  
#*Entropy-based bounds for online algorithms.
#@Gopal Pandurangan,Eli Upfal
#t2007
#cACM Transactions on Algorithms
#index1077317
#%146995
#%598470
#%611156
#%770019
#%771729
#%776121
#%950322
#%951770
#%952929
#%972557
#%1059858
#%1059724
#%3005125
#!
  
#*A data structure for a sequence of string accesses in external memory.
#@Valentina Ciriani,Paolo Ferragina,Fabrizio Luccio,S. Muthukrishnan
#t2007
#cACM Transactions on Algorithms
#index1077318
#%522
#%210675
#%299460
#%377071
#%621930
#%641871
#%641880
#%642363
#%643884
#%651188
#%771629
#%775194
#%833184
#%932888
#%950284
#%951628
#%951770
#%1059931
#%1112621
#%1138133
#!
  
#*Algorithmic aspects of bandwidth trading.
#@Randeep Bhatia,Julia Chuzhoy,Ari Freund,Joseph Naor
#t2007
#cACM Transactions on Algorithms
#index1077319
#%611362
#%949707
#!
  
#*Foreword to special issue on SODA 2002.
#@David Eppstein
#t2007
#cACM Transactions on Algorithms
#index1077320
#% 
#!
  
#*Minimizing weighted flow time.
#@Nikhil Bansal,Kedar Dhamdhere
#t2007
#cACM Transactions on Algorithms
#index1077321
#%209818
#%211542
#%609999
#%610010
#%610206
#%610013
#%613976
#%619848
#%621327
#%621700
#%621696
#%622471
#%622620
#%622913
#%861195
#%949786
#%950818
#%950817
#!
  
#*An () algorithm for incremental topological ordering.
#@Deepak Ajwani,Tobias Friedrich,Ulrich Meyer
#t2008
#cACM Transactions on Algorithms
#index1077322
#% 
#!
  
#*Computing equilibria for a service provider game with (Im)perfect information.
#@René Beier,Artur Czumaj,Piotr Krysta,Berthold Vöcking
#t2006
#cACM Transactions on Algorithms
#index1077323
#%211642
#%267992
#%592801
#%621936
#%950753
#%3449694
#!
  
#*Improved approximation results for the stable marriage problem.
#@Magnús M. Halldórsson,Kazuo Iwama,Shuichi Miyazaki,Hiroki Yanagisawa
#t2007
#cACM Transactions on Algorithms
#index1077324
#%557774
#%610707
#%620416
#%621855
#%651101
#%741196
#%836360
#%837219
#%861234
#%1013205
#%1091745
#%1091727
#%1093295
#%3003855
#!
  
#*Dynamic text and static pattern matching.
#@Amihood Amir,Gad M. Landau,Moshe Lewenstein,Dina Sokol
#t2007
#cACM Transactions on Algorithms
#index1077325
#%118467
#%210560
#%609764
#%610500
#%610662
#%622070
#%951029
#%951134
#%953052
#%971472
#%971514
#%1058940
#%1059461
#!
  
#*Compressed indexes for dynamic text collections.
#@Ho-Leung Chan,Wing-Kai Hon,Tak Wah Lam,Kunihiko Sadakane
#t2007
#cACM Transactions on Algorithms
#index1077326
#%105317
#%118509
#%209901
#%610658
#%610659
#%622051
#%622189
#%769542
#%886937
#%950286
#%951134
#%951886
#%971304
#%1059410
#%1060106
#%1059931
#%1074534
#!
  
#*Compressed representations of sequences and full-text indexes.
#@Paolo Ferragina,Giovanni Manzini,Veli Mäkinen,Gonzalo Navarro
#t2007
#cACM Transactions on Algorithms
#index1077327
#%2487
#%2526
#%118743
#%146363
#%210612
#%211533
#%610658
#%610637
#%611177
#%950285
#%950286
#%952840
#%953463
#%979595
#%1025708
#%1059410
#%1059931
#%1077282
#!
  
#*A simple entropy-based algorithm for planar point location.
#@Sunil Arya,Theocharis Malamatos,David M. Mount
#t2007
#cACM Transactions on Algorithms
#index1077328
#%209949
#%609895
#%610764
#%775749
#%803862
#%804006
#%953512
#%994297
#%1059089
#!
  
#*Nearest-neighbor-preserving embeddings.
#@Piotr Indyk,Assaf Naor
#t2007
#cACM Transactions on Algorithms
#index1077329
#%210848
#%210914
#%211001
#%210998
#%557806
#%609893
#%610947
#%622339
#%622595
#%971307
#%1051698
#%1051892
#!
  
#*Phase changes in random point quadtrees.
#@Hua-Huai Chern,Michael Fuchs,Hsien-Kuei Hwang
#t2007
#cACM Transactions on Algorithms
#index1077330
#%167
#%740758
#%768126
#%848565
#%864660
#%950303
#%952788
#%976804
#%1051974
#%1051850
#%1059017
#%1059596
#%1091229
#%1092165
#%3006777
#!
  
#*An algorithm for deciding zero equivalence of nested polynomially recurrent sequences.
#@Manuel Kauers
#t2007
#cACM Transactions on Algorithms
#index1077331
#%449394
#%847316
#%950852
#%960363
#%1121652
#!
  
#*Windows scheduling as a restricted version of bin packing.
#@Amotz Bar-Noy,Richard E. Ladner,Tami Tamir
#t2007
#cACM Transactions on Algorithms
#index1077332
#%609965
#%610439
#%951002
#%950973
#%951557
#%953634
#%960009
#%1011365
#%1013113
#%1058521
#%1061212
#%1078526
#%1141054
#!
  
#*Multicommodity demand flow in a tree and packing integer programs.
#@Chandra Chekuri,Marcelo Mydlarz,F. Bruce Shepherd
#t2007
#cACM Transactions on Algorithms
#index1077333
#%46533
#%186032
#%209914
#%406774
#%406988
#%621263
#%621371
#%621697
#%621699
#%622955
#%838095
#%949707
#%972129
#%1059808
#!
  
#*Multiplierless multiple constant multiplication.
#@Yevgen Voronenko,Markus Püschel
#t2007
#cACM Transactions on Algorithms
#index1077334
#%134126
#%282988
#%950198
#%1073561
#%1082735
#!
  
#*Retroactive data structures.
#@Erik D. Demaine,John Iacono,Stefan Langerman
#t2007
#cACM Transactions on Algorithms
#index1077335
#%721
#%268630
#%610505
#%611140
#%775749
#%887874
#%951702
#%951886
#%971832
#%972981
#%1060632
#!
  
#*Strongly stable matchings in time () and extension to the hospitals-residents problem.
#@Telikepalli Kavitha,Kurt Mehlhorn,Dimitrios Michail,Katarzyna E. Paluch
#t2007
#cACM Transactions on Algorithms
#index1077336
#% 
#!
  
#*Novel architectures for P2P applications: The continuous-discrete approach.
#@Moni Naor,Udi Wieder
#t2007
#cACM Transactions on Algorithms
#index1077337
#%186054
#%211622
#%407879
#%413308
#%413374
#%413338
#%413409
#%499998
#%543900
#%544270
#%544263
#%588450
#%588880
#%588943
#%610508
#%614054
#%614381
#%614529
#%621237
#%622059
#%622431
#%635946
#%841520
#%931766
#%932709
#%950904
#%972811
#!
  
#*Convergence time to Nash equilibrium in load balancing.
#@Eyal Even-Dar,Alexander Kesselman,Yishay Mansour
#t2007
#cACM Transactions on Algorithms
#index1077338
#%267992
#%268839
#%543999
#%610475
#%610335
#%621818
#%622717
#%622872
#%836280
#%951491
#%988247
#%1122595
#!
  
#*The relative worst order ratio for online algorithms.
#@Joan Boyar,Lene M. Favrholdt
#t2007
#cACM Transactions on Algorithms
#index1077339
#%610876
#%776121
#%951002
#%951557
#%973238
#%1025608
#%1058698
#%1089635
#!
  
#*Faster algorithms for sorting by transpositions and sorting by block interchanges.
#@Jianxing Feng,Daming Zhu
#t2007
#cACM Transactions on Algorithms
#index1077340
#%185820
#%610251
#%889882
#%930579
#%950590
#%951628
#%1058496
#%1061151
#%1061065
#%1087067
#%1091582
#%1093028
#!
  
#*Improved algorithms for weakly chordal graphs.
#@Ryan B. Hayward,Jeremy Spinrad,R. Sritharan
#t2007
#cACM Transactions on Algorithms
#index1077341
#%610729
#%611122
#%837102
#%838072
#%839133
#%953547
#%1025584
#!
  
#*Routing and scheduling in multihop wireless networks with time-varying channels.
#@Matthew Andrews,Lisa Zhang
#t2007
#cACM Transactions on Algorithms
#index1077342
#%209977
#%210741
#%400899
#%621276
#%949530
#%949534
#%949831
#%1122198
#%1289923
#!
  
#*Deterministic sampling and range counting in geometric data streams.
#@Amitabha Bagchi,Amitabh Chaudhary,David Eppstein,Michael T. Goodrich
#t2007
#cACM Transactions on Algorithms
#index1077343
#%110676
#%111193
#%111509
#%186090
#%210841
#%472493
#%544808
#%598727
#%610348
#%610683
#%610773
#%611082
#%620559
#%621693
#%642533
#%816672
#%843522
#%949584
#%1118457
#!
  
#*Constructing pairwise disjoint paths with few links.
#@Himanshu Gupta,Rephael Wenger
#t2007
#cACM Transactions on Algorithms
#index1077344
#%111198
#%111440
#%209937
#%415954
#%415953
#%481151
#%609881
#%803484
#%803528
#%837511
#%843169
#%951591
#%953043
#%1059461
#%1082808
#!
  
#*Problems column.
#@Samir Khuller
#t2007
#cACM Transactions on Algorithms
#index1077345
#%611561
#%611582
#%852950
#%3003855
#!
  
#*Approximate parameterized matching.
#@Carmit Hazay,Moshe Lewenstein,Dina Sokol
#t2007
#cACM Transactions on Algorithms
#index1077346
#%609808
#%609947
#%621366
#%621760
#%770268
#%908294
#%929565
#%950342
#%971430
#%971974
#%979607
#%1058354
#%1058504
#%1059253
#%1059461
#%1059704
#!
  
#*The NP-completeness column: Finding needles in haystacks.
#@David S. Johnson
#t2007
#cACM Transactions on Algorithms
#index1077347
#%104433
#%212055
#%212120
#%269066
#%592852
#%610814
#%620908
#%621300
#%621936
#%621825
#%622136
#%626756
#%821813
#%861631
#%861392
#%861765
#%862352
#%861606
#%887483
#%887824
#%931219
#%931227
#%931478
#%951039
#%951574
#%953262
#%971471
#%972217
#%972341
#%972752
#%1013819
#%1060148
#%1060387
#%1093419
#%1095429
#!
  
#*Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.
#@Luca Becchetti,Jochen Könemann,Stefano Leonardi,Martin Pál
#t2007
#cACM Transactions on Algorithms
#index1077348
#%209974
#%210849
#%211281
#%211515
#%621393
#%622023
#%622205
#%622360
#%622204
#%971908
#%1059341
#!
  
#*Energy-efficient algorithms for flow time minimization.
#@Susanne Albers,Hiroshi Fujiwara
#t2007
#cACM Transactions on Algorithms
#index1077349
#%210023
#%209966
#%212038
#%543957
#%610783
#%611542
#%614140
#%776121
#%822613
#%950186
#%1060451
#%1062207
#!
  
#*Skip graphs.
#@James Aspnes,Gauri Shah
#t2007
#cACM Transactions on Algorithms
#index1077350
#%186083
#%209968
#%413375
#%413338
#%499998
#%525410
#%543561
#%543628
#%544263
#%588880
#%609906
#%610508
#%611382
#%614070
#%614054
#%614343
#%622433
#%624277
#%636757
#%741067
#%775194
#%818004
#%818011
#%1091327
#%1092606
#%1122693
#%3006037
#!
  
#*Guessing secrets efficiently via list decoding.
#@Noga Alon,Venkatesan Guruswami,Tali Kaufman,Madhu Sudan
#t2007
#cACM Transactions on Algorithms
#index1077351
#%119868
#%211560
#%609748
#%610261
#%621204
#%622218
#%974262
#%976285
#%1060117
#%1060962
#%1168293
#%1190866
#!
  
#*Finding the shortest simple paths: A new algorithm and its implementation.
#@John Hershberger,Matthew Maxel,Subhash Suri
#t2007
#cACM Transactions on Algorithms
#index1077352
#% 
#!
  
#*Routing selfish unsplittable traffic.
#@Vincenzo Auletta,Roberto De Prisco,Paolo Penna,Giuseppe Persiano
#t2007
#cACM Transactions on Algorithms
#index1077353
#%209925
#%211677
#%211663
#%267992
#%592914
#%610335
#%611153
#%622274
#%622717
#%622819
#%949605
#%950677
#!
  
#*Introduction to SODA 2002 and 2003 special issue.
#@Harold N. Gabow,Michael A. Bender,Martin Farach-Colton
#t2007
#cACM Transactions on Algorithms
#index1077354
#% 
#!
  
#*Approximation algorithms and hardness results for cycle packing problems.
#@Michael Krivelevich,Zeev Nutov,Mohammad R. Salavatipour,Jacques Yuster,Raphael Yuster
#t2007
#cACM Transactions on Algorithms
#index1077355
#%209914
#%415177
#%610201
#%611330
#%621875
#%830834
#%861924
#%949573
#%949575
#%952697
#%972129
#%972455
#%1060340
#%1091734
#!
  
#*Packing element-disjoint steiner trees.
#@Joseph Cheriyan,Mohammad R. Salavatipour
#t2007
#cACM Transactions on Algorithms
#index1077356
#%155402
#%210890
#%610797
#%610796
#%749894
#%836024
#%864521
#%888103
#%953216
#%976764
#%1013755
#%1013757
#%1013756
#%1051843
#%1059159
#%1061424
#!
  
#*The -traveling repairmen problem.
#@Jittat Fakcharoenphol,Chris Harrelson,Satish Rao
#t2007
#cACM Transactions on Algorithms
#index1077357
#% 
#!
  
#*Improved online algorithms for buffer management in QoS switches.
#@Marek Chrobak,Wojciech Jawor,Jiri Sgall,Tomás Tichý
#t2007
#cACM Transactions on Algorithms
#index1077358
#%609843
#%611002
#%611590
#%611568
#%622483
#%1059757
#%3005125
#!
  
#*Partial fillup and search time in LC tries.
#@Svante Janson,Wojciech Szpankowski
#t2007
#cACM Transactions on Algorithms
#index1077359
#%522
#%68548
#%597615
#%929733
#%1051896
#%1051904
#%1052150
#%1092290
#%1094219
#!
  
#*Edge-disjoint paths revisited.
#@Chandra Chekuri,Sanjeev Khanna
#t2007
#cACM Transactions on Algorithms
#index1077360
#%210741
#%211823
#%611330
#%798020
#%798622
#%932241
#%972129
#%972455
#%972793
#%1013121
#!
  
#*Succinct indexable dictionaries with applications to encoding -ary trees, prefix sums and multisets.
#@Rajeev Raman,Venkatesh Raman,Srinivasa Rao Satti
#t2007
#cACM Transactions on Algorithms
#index1077361
#% 
#!
  
#*Algorithms for power savings.
#@Sandy Irani,Sandeep K. Shukla,Rajesh Gupta
#t2007
#cACM Transactions on Algorithms
#index1077362
#%106142
#%133640
#%212038
#%283004
#%436804
#%565149
#%610857
#%951949
#%1098603
#%1135329
#!
  
#*The priority R-tree: A practically efficient and worst-case optimal R-tree.
#@Lars Arge,Mark de Berg,Herman J. Haverkort,Ke Yi
#t2008
#cACM Transactions on Algorithms
#index1077363
#%95492
#%111149
#%176233
#%185933
#%232820
#%598147
#%598798
#%599611
#%599663
#%642486
#%642933
#%643709
#%803506
#%832620
#%3004446
#!
  
#*Finding a long directed cycle.
#@Harold N. Gabow,Shuxin Nie
#t2008
#cACM Transactions on Algorithms
#index1077364
#%73
#%861707
#%949588
#%950279
#%952718
#%971913
#%993684
#%1058629
#%1059764
#%1060745
#%1061885
#!
  
#*Hierarchical bin buffering: Online local moments for dynamic external memory arrays.
#@Daniel Lemire,Owen Kaser
#t2008
#cACM Transactions on Algorithms
#index1077365
#%77062
#%95981
#%176558
#%300027
#%598514
#%598960
#%598878
#%621206
#%643326
#%1094066
#%1138098
#%3668080
#!
  
#*Approximate distance oracles for geometric spanners.
#@Joachim Gudmundsson,Christos Levcopoulos,Giri Narasimhan,Michiel H. M. Smid
#t2008
#cACM Transactions on Algorithms
#index1077366
#%522
#%3482
#%110567
#%111131
#%185864
#%210999
#%415588
#%481151
#%610142
#%610208
#%610666
#%623175
#%843567
#%949582
#%949569
#%951697
#%953447
#%972119
#%1058424
#%1058901
#%1059068
#%1059412
#%1059461
#%1059560
#%1060125
#!
  
#*Improved bounds for scheduling conflicting jobs with minsum criteria.
#@Rajiv Gandhi,Magnús M. Halldórsson,Guy Kortsarz,Hadas Shachnai
#t2008
#cACM Transactions on Algorithms
#index1077367
#%267579
#%406975
#%610591
#%610702
#%750063
#%750417
#%837181
#%887133
#%888131
#%952599
#%952597
#%953101
#%1014115
#%1077303
#%547516
#!
  
#*Rectangular layouts and contact graphs.
#@Adam L. Buchsbaum,Emden R. Gansner,Cecilia Magdalena Procopiuc,Suresh Venkatasubramanian
#t2008
#cACM Transactions on Algorithms
#index1077368
#%73
#%2583
#%220006
#%224718
#%610559
#%803967
#%847974
#%854462
#%889526
#%951704
#%952648
#%952683
#%953449
#%953551
#%953549
#%976254
#%978225
#%1014342
#%1058447
#%1059461
#%1061881
#%1092451
#!
  
#*Path decomposition under a new cost measure with applications to optical network design.
#@Elliot Anshelevich,Lisa Zhang
#t2008
#cACM Transactions on Algorithms
#index1077369
#%400896
#%610926
#%611355
#%611408
#%622955
#%952633
#%1061795
#!
  
#*Faster approximation schemes for fractional multicommodity flow problems.
#@George Karakostas
#t2008
#cACM Transactions on Algorithms
#index1077370
#%210741
#%610846
#%611234
#%611378
#%621296
#%622432
#%951572
#%972545
#%1059787
#%1061340
#%3005546
#!
  
#*Thin heaps, thick heaps.
#@Haim Kaplan,Robert Endre Tarjan
#t2008
#cACM Transactions on Algorithms
#index1077371
#%75
#%139225
#%211606
#%415279
#%610098
#%621282
#%622416
#%651175
#%750149
#%771370
#%776281
#%776732
#%798187
#%838154
#%950340
#%950342
#%952887
#%971959
#%973036
#%1060469
#!
  
#*Alternation and redundancy analysis of the intersection problem.
#@Jérémy Barbay,Claire Kenyon
#t2008
#cACM Transactions on Algorithms
#index1077372
#%210675
#%267342
#%544923
#%610364
#%951069
#%971472
#%1060593
#!
  
#*A faster and simpler fully dynamic transitive closure.
#@Liam Roditty
#t2008
#cACM Transactions on Algorithms
#index1077373
#%211160
#%211638
#%621413
#%622509
#%931892
#%979975
#%1092253
#!
  
#*The collective memory of amnesic processes.
#@Rachid Guerraoui,Ron R. Levy,Bastian Pochon,Jim Pugh
#t2008
#cACM Transactions on Algorithms
#index1077374
#%220365
#%543923
#%653971
#%773619
#%949628
#%952526
#%988304
#%1123599
#%1123602
#!
  
#*Uniform deterministic dictionaries.
#@Milan Ruzic
#t2008
#cACM Transactions on Algorithms
#index1077375
#%186458
#%209906
#%267817
#%611019
#%611453
#%620152
#%620343
#%621261
#%776463
#%953052
#%952847
#%971472
#%971958
#%1025742
#%1059029
#!
  
#*No sorting&quest; better searching&excl;.
#@Gianni Franceschini,Roberto Grossi
#t2008
#cACM Transactions on Algorithms
#index1077376
#% 
#!
  
#*Randomized minimum spanning tree algorithms using exponentially fewer random bits.
#@Seth Pettie,Vijaya Ramachandran
#t2008
#cACM Transactions on Algorithms
#index1077377
#%704
#%2022
#%611204
#%611004
#%614187
#%621148
#%621611
#%622478
#%771717
#%798187
#%887600
#%932183
#%949981
#%949983
#%950088
#%950018
#%950365
#%950513
#%950839
#%951313
#%953060
#%972145
#%1059038
#%1059072
#%1059340
#%1059309
#%1060208
#%1061263
#%1061792
#!
  
#*Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.
#@Shuchi Chawla,Anupam Gupta,Harald Räcke
#t2008
#cACM Transactions on Algorithms
#index1077378
#%110623
#%210848
#%211148
#%210999
#%609841
#%610957
#%621296
#%621294
#%621393
#%622949
#%783684
#%888676
#%950051
#%951026
#%951572
#%971896
#%1013705
#%1058786
#!
  
#*Compact dictionaries for variable-length keys and data with applications.
#@Daniel K. Blandford,Guy E. Blelloch
#t2008
#cACM Transactions on Algorithms
#index1077379
#%211020
#%267701
#%598424
#%610068
#%610066
#%749749
#%769738
#%817924
#%837389
#%951209
#%953454
#%1058717
#%1059029
#%1059410
#%1059480
#%1060106
#%1060203
#%1078755
#%610073
#!
  
#*Primal-dual approach for directed vertex connectivity augmentation and generalizations.
#@László A. Végh,András A. Benczúr
#t2008
#cACM Transactions on Algorithms
#index1077380
#%185907
#%186286
#%622069
#%622430
#%836074
#%975675
#%975674
#%976396
#%976473
#%1061347
#%3005546
#!
  
#*Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling.
#@Éric Fusy,Gilles Schaeffer,Dominique Poulalhon
#t2008
#cACM Transactions on Algorithms
#index1077381
#%110548
#%211533
#%267701
#%611030
#%611203
#%611359
#%620013
#%623080
#%750751
#%750804
#%817924
#%830897
#%834080
#%977154
#%977430
#%993867
#%1059480
#%1061461
#%1061511
#%1091235
#%1133751
#!
  
#*Guest editorial.
#@Adam L. Buchsbaum
#t2008
#cACM Transactions on Algorithms
#index1077382
#% 
#!
  
#*Limitations of cross-monotonic cost-sharing schemes.
#@Nicole Immorlica,Mohammad Mahdian,Vahab S. Mirrokni
#t2008
#cACM Transactions on Algorithms
#index1077383
#%211515
#%610371
#%610611
#%610620
#%610770
#%610966
#%622360
#%622361
#!
  
#*Dynamic routing schemes for graphs with low local density.
#@Amos Korman,David Peleg
#t2008
#cACM Transactions on Algorithms
#index1077384
#%209811
#%211271
#%544092
#%544578
#%614640
#%620512
#%824256
#%851240
#%949576
#%951285
#%952546
#%952821
#%971902
#%1059058
#%1059943
#%1061049
#!
  
#*On the approximability of some network design problems.
#@Julia Chuzhoy,Anupam Gupta,Joseph Naor,Amitabh Sinha
#t2008
#cACM Transactions on Algorithms
#index1077385
#%46473
#%186459
#%209974
#%209911
#%210840
#%210849
#%211090
#%211281
#%407000
#%406966
#%610150
#%610203
#%614488
#%621940
#%622196
#%622234
#%622204
#%624142
#%816480
#%861924
#%949573
#%951041
#%953022
#%953403
#%1060340
#%1090152
#%1122021
#%2892281
#%3007117
#!
  
#*An asymptotic approximation scheme for multigraph edge coloring.
#@Peter Sanders,David Steurer
#t2008
#cACM Transactions on Algorithms
#index1077386
#%46582
#%851478
#%930317
#%976513
#%1061659
#!
  
#*Dynamic entropy-compressed sequences and full-text indexes.
#@Veli Mäkinen,Gonzalo Navarro
#t2008
#cACM Transactions on Algorithms
#index1077387
#%2526
#%118743
#%210951
#%610066
#%610503
#%610658
#%610659
#%610637
#%611177
#%611140
#%651247
#%833272
#%950286
#%1025708
#%1059410
#%1059931
#%1077326
#%1077327
#%1095874
#!
  
#*Getting the best response for your erg.
#@Kirk Pruhs,Patchrawat Uthaisombut,Gerhard J. Woeginger
#t2008
#cACM Transactions on Algorithms
#index1077388
#%132833
#%210023
#%209966
#%212038
#%566906
#%610783
#%807494
#%1008379
#%1098568
#!
  
#*A new approximation algorithm for the asymmetric TSP with triangle inequality.
#@Markus Bläser
#t2008
#cACM Transactions on Algorithms
#index1077389
#%2616
#%610035
#%620058
#%950834
#%1061626
#%3005546
#!
  
#*Improved algorithms for optimal embeddings.
#@Nishanth Chandran,Ryan Moriarty,Rafail Ostrovsky,Omkant Pandey,Mohammad Ali Safari,Amit Sahai
#t2008
#cACM Transactions on Algorithms
#index1077390
#%111167
#%609939
#%611167
#%621363
#%621693
#%622479
#%832456
#%835904
#%853639
#%930157
#%1031077
#!
  
#*Fully dynamic algorithms for chordal graphs and split graphs.
#@Louis Ibarra
#t2008
#cACM Transactions on Algorithms
#index1077391
#%931034
#%933139
#%950651
#%972981
#%1059504
#%1059786
#%1060536
#%1089427
#%1095306
#!
  
#*Deterministic conflict-free coloring for intervals: From offline to online.
#@Amotz Bar-Noy,Panagiotis Cheilaris,Shakhar Smorodinsky
#t2008
#cACM Transactions on Algorithms
#index1077392
#%110640
#%110835
#%610506
#%614009
#%843465
#%853875
#%931911
#%1059140
#%1060746
#%1061997
#%3005125
#!
  
#*Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.
#@Noga Alon,Mihai Badoiu,Erik D. Demaine,Martin Farach-Colton,Mohammad Taghi Hajiaghayi,Anastasios Sidiropoulos
#t2008
#cACM Transactions on Algorithms
#index1077393
#%110675
#%209856
#%609939
#%609986
#%609937
#%950259
#%953072
#%1058376
#%1061202
#!
  
#*The relative worst order ratio applied to seat reservation.
#@Joan Boyar,Paul Medvedev
#t2008
#cACM Transactions on Algorithms
#index1077394
#%610876
#%776121
#%973238
#%1054363
#%1058698
#%1077339
#!
  
#*Multipartite priority queues.
#@Amr Elmasry,Claus Jensen,Jyrki Katajainen
#t2008
#cACM Transactions on Algorithms
#index1077395
#%267889
#%620193
#%622070
#%622416
#%624066
#%741654
#%750149
#%771370
#%776732
#%776734
#%832520
#%953305
#%1025672
#%1059374
#%1077371
#!
  
#*On the minimum common integer partition problem.
#@Xin Chen,Lan Liu,Zheng Liu,Tao Jiang
#t2008
#cACM Transactions on Algorithms
#index1077396
#%522
#%622245
#%1086962
#!
  
#*Online nonpreemptive scheduling of equal-length jobs on two identical machines.
#@Michael H. Goldwasser,Mark Pedigo
#t2008
#cACM Transactions on Algorithms
#index1077397
#%953008
#%1054468
#%1054470
#%1060463
#%1060807
#%3005125
#!
  
#*Kinetic and dynamic data structures for closest pair and all nearest neighbors.
#@Pankaj K. Agarwal,Haim Kaplan,Micha Sharir
#t2008
#cACM Transactions on Algorithms
#index1077398
#%185859
#%211772
#%467126
#%609779
#%610848
#%610740
#%621514
#%803436
#%803563
#%804000
#%843891
#%931679
#%952630
#%971332
#!
  
#*Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.
#@Fedor V. Fomin,Fabrizio Grandoni,Artem V. Pyatkin,Alexey A. Stepanov
#t2008
#cACM Transactions on Algorithms
#index1077399
#%212001
#%212003
#%610003
#%610443
#%610791
#%750949
#%818008
#%821954
#%861361
#%934773
#%1095225
#!
  
#*Algorithms for center and Tverberg points.
#@Pankaj K. Agarwal,Micha Sharir,Emo Welzl
#t2008
#cACM Transactions on Algorithms
#index1077400
#%610159
#%950099
#%951147
#%978628
#%1156038
#%3004446
#!
  
#*Competitive buffer management for shared-memory switches.
#@William Aiello,Alexander Kesselman,Yishay Mansour
#t2008
#cACM Transactions on Algorithms
#index1077401
#%136867
#%609843
#%621345
#%749659
#%776121
#%952535
#%953178
#%1058347
#%1059757
#%1062293
#%1077301
#%1092561
#%1122055
#%3005125
#!
  
#*SRPT optimally utilizes faster machines to minimize flow time.
#@Eric Torng,Jason McCullough
#t2008
#cACM Transactions on Algorithms
#index1077402
#%613976
#%621700
#%622620
#%950817
#%1013093
#%1025582
#%1058482
#%1090779
#!
  
#*Structure and linear-time recognition of 4-leaf powers.
#@Andreas Brandstädt,Van Bang Le,R. Sritharan
#t2008
#cACM Transactions on Algorithms
#index1077403
#%851455
#%953170
#%953423
#%1060536
#%1061638
#%1077279
#!
  
#*On hard instances of approximate vertex cover.
#@Sundar Vishwanathan
#t2008
#cACM Transactions on Algorithms
#index1077404
#%210582
#%211091
#%610179
#%741196
#%949793
#%950456
#%1059441
#!
  
#*On an infinite family of solvable Hanoi graphs.
#@Dany Azriel,Noam Solomon,Shay Solomon
#t2008
#cACM Transactions on Algorithms
#index1077405
#%953353
#%1058907
#%1077252
#!
  
#*Distributed weighted vertex cover via maximal matchings.
#@Fabrizio Grandoni,Jochen Könemann,Alessandro Panconesi
#t2008
#cACM Transactions on Algorithms
#index1077406
#%2022
#%621855
#%741196
#%841531
#%861234
#%931885
#%950618
#%953194
#%1059441
#%1061449
#!
  
#*Combinatorial dominance guarantees for problems with infeasible solutions.
#@Daniel Berend,Steven Skiena,Yochai Twitto
#t2008
#cACM Transactions on Algorithms
#index1077407
#%210090
#%837022
#%837020
#%924066
#%950753
#%952567
#%1059915
#!
  
#*A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
#@Guy Even,Jon Feldman,Guy Kortsarz,Zeev Nutov
#t2009
#cACM Transactions on Algorithms
#index1077408
#%186032
#%610812
#%837754
#%953192
#%1059341
#!
  
#*Average-case analysis of some plurality algorithms.
#@Laurent Alonso,Edward M. Reingold
#t2009
#cACM Transactions on Algorithms
#index1077409
#%750901
#%839035
#%929619
#%933968
#%1052362
#%1058325
#%1077250
#%1077246
#%1088659
#!
  
#*Testing bipartiteness of geometric intersection graphs.
#@David Eppstein
#t2009
#cACM Transactions on Algorithms
#index1077410
#%2583
#%110955
#%111139
#%111162
#%224986
#%224801
#%610740
#%611203
#%816679
#%819420
#%842894
#%852820
#%949991
#%950693
#%951209
#%951702
#%1058477
#%1119096
#!
  
#*Algorithms for distributional and adversarial pipelined filter ordering problems.
#@Anne Condon,Amol Deshpande,Lisa Hellerstein,Ning Wu
#t2009
#cACM Transactions on Algorithms
#index1077411
#%209984
#%299830
#%597925
#%598335
#%598668
#%598861
#%599934
#%610277
#%622414
#%643047
#%643819
#%750063
#%887133
#%1065436
#%544958
#!
  
#*Approximating the distance to properties in bounded-degree and general sparse graphs.
#@Sharon Marko,Dana Ron
#t2009
#cACM Transactions on Algorithms
#index1077412
#%209743
#%210167
#%557776
#%610901
#%950466
#%950618
#%973161
#%1052459
#%1052224
#%1052400
#%1059158
#%1059428
#%1059740
#%1060116
#%1059994
#%1060758
#%1060906
#%1062015
#%1095742
#!
  
#*Bicriteria approximation tradeoff for the node-cost budget problem.
#@Yuval Rabani,Gabriel Scalosub
#t2009
#cACM Transactions on Algorithms
#index1077413
#%610807
#%610696
#%622101
#%622197
#%624298
#%816480
#%932137
#%953216
#%953403
#%1059341
#%1060751
#!
  
#*A polynomial-time approximation scheme for embedding hypergraph in a cycle.
#@Guojun Li,Xiaotie Deng,Ying Xu
#t2009
#cACM Transactions on Algorithms
#index1077414
#%130972
#%836843
#%931424
#%951064
#%1052375
#%1079265
#%1125335
#!
  
#*Throughput maximization of real-time scheduling with batching.
#@Amotz Bar-Noy,Sudipto Guha,Yoav Katz,Joseph Naor,Baruch Schieber,Hadas Shachnai
#t2009
#cACM Transactions on Algorithms
#index1077415
#%609962
#%609954
#%813796
#%949707
#%951944
#%1011036
#%1058879
#%1061063
#%1278935
#!
  
#*Linear time 3-approximation for the MAST problem.
#@Vincent Berry,Christophe Paul,Sylvain Guillemot,François Nicolas
#t2009
#cACM Transactions on Algorithms
#index1077416
#%46591
#%186295
#%817270
#%837112
#%931056
#%933978
#%953144
#%1058356
#%1059461
#%1087071
#!
  
#*Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.
#@Ke Chen,Haim Kaplan,Micha Sharir
#t2009
#cACM Transactions on Algorithms
#index1077417
#%110835
#%614009
#%776734
#%843465
#%974268
#%1059140
#%1060746
#%1061997
#%3005125
#!
  
#*Compacting cuts: A new linear formulation for minimum cut.
#@Robert D. Carr,Goran Konjevod,Greg Little,Venkatesh Natarajan,Ojas Parekh
#t2009
#cACM Transactions on Algorithms
#index1227548
#%209940
#%211148
#%406659
#%621173
#%621762
#%621849
#%835948
#%853238
#%861512
#%950456
#%950838
#%951673
#%1014328
#%1051843
#%1061645
#!
  
#*Minimizing movement.
#@Erik D. Demaine,Mohammad Taghi Hajiaghayi,Hamid Mahini,Amin S. Sayedi-Roshkhar,Shayan Oveis Gharan,Morteza Zadimoghaddam
#t2009
#cACM Transactions on Algorithms
#index1227549
#%506349
#%609875
#%610390
#%614085
#%614184
#%888103
#%931974
#%953139
#%953216
#%1124854
#%3002009
#!
  
#*Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition.
#@David Eppstein
#t2009
#cACM Transactions on Algorithms
#index1227550
#%108875
#%111002
#%210349
#%212075
#%611336
#%621947
#%622513
#%651116
#%770019
#%824645
#%929964
#%952512
#%953453
#%979967
#%1009214
#%1105377
#!
  
#*An ( log ) approximation scheme for Steiner tree in planar graphs.
#@Glencora Borradaile,Philip N. Klein,Claire Mathieu
#t2009
#cACM Transactions on Algorithms
#index1227551
#% 
#!
  
#*Making deterministic signatures quickly.
#@Milan Ruzic
#t2009
#cACM Transactions on Algorithms
#index1227552
#%186458
#%209906
#%209905
#%210675
#%269348
#%609857
#%610101
#%611453
#%620343
#%621283
#%621587
#%622051
#%622894
#%651186
#%651247
#%821937
#%950284
#%953052
#%971472
#%971327
#%971958
#%1059029
#%1077375
#%544865
#!
  
#*Instability of FIFO in the permanent sessions model at arbitrarily small network loads.
#@Matthew Andrews
#t2009
#cACM Transactions on Algorithms
#index1227553
#%210725
#%402810
#%588452
#%614213
#%614452
#%949528
#%952580
#%1058337
#%1058607
#%1122634
#%1122491
#!
  
#*Optimal dynamic vertical ray shooting in rectilinear planar subdivisions.
#@Yoav Giyora,Haim Kaplan
#t2009
#cACM Transactions on Algorithms
#index1227554
#%73
#%212021
#%212025
#%212119
#%609771
#%610385
#%610361
#%611057
#%611575
#%611651
#%621842
#%622415
#%749829
#%889767
#%952634
#%971959
#%1058406
#%1058921
#%1058807
#%1059385
#%1094092
#!
  
#*Near-optimal algorithms for maximum constraint satisfaction problems.
#@Moses Charikar,Konstantin Makarychev,Yury Makarychev
#t2009
#cACM Transactions on Algorithms
#index1227555
#%104915
#%210356
#%212204
#%406902
#%623052
#%623252
#%623429
#%623382
#%825050
#%826242
#%861632
#%862090
#%862404
#%950456
#%950618
#%1060766
#%1221798
#!
  
#*Foreword to special issue on SODA 2007.
#@Harold N. Gabow
#t2009
#cACM Transactions on Algorithms
#index1227556
#% 
#!
  
#*A near-optimal algorithm for estimating the entropy of a stream.
#@Amit Chakrabarti,Graham Cormode,Andrew McGregor
#t2010
#cACM Transactions on Algorithms
#index2869265
#%185960
#%211004
#%212234
#%396987
#%481144
#%544872
#%544964
#%557748
#%588868
#%597291
#%609933
#%609973
#%610058
#%610348
#%610673
#%611429
#%611367
#%614285
#%622341
#%660082
#%824799
#%827020
#%952819
#%953157
#%971408
#%1058545
#%1091084
#%1121727
#!
  
#*Approximation algorithms for data placement on parallel disks.
#@Leana Golubchik,Sanjeev Khanna,Samir Khuller,Ramakrishna Thurimella,An Zhu
#t2009
#cACM Transactions on Algorithms
#index2869214
#%2022
#%597711
#%598071
#%610202
#%775194
#%972793
#%1016666
#!
  
#*Approximate shared-memory counting despite a strong adversary.
#@James Aspnes,Keren Censor
#t2010
#cACM Transactions on Algorithms
#index2869243
#%104886
#%210630
#%543570
#%543596
#%544706
#%623319
#%768059
#%774430
#%949603
#%950295
#%952501
#%952503
#%971933
#%1123599
#%1123602
#%3002353
#!
  
#*On the bichromatic -set problem.
#@Timothy M. Chan
#t2010
#cACM Transactions on Algorithms
#index2869287
#% 
#!
  
#*Hausdorff distance under translation for points and balls.
#@Pankaj K. Agarwal,Sariel Har-Peled,Micha Sharir,Yusu Wang
#t2010
#cACM Transactions on Algorithms
#index2869291
#%81756
#%111091
#%210296
#%210914
#%609836
#%609893
#%610776
#%622246
#%775749
#%803492
#%803610
#%843564
#%949584
#%949579
#%951147
#%952520
#%1058357
#!
  
#*Maximal biconnected subgraphs of random planar graphs.
#@Konstantinos Panagiotou,Angelika Steger
#t2010
#cACM Transactions on Algorithms
#index2869248
#%611490
#%830897
#%831439
#%977154
#%979320
#%1051809
#%1051836
#%1061374
#%2939941
#!
  
#*A 4 kernel for feedback vertex set.
#@Stéphan Thomassé
#t2010
#cACM Transactions on Algorithms
#index2869261
#% 
#!
  
#*Approximating the minimum quadratic assignment problems.
#@Refael Hassin,Asaf Levin,Maxim Sviridenko
#t2009
#cACM Transactions on Algorithms
#index2869233
#%610181
#%611695
#%622101
#%837026
#%929792
#%934779
#%951516
#%1058410
#%1059341
#%1340573
#!
  
#*Improved online algorithms for the sorting buffer problem on line metrics.
#@Iftah Gamzu,Danny Segev
#t2009
#cACM Transactions on Algorithms
#index2869220
#%3703
#%186453
#%621393
#%623404
#%971896
#%979650
#!
  
#*An explicit universal cycle for the (-1)-permutations of an -set.
#@Frank Ruskey,Aaron Williams
#t2010
#cACM Transactions on Algorithms
#index2869266
#% 
#!
  
#*Adaptive sampling strategies for quickselects.
#@Conrado Martínez,Daniel Panario,Alfredo Viola
#t2010
#cACM Transactions on Algorithms
#index2869273
#%611081
#%771717
#%772820
#%831042
#%950088
#%953374
#%1052143
#%1059957
#%1073548
#%1074894
#%1093897
#!
  
#*Time-dependent multi-scheduling of multicast.
#@Rami Cohen,Dror Rawitz,Danny Raz
#t2009
#cACM Transactions on Algorithms
#index2869238
#%398865
#%402023
#%505524
#%505591
#%621778
#%949707
#%1122147
#%3002637
#!
  
#*Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm.
#@Kenneth L. Clarkson
#t2010
#cACM Transactions on Algorithms
#index2869278
#%111368
#%111186
#%335863
#%391359
#%609938
#%621364
#%804074
#%980008
#%985208
#%985182
#%1009372
#%1058876
#%1239943
#!
  
#*Jitter regulation for multiple streams.
#@David Hay,Gabriel Scalosub
#t2009
#cACM Transactions on Algorithms
#index2869224
#%588647
#%776121
#%1122270
#%1122442
#%1122731
#%3005125
#!
  
#*Fast asynchronous Byzantine agreement and leader election with full information.
#@Bruce M. Kapron,David Kempe,Valerie King,Jared Saia,Vishal Sanwalani
#t2010
#cACM Transactions on Algorithms
#index2869284
#%120320
#%210574
#%212125
#%212013
#%544501
#%544714
#%545026
#%610898
#%621479
#%621636
#%622854
#%623319
#%841360
#%949603
#%950024
#%951281
#%1052348
#!
  
#*A near-linear-time algorithm for computing replacement paths in planar directed graphs.
#@Yuval Emek,David Peleg,Liam Roditty
#t2010
#cACM Transactions on Algorithms
#index2869281
#%110600
#%210923
#%610910
#%611612
#%611784
#%620377
#%933081
#%951699
#%951697
#%1059719
#!
  
#*Enumeration of isolated cliques and pseudo-cliques.
#@Hiro Ito,Kazuo Iwama
#t2009
#cACM Transactions on Algorithms
#index2869215
#%256364
#%663798
#%835951
#%952625
#%1094953
#%472746
#!
  
#*Editorial Note.
#@Susanne Albers
#t2010
#cACM Transactions on Algorithms
#index2869260
#% 
#!
  
#*Parametric analysis for ungapped Markov models of evolution.
#@David Fernández-Baca,Balaji Venkatachalam
#t2009
#cACM Transactions on Algorithms
#index2869212
#%836753
#%952923
#%952921
#!
  
#*Shortest paths in directed planar graphs with negative lengths: A linear-space ( log )-time algorithm.
#@Philip N. Klein,Shay Mozes,Oren Weimann
#t2010
#cACM Transactions on Algorithms
#index2869242
#%610910
#%611666
#%839426
#%950342
#%950799
#%971895
#%972200
#%972584
#%1031963
#%1033250
#%1059345
#%1059253
#%1060067
#%1061539
#!
  
#*Distributed error confinement.
#@Yossi Azar,Shay Kutten,Boaz Patt-Shamir
#t2010
#cACM Transactions on Algorithms
#index2869267
#%186437
#%209989
#%543993
#%543889
#%544204
#%567266
#%610835
#%621334
#%653612
#%653607
#%673320
#%771309
#%773619
#%792073
#%795926
#%841384
#%931348
#%931412
#%931674
#%934633
#%949653
#%990210
#%1059804
#%1078720
#%1092827
#%1093262
#%1093901
#%1121957
#%1123702
#%1124911
#%1125451
#!
  
#*Foreword to special issue on SODA 2008.
#@Mohammad Taghi Hajiaghayi,Shang-Hua Teng
#t2010
#cACM Transactions on Algorithms
#index2869288
#% 
#!
  
#*Foreword to special issue SODA 2009.
#@Claire Mathieu
#t2010
#cACM Transactions on Algorithms
#index2869249
#% 
#!
  
#*Approximating corridors and tours via restriction and relaxation techniques.
#@Arturo Gonzalez-Gutierrez,Teofilo F. Gonzalez
#t2010
#cACM Transactions on Algorithms
#index2869268
#%446414
#%783764
#%804025
#!
  
#*Dynamic pricing for impatient bidders.
#@Nikhil Bansal,Ning Chen,Neva Cherniavsky,Atri Rudra,Baruch Schieber,Maxim Sviridenko
#t2010
#cACM Transactions on Algorithms
#index2869245
#%592754
#%610076
#%610684
#%610965
#%1089476
#%3005125
#!
  
#*On distributing symmetric streaming computations.
#@Jon Feldman,S. Muthukrishnan,Anastasios Sidiropoulos,Clifford Stein,Zoya Svitkina
#t2010
#cACM Transactions on Algorithms
#index2869289
#%104356
#%186084
#%523753
#%621206
#%622811
#%951923
#%971598
#%972921
#%1060117
#%1060286
#%1073169
#%1124476
#%1180292
#!
  
#*The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity.
#@Wolfgang W. Bein,Mordecai J. Golin,Lawrence L. Larmore,Yan Zhang
#t2009
#cACM Transactions on Algorithms
#index2869227
#%146802
#%610961
#%614094
#%623314
#%836069
#%836303
#%930145
#%953635
#%953654
#%1058522
#%1091347
#!
  
#*An optimal decomposition algorithm for tree edit distance.
#@Erik D. Demaine,Shay Mozes,Benjamin Rossman,Oren Weimann
#t2009
#cACM Transactions on Algorithms
#index2869230
#%522
#%3582
#%610914
#%642330
#%951388
#%951779
#%952746
#%953534
#%972981
#%1059461
#%1060682
#%1089401
#!
  
#*Low distortion spanners.
#@Seth Pettie
#t2009
#cACM Transactions on Algorithms
#index2869223
#%212137
#%212029
#%611322
#%614640
#%623067
#%818034
#%842963
#%949653
#%951285
#%951701
#%952546
#%952821
#%952822
#%971896
#%1052354
#%1058424
#%1059112
#%1059068
#%1060192
#%1061070
#%1061049
#%1061934
#%1077260
#%3001001
#!
  
#*Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.
#@Alexander D. Scott,Gregory B. Sorkin
#t2009
#cACM Transactions on Algorithms
#index2869209
#%212001
#%212089
#%212003
#%622994
#%744722
#%744721
#%750949
#%825395
#%831328
#%839345
#%977721
#%993684
#%1058651
#%1059652
#%1089785
#%1341676
#!
  
#*Dial a Ride from -forest.
#@Anupam Gupta,Mohammad Taghi Hajiaghayi,Viswanath Nagarajan,R. Ravi
#t2010
#cACM Transactions on Algorithms
#index2869255
#% 
#!
  
#*A generalized minimum cost -clustering.
#@Asaf Levin
#t2009
#cACM Transactions on Algorithms
#index2869213
#% 
#!
  
#*Approximating fractional hypertree width.
#@Dániel Marx
#t2010
#cACM Transactions on Algorithms
#index2869258
#%210235
#%212179
#%484521
#%545593
#%610657
#%621615
#%622187
#%623072
#%865299
#%950787
#%951953
#%952725
#%972424
#%975106
#%978744
#%978691
#%1058651
#%1059157
#!
  
#*Randomized fast design of short DNA words.
#@Ming-Yang Kao,Manan Sanghi,Robert T. Schweller
#t2009
#cACM Transactions on Algorithms
#index2869218
#%2022
#%159249
#%558778
#%609827
#%961904
#%1089677
#%1091330
#%1340846
#!
  
#*Comparison-based time-space lower bounds for selection.
#@Timothy M. Chan
#t2010
#cACM Transactions on Algorithms
#index2869246
#%209882
#%210364
#%211510
#%611494
#%621510
#%623347
#%624223
#%771717
#%844091
#%862020
#%949774
#%950088
#%951172
#%971370
#%971473
#%971555
#%971953
#%972934
#%1025754
#%1058548
#%1058691
#%1059072
#%1060671
#%1061263
#%1093651
#!
  
#*Editorial note.
#@Susanne Albers
#t2010
#cACM Transactions on Algorithms
#index2869285
#% 
#!
  
#*Trading off space for passes in graph streaming problems.
#@Camil Demetrescu,Irene Finocchi,Andrea Ribichini
#t2009
#cACM Transactions on Algorithms
#index2869235
#%209841
#%210911
#%544808
#%545097
#%545098
#%609973
#%610492
#%622120
#%623384
#%820196
#%833184
#%929641
#%971408
#%972103
#%1060573
#!
  
#*An approximation algorithm for the maximum leaf spanning arborescence problem.
#@Matthew Drescher,Adrian Vetta
#t2010
#cACM Transactions on Algorithms
#index2869272
#%186233
#%186511
#%931277
#%953350
#!
  
#*Low-dimensional lattice basis reduction revisited.
#@Phong Q. Nguyen,Damien Stehlé
#t2009
#cACM Transactions on Algorithms
#index2869210
#%481068
#%621122
#%622403
#%623457
#%953259
#%953624
#%1014208
#%1094479
#!
  
#*Finding shortest contractible and shortest separating cycles in embedded graphs.
#@Sergio Cabello
#t2010
#cACM Transactions on Algorithms
#index2869244
#%111259
#%610156
#%610137
#%610442
#%610467
#%611336
#%611548
#%804094
#%817982
#%825238
#%844045
#%951961
#%972200
#%978231
#%1025658
#%1128146
#!
  
#*A linear algorithm for computing convex hulls for random lines.
#@Daniel Berend,Vladimir Braverman
#t2009
#cACM Transactions on Algorithms
#index2869208
#%2022
#%3482
#%932911
#%952515
#%952843
#%1059780
#!
  
#*Finding heaviest -subgraphs in real weighted graphs, with applications.
#@Virginia Vassilevska,Ryan Williams,Raphael Yuster
#t2010
#cACM Transactions on Algorithms
#index2869269
#% 
#!
  
#*Facility location with hierarchical facility costs.
#@Zoya Svitkina,Éva Tardos
#t2010
#cACM Transactions on Algorithms
#index2869254
#%155450
#%406996
#%610577
#%610727
#%611253
#%611280
#%623147
#%950771
#%953022
#%953262
#%977868
#%1058856
#%1058849
#!
  
#*Updating relaxed -d trees.
#@Amalia Duch,Conrado Martínez
#t2009
#cACM Transactions on Algorithms
#index2869221
#% 
#!
  
#*The directed circular arrangement problem.
#@Joseph Naor,Roy Schwartz
#t2010
#cACM Transactions on Algorithms
#index2869275
#%268562
#%610181
#%611268
#%621296
#%934779
#%950227
#%951026
#%1059290
#%1141054
#!
  
#*A better approximation ratio for the vertex cover problem.
#@George Karakostas
#t2009
#cACM Transactions on Algorithms
#index2869216
#%104834
#%185912
#%212212
#%609841
#%610179
#%621296
#%741196
#%973305
#%1059441
#%1090055
#!
  
#*All maximal independent sets and dynamic dominance for sparse graphs.
#@David Eppstein
#t2009
#cACM Transactions on Algorithms
#index2869211
#%109196
#%481271
#%835975
#%842933
#%931986
#%951120
#%1058809
#%1090178
#%1094953
#%3458384
#!
  
#*Lower-bounded facility location.
#@Zoya Svitkina
#t2010
#cACM Transactions on Algorithms
#index2869282
#%46627
#%210840
#%211090
#%211517
#%406996
#%610259
#%622359
#%622196
#%623147
#%820125
#%953262
#%1013553
#%1058856
#%1058849
#%1278854
#%1288439
#!
  
#*Discounted deterministic Markov decision processes and discounted all-pairs shortest paths.
#@Omid Madani,Mikkel Thorup,Uri Zwick
#t2010
#cACM Transactions on Algorithms
#index2869256
#%73
#%13976
#%139320
#%335472
#%622442
#%750868
#%798317
#%861765
#%887483
#%888743
#%950342
#%951918
#%1058918
#%1059529
#%1060573
#%1089419
#%1095429
#%1117805
#%1278837
#!
  
#*Quantum algorithms for Simon's problem over nonabelian groups.
#@Gorjan Alagic,Cristopher Moore,Alexander Russell
#t2009
#cACM Transactions on Algorithms
#index2869232
#%210009
#%211476
#%211720
#%611045
#%611047
#%622056
#%622233
#%622232
#%1059886
#%1060454
#%1060461
#!
  
#*Optimization problems in multiple-interval graphs.
#@Ayelet Butman,Danny Hermelin,Moshe Lewenstein,Dror Rawitz
#t2010
#cACM Transactions on Algorithms
#index2869247
#%81703
#%609971
#%609910
#%610707
#%611454
#%622980
#%803442
#%835994
#%839117
#%852820
#%949707
#%952711
#%952982
#%952659
#%953139
#%1059129
#%1061571
#%1095073
#!
  
#*Latency-constrained aggregation in sensor networks.
#@Luca Becchetti,Alberto Marchetti-Spaccamela,Andrea Vitaletti,Peter Korteweg,Martin Skutella,Leen Stougie
#t2009
#cACM Transactions on Algorithms
#index2869225
#%245313
#%297010
#%408844
#%456954
#%505658
#%584383
#%610097
#%610601
#%775197
#%783903
#%793249
#%794489
#%1118535
#!
  
#*Minimum cycle bases: Faster and simpler.
#@Kurt Mehlhorn,Dimitrios Michail
#t2009
#cACM Transactions on Algorithms
#index2869234
#%212029
#%624204
#%749755
#%750971
#%786304
#%932427
#%1059545
#%1060901
#%1061063
#!
  
#*Approximating connectivity augmentation problems.
#@Zeev Nutov
#t2009
#cACM Transactions on Algorithms
#index2869229
#%611126
#%622980
#%750501
#%798024
#%837757
#%971937
#%973332
#%975675
#%976396
#%1059836
#%1060340
#%1061347
#%1096571
#!
  
#*Achieving anonymity via clustering.
#@Gagan Aggarwal,Rina Panigrahy,Tomás Feder,Dilys Thomas,Krishnaram Kenthapadi,Samir Khuller,An Zhu
#t2010
#cACM Transactions on Algorithms
#index2869274
#%210840
#%211025
#%211090
#%299448
#%545247
#%599149
#%610186
#%952595
#%1113525
#!
  
#*Finding one tight cycle.
#@Sergio Cabello,Matt DeVos,Jeff Erickson,Bojan Mohar
#t2010
#cACM Transactions on Algorithms
#index2869283
#%110805
#%111259
#%610156
#%610442
#%610467
#%611336
#%611548
#%623268
#%817982
#%825238
#%844045
#%1059210
#!
  
#*A fast algorithm to generate open meandric systems and meanders.
#@Bruce A. Bobier,Joe Sawada
#t2010
#cACM Transactions on Algorithms
#index2869262
#%974342
#%1092879
#!
  
#*Bootstrapping a hop-optimal network in the weak sensor model.
#@Martin Farach-Colton,Rohan J. Fernandes,Miguel A. Mosteiro
#t2009
#cACM Transactions on Algorithms
#index2869219
#%209864
#%343901
#%431977
#%506476
#%544323
#%609980
#%610911
#%611088
#%622130
#%793249
#%819498
#%971445
#%1052234
#%1059412
#%1064452
#!
  
#*Labeling schemes for vertex connectivity.
#@Amos Korman
#t2010
#cACM Transactions on Algorithms
#index2869253
#%209885
#%544589
#%544614
#%544657
#%544951
#%609725
#%610280
#%610585
#%610839
#%614640
#%620253
#%841397
#%890015
#%951697
#%1058317
#%1059737
#%1061021
#%1061470
#!
  
#*Inverse auctions: Injecting unique minima into random sets.
#@F. Thomas Bruss,Guy Louchard,Mark Daniel Ward
#t2009
#cACM Transactions on Algorithms
#index2869237
#%1091218
#%1092290
#!
  
#*Nondecreasing paths in a weighted graph or: How to optimally read a train schedule.
#@Virginia Vassilevska Williams
#t2010
#cACM Transactions on Algorithms
#index2869292
#%73
#%38718
#%186458
#%210650
#%211786
#%268156
#%622052
#%623336
#%623283
#%771709
#%950342
#%951699
#%951796
#%951918
#%971959
#%971983
#%972947
#%980007
#%993684
#%1058870
#%1094005
#!
  
#*Reasoning about online algorithms with weighted automata.
#@Benjamin Aminof,Orna Kupferman,Robby Lampert
#t2010
#cACM Transactions on Algorithms
#index2869259
#%3348
#%71371
#%79403
#%621570
#%776121
#%797486
#%889644
#%929879
#%949600
#%953392
#%3005125
#!
  
#*Competitive weighted throughput analysis of greedy protocols on DAGs.
#@Eyal Gordon,Adi Rosén
#t2010
#cACM Transactions on Algorithms
#index2869271
#%544242
#%609843
#%609846
#%621345
#%622483
#%952535
#%953178
#!
  
#*Geodesic delaunay triangulations in bounded planar domains.
#@Steve Oudot,Leonidas J. Guibas,Jie Gao,Yue Wang
#t2010
#cACM Transactions on Algorithms
#index2869280
#%110763
#%111273
#%111542
#%111650
#%505912
#%586675
#%606267
#%610220
#%611415
#%611618
#%611735
#%825724
#%844033
#%844075
#%1239917
#!
  
#*A local algorithm for finding dense subgraphs.
#@Reid Andersen
#t2010
#cACM Transactions on Algorithms
#index2869277
#%46538
#%210129
#%212141
#%611470
#%623067
#%642598
#%652714
#%794613
#%818034
#%820001
#%953258
#%1059273
#%1060122
#!
  
#*Balanced families of perfect hash functions and their applications.
#@Noga Alon,Shai Gutner
#t2010
#cACM Transactions on Algorithms
#index2869270
#%211560
#%415143
#%438908
#%611381
#%861707
#%949588
#%972274
#%1059202
#%1060117
#%1061573
#%1061885
#%1308314
#%2919590
#!
  
#*Efficient algorithms for the 2-gathering problem.
#@Alon Shalita,Uri Zwick
#t2010
#cACM Transactions on Algorithms
#index2869252
#%210840
#%211090
#%544841
#%611466
#%622067
#%623378
#%950366
#%971901
#%975206
#%977900
#!
  
#*Perfect matchings via uniform sampling in regular bipartite graphs.
#@Ashish Goel,Michael Kapralov,Sanjeev Khanna
#t2010
#cACM Transactions on Algorithms
#index2869250
#%209845
#%211500
#%610851
#%622424
#%623067
#%623339
#%818034
#%826568
#%1060403
#!
  
#*A linear-time algorithm to find a separator in a graph excluding a minor.
#@Bruce A. Reed,David R. Wood
#t2009
#cACM Transactions on Algorithms
#index2869263
#%610359
#%611214
#%611481
#%621296
#%621112
#%621214
#%621971
#%798198
#%798793
#%950227
#%951209
#%952725
#%952848
#%952996
#%953626
#%971382
#%972584
#%977721
#%978215
#%978707
#%979974
#%1059288
#%1060233
#%1061011
#%1060989
#%1094821
#%1270240
#%2921413
#!
  
#*Exponential time algorithms for the minimum dominating set problem on some graph classes.
#@Serge Gaspers,Dieter Kratsch,Mathieu Liedloff,Ioan Todinca
#t2009
#cACM Transactions on Algorithms
#index2869231
#%186102
#%836196
#%837393
#%931205
#%935079
#%952725
#%1058697
#%1059793
#!
  
#*Ordering by weighted number of wins gives a good ranking for weighted tournaments.
#@Don Coppersmith,Lisa Fleischer,Atri Rudra
#t2010
#cACM Transactions on Algorithms
#index2869276
#%12358
#%109400
#%610303
#%611482
#%621249
#%621855
#%623414
#%674010
#%798787
#%831274
#%861234
#%861647
#%931624
#%1060995
#%1061093
#!
  
#*Simultaneous source location.
#@Konstantin Andreev,Charles Garrod,Daniel Golovin,Bruce M. Maggs,Adam Meyerson
#t2009
#cACM Transactions on Algorithms
#index2869236
#%46547
#%186470
#%211517
#%211664
#%493212
#%614107
#%614323
#%621341
#%622980
#%623147
#%952499
#%1024842
#%1089125
#!
  
#*Approximating the distance to monotonicity in high dimensions.
#@Shahar Fattal,Dana Ron
#t2010
#cACM Transactions on Algorithms
#index2869264
#%557809
#%611649
#%622010
#%750918
#%862011
#%887842
#%889931
#%950466
#%971558
#%971885
#%973161
#%1052467
#%1052400
#%1060729
#%1060758
#%1060882
#%1061682
#%2851814
#!
  
#*Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts.
#@Philip Bille,Rolf Fagerberg,Inge Li Gørtz
#t2009
#cACM Transactions on Algorithms
#index2869226
#%146435
#%146653
#%609802
#%615960
#%776541
#%808455
#%832865
#%951242
#%953287
#%971302
#%979496
#%979568
#%1058934
#%1058974
#%1059029
#!
  
#*Truthful unsplittable flow for large capacity networks.
#@Yossi Azar,Iftah Gamzu,Shai Gutner
#t2010
#cACM Transactions on Algorithms
#index2869241
#%14227
#%209914
#%210741
#%211259
#%609870
#%621328
#%621583
#%623329
#%626779
#%798622
#%818134
#%951010
#%972129
#%972793
#%1060484
#%1061340
#%1077312
#%1168297
#!
  
#*Clustering for metric and nonmetric distance measures.
#@Marcel R. Ackermann,Johannes Blömer,Christian Sohler
#t2010
#cACM Transactions on Algorithms
#index2869279
#%21161
#%111186
#%111599
#%186330
#%210848
#%211197
#%212077
#%542197
#%578956
#%594510
#%611640
#%611538
#%611702
#%621364
#%622246
#%622359
#%623225
#%832677
#%842947
#%985048
#%985178
#%1009745
#%1341458
#!
  
#*Finding equitable convex partitions of points in a polygon efficiently.
#@John Gunnar Carlsson,Benjamin Armbruster,Yinyu Ye
#t2010
#cACM Transactions on Algorithms
#index2869286
#%467155
#%467147
#%803443
#!
  
#*Computing rank-convolutions with a mask.
#@László Babai,Pedro F. Felzenszwalb
#t2009
#cACM Transactions on Algorithms
#index2869222
#%127745
#%185988
#%907582
#%908016
#%1031673
#%1061539
#!
  
#*Two-phase greedy algorithms for some classes of combinatorial linear programs.
#@Ulrich Faigle,Britta Peis
#t2010
#cACM Transactions on Algorithms
#index2869290
#% 
#!
  
#*Mechanism design for fractional scheduling on unrelated machines.
#@George Christodoulou,Elias Koutsoupias,Annamária Kovács
#t2010
#cACM Transactions on Algorithms
#index2869257
#%11779
#%209925
#%211257
#%211259
#%592813
#%592955
#%609870
#%611559
#%611593
#%621583
#%621860
#%621859
#%622819
#%626779
#%1013938
#%1168297
#!
  
#*Sublinear estimation of entropy and information distances.
#@Sudipto Guha,Andrew McGregor,Suresh Venkatasubramanian
#t2009
#cACM Transactions on Algorithms
#index2869217
#%185960
#%186090
#%210052
#%396987
#%545112
#%578956
#%588868
#%597291
#%610673
#%611429
#%621381
#%622465
#%642600
#%660082
#%824799
#%971408
#%985048
#%985178
#%1058545
#%300459
#!
  
#*Admission control to minimize rejections and online set cover with repetitions.
#@Noga Alon,Yossi Azar,Shai Gutner
#t2009
#cACM Transactions on Algorithms
#index2869228
#%1054344
#%621191
#%1077310
#%621326
#%209976
#%609917
#%209983
#!
  
#*Resilient dictionaries.
#@Irene Finocchi,Fabrizio Grandoni,Giuseppe F. Italiano
#t2009
#cACM Transactions on Algorithms
#index2869239
#%209968
#%210845
#%611084
#%611456
#%611570
#%621554
#%750940
#%1059165
#%1093960
#%1093958
#%1167324
#!
  
#*Periodicity testing with sublinear samples and space.
#@Funda Ergün,S. Muthukrishnan,Süleyman Cenk Sahinalp
#t2010
#cACM Transactions on Algorithms
#index2869251
#%299664
#%621402
#%622121
#%643031
#%950466
#!
  
#*Optimizing throughput and energy in online deadline scheduling.
#@Ho-Leung Chan,Joseph Wun-Tat Chan,Tak Wah Lam,Lap-Kei Lee,Kin-Sum Mak,Prudence W. H. Wong
#t2009
#cACM Transactions on Algorithms
#index2869240
#%210041
#%212038
#%523829
#%523809
#%611542
#%613287
#%614140
#%822613
#%951949
#%1008379
#%1016290
#%1062207
#%1077362
#%1077349
#%1077388
#%1098624
#!
  
#*On the online unit clustering problem.
#@Leah Epstein,Rob van Stee
#t2010
#cACM Transactions on Algorithms
#index2976285
#%851236
#%1058847
#!
  
#*How to probe for an extreme value.
#@Ashish Goel,Sudipto Guha,Kamesh Munagala
#t2010
#cACM Transactions on Algorithms
#index2976282
#%210444
#%210853
#%210716
#%211212
#%211780
#%301111
#%523811
#%544946
#%544945
#%545057
#%545210
#%588438
#%597919
#%597916
#%597918
#%598861
#%610150
#%610768
#%611576
#%622205
#%642513
#%817569
#%971682
#%1059155
#%1059789
#!
  
#*Approximation algorithms for the sex-equal stable marriage problem.
#@Kazuo Iwama,Shuichi Miyazaki,Hiroki Yanagisawa
#t2010
#cACM Transactions on Algorithms
#index2976281
#%210356
#%838592
#%971900
#%976059
#%1059624
#%1059424
#%1091727
#%3003855
#!
  
#*Geodesic Fréchet distance inside a simple polygon.
#@Atlas F. Cook,Carola Wenk
#t2010
#cACM Transactions on Algorithms
#index2976286
#% 
#!
  
#*Additive spanners and (alpha, beta)-spanners.
#@Surender Baswana,Telikepalli Kavitha,Kurt Mehlhorn,Seth Pettie
#t2010
#cACM Transactions on Algorithms
#index2976291
#% 
#!
  
#*The compressed permuterm index.
#@Paolo Ferragina,Rossano Venturini
#t2010
#cACM Transactions on Algorithms
#index2976288
#%87
#%481454
#%610017
#%833275
#%833272
#%949659
#%950285
#%950286
#%971917
#%979609
#%1073501
#%1077326
#%1077387
#%1077327
#%3000915
#%611451
#!
  
#*Taxes for linear atomic congestion games.
#@Ioannis Caragiannis,Christos Kaklamanis,Panagiotis Kanellopoulos
#t2010
#cACM Transactions on Algorithms
#index2976280
#%209920
#%210577
#%211086
#%267992
#%268839
#%611478
#%620516
#%621342
#%621725
#%621757
#%622081
#%622872
#%662629
#%662673
#%750741
#%750836
#%951491
#%952550
#%971741
#%1077316
#%1096272
#%2876319
#!
  
#*Length-bounded cuts and flows.
#@Georg Baier,Thomas Erlebach,Alexander Hall,Ekkehard Köhler,Petr Kolman,Ondrej Pangrác,Heiko Schilling,Martin Skutella
#t2010
#cACM Transactions on Algorithms
#index2976283
#%783637
#%798622
#%837170
#%853820
#%953681
#%972129
#%1077360
#%1289767
#%3005546
#!
  
#*Computing large matchings fast.
#@Ignaz Rutter,Alexander Wolff
#t2010
#cACM Transactions on Algorithms
#index2976287
#%211500
#%610059
#%611481
#%621793
#%623169
#%750473
#%803969
#%854142
#%854708
#%950363
#%950693
#%952686
#%952790
#%952971
#%971895
#%978212
#%1051775
#%1060067
#%1060403
#!
  
#*Clustering lines in high-dimensional space: Classification of incomplete data.
#@Jie Gao,Michael Langberg,Leonard J. Schulman
#t2010
#cACM Transactions on Algorithms
#index2976284
#%111143
#%111644
#%609791
#%609771
#%621364
#%621947
#%950676
#%1336522
#!
  
#*I/O-efficient batched union-find and its applications to terrain analysis.
#@Pankaj K. Agarwal,Lars Arge,Ke Yi
#t2010
#cACM Transactions on Algorithms
#index2976290
#%110976
#%111250
#%185933
#%210510
#%233072
#%415226
#%610235
#%622051
#%642054
#%750761
#%769519
#%772007
#%803587
#%833184
#%844039
#%951702
#%951710
#%952613
#%1060413
#%1138027
#!
  
#*A faster algorithm for computing the girth of planar and bounded genus graphs.
#@Hristo Djidjev
#t2010
#cACM Transactions on Algorithms
#index2976289
#%73
#%610156
#%610450
#%611707
#%622526
#%839384
#%861707
#%949686
#%949588
#%950336
#%952996
#%953602
#!
  
#*On the bicriteria -server problem.
#@Michele Flammini,Gaia Nicosia
#t2010
#cACM Transactions on Algorithms
#index2976292
#% 
#!
  
#*Shortest vertex-disjoint two-face paths in planar graphs.
#@Éric Colin de Verdière,Alexander Schrijver
#t2011
#cACM Transactions on Algorithms
#index3079433
#%837170
#%950342
#%972200
#%977721
#%1060402
#!
  
#*Set connectivity problems in undirected graphs and the directed steiner network problem.
#@Chandra Chekuri,Guy Even,Anupam Gupta,Danny Segev
#t2011
#cACM Transactions on Algorithms
#index3079431
#%212080
#%407056
#%611392
#%611555
#%621393
#%621861
#%622234
#%952980
#%971896
#%972335
#%1059341
#%1060715
#%1077310
#!
  
#*Competitive analysis of flash memory algorithms.
#@Avraham Ben-Aroya,Sivan Toledo
#t2011
#cACM Transactions on Algorithms
#index3079424
#%53605
#%636152
#%832622
#%995883
#!
  
#*Algorithms for distributed functional monitoring.
#@Graham Cormode,S. Muthukrishnan,Ke Yi
#t2011
#cACM Transactions on Algorithms
#index3079430
#%53671
#%299767
#%557748
#%597918
#%598451
#%599038
#%599453
#%599701
#%610058
#%611166
#%611613
#%622336
#%623312
#%642367
#%642424
#%829116
#%971408
#%1118535
#%1209590
#%1212952
#!
  
#*Data structures for mergeable trees.
#@Loukas Georgiadis,Haim Kaplan,Nira Shafrir,Robert Endre Tarjan,Renato Fonseca F. Werneck
#t2011
#cACM Transactions on Algorithms
#index3079436
#%110559
#%186687
#%609733
#%610590
#%611309
#%622416
#%822195
#%844039
#%949881
#%951628
#%951702
#%952947
#%972981
#%1013710
#%1058943
#%1058924
#%1060178
#%1077237
#!
  
#*Tree exploration with logarithmic memory.
#@Christoph Ambühl,Leszek Gasieniec,Andrzej Pelc,Tomasz Radzik,Xiaohui Zhang
#t2011
#cACM Transactions on Algorithms
#index3079429
#%108709
#%209804
#%210103
#%493588
#%621504
#%622331
#%839432
#%887447
#%931757
#%951995
#%952781
#%952849
#%953462
#%972437
#%1009277
#%1058516
#%1058437
#%1077272
#%1077304
#%1091236
#%1092719
#!
  
#*Sum edge coloring of multigraphs via configuration LP.
#@Magnús M. Halldórsson,Guy Kortsarz,Maxim Sviridenko
#t2011
#cACM Transactions on Algorithms
#index3079428
#%210342
#%219337
#%267957
#%406996
#%611467
#%621373
#%750417
#%887133
#%952599
#%953101
#%1058856
#%1061796
#%1080207
#%1093315
#%1266530
#%1270178
#%1278935
#%547516
#!
  
#*Computing the inverse sort transform in linear time.
#@Ge Nong,Sen Zhang,Wai Hong Chan
#t2011
#cACM Transactions on Algorithms
#index3079437
#%118641
#%118704
#%118655
#%118919
#%120784
#%145900
#%146673
#%146682
#%146822
#%147111
#%268409
#%494173
#%562670
#%750422
#%1059410
#%1073887
#%1078120
#%1078093
#%1083128
#!
  
#*Discovering almost any hidden motif from multiple sequences.
#@Bin Fu,Ming-Yang Kao,Lusheng Wang
#t2011
#cACM Transactions on Algorithms
#index3079427
#%522
#%438637
#%610582
#%622635
#%888642
#%932074
#%951064
#!
  
#*Constrained pattern matching.
#@Yongwook Choi,Wojciech Szpankowski
#t2011
#cACM Transactions on Algorithms
#index3079434
#%186423
#%864074
#%950304
#%976407
#%1023289
#%1109755
#%2939941
#!
  
#*Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners.
#@Michael Elkin
#t2011
#cACM Transactions on Algorithms
#index3079435
#%185876
#%209988
#%210905
#%211640
#%212137
#%267309
#%267820
#%543943
#%544615
#%609992
#%609973
#%611322
#%611630
#%614640
#%623175
#%935018
#%949653
#%951285
#%971408
#%1059068
#%1060192
#%1060948
#%1061049
#!
  
#*Finding witnesses by peeling.
#@Yonatan Aumann,Moshe Lewenstein,Noa Lewenstein,Dekel Tsur
#t2011
#cACM Transactions on Algorithms
#index3079426
#%73
#%610270
#%610772
#%623126
#%841269
#%886935
#%930705
#%934786
#%972947
#%1039163
#%1058319
#%209867
#!
  
#*Decision trees for entity identification: Approximation algorithms and hardness results.
#@Venkatesan T. Chakaravarthy,Vinayaka Pandit,Sambuddha Roy,Pranjal Awasthi,Mukesh K. Mohania
#t2011
#cACM Transactions on Algorithms
#index3079432
#%46661
#%199357
#%545582
#%622980
#%750063
#%832829
#%839587
#%848640
#%1209545
#!
  
#*Constant factor approximations for the hotlink assignment problem.
#@Tobias Jacobs
#t2011
#cACM Transactions on Algorithms
#index3079425
#%178349
#%186110
#%186632
#%415136
#%660654
#%745668
#%932284
#%1095789
#%1120460
#%1122258
#!
  
#*Randomized rendezvous with limited memory.
#@Evangelos Kranakis,Danny Krizanc,Pat Morin
#t2011
#cACM Transactions on Algorithms
#index3146200
#%269175
#%297198
#%481418
#%523475
#%628094
#%757941
#%1060514
#%1061228
#%1093338
#%3002353
#!
  
#*Succinct indexes for strings, binary relations and multilabeled trees.
#@Jérémy Barbay,Meng He,J. Ian Munro,Srinivasa Rao Satti
#t2011
#cACM Transactions on Algorithms
#index3146191
#%522
#%2526
#%118631
#%210612
#%211020
#%268035
#%268729
#%301499
#%610658
#%610730
#%610637
#%611017
#%611057
#%611177
#%611584
#%749749
#%950285
#%950286
#%952840
#%1059410
#%1060106
#%1059931
#%1060097
#%1077278
#%1095865
#%1095873
#%611451
#!
  
#*Routing (un-) splittable flow in games with player-specific affine latency functions.
#@Martin Gairing,Burkhard Monien,Karsten Tiemann
#t2011
#cACM Transactions on Algorithms
#index3146201
#%391680
#%411842
#%620516
#%621725
#%662630
#%951491
#%972886
#%1016248
#%1091181
#%1122595
#%2939566
#%3341254
#!
  
#*Rate vs. buffer size-greedy information gathering on the line.
#@Adi Rosén,Gabriel Scalosub
#t2011
#cACM Transactions on Algorithms
#index3146209
#%136867
#%446214
#%609846
#%614396
#%749659
#%952535
#%953178
#%1058347
#%1059757
#%1077301
#%1219478
#%2869271
#!
  
#*S-T connectivity on digraphs with a known stationary distribution.
#@Kai-Min Chung,Omer Reingold,Salil P. Vadhan
#t2011
#cACM Transactions on Algorithms
#index3146208
#%104806
#%104883
#%209804
#%210998
#%211447
#%609838
#%622974
#%623020
#%623033
#%623188
#%783691
#%861509
#%862239
#%889448
#%951995
#%972272
#%972704
#%1058645
#!
  
#*Cake cutting really is not a piece of cake.
#@Jeff Edmonds,Kirk Pruhs
#t2011
#cACM Transactions on Algorithms
#index3146188
#%17172
#%186554
#%212121
#%610905
#%620660
#%977730
#!
  
#*Memoryless facility location in one pass.
#@Dimitris Fotakis
#t2011
#cACM Transactions on Algorithms
#index3146195
#%210841
#%211358
#%621679
#%622035
#%621670
#%622336
#%750888
#%886951
#%1112855
#%1180292
#%3005125
#!
  
#*An improved approximation algorithm for resource allocation.
#@Gruia Calinescu,Amit Chakrabarti,Howard J. Karloff,Yuval Rabani
#t2011
#cACM Transactions on Algorithms
#index3146202
#%219767
#%406774
#%949707
#!
  
#*Fast computation of small cuts via cycle space sampling.
#@David Pritchard,Ramakrishna Thurimella
#t2011
#cACM Transactions on Algorithms
#index3146203
#%147
#%2022
#%209988
#%219361
#%614037
#%614480
#%953060
#%953609
#%972145
#%972292
#%973162
#%988949
#%989536
#%1016200
#%1059454
#%1059247
#%1059279
#%1127729
#!
  
#*Broadcast scheduling: Algorithms and complexity.
#@Jessica Chang,Thomas Erlebach,Renars Gailis,Samir Khuller
#t2011
#cACM Transactions on Algorithms
#index3146189
#%186292
#%210727
#%406812
#%609962
#%609954
#%609984
#%609953
#%610184
#%610468
#%610419
#%611717
#%827853
#%951944
#%1054425
#%1092581
#!
  
#*Improved approximations for the hotlink assignment problem.
#@Eduardo Sany Laber,Marco Molinaro
#t2011
#cACM Transactions on Algorithms
#index3146194
#%186110
#%186632
#%390125
#%415136
#%971322
#%1120460
#!
  
#*Partial convex recolorings of trees and galled networks: Tight upper and lower bounds.
#@Shlomo Moran,Sagi Snir,Wing-Kin Sung
#t2011
#cACM Transactions on Algorithms
#index3146197
#%973242
#%973330
#!
  
#*Carry propagation in multiplication by constants.
#@Alexander Izsak,Nicholas Pippenger
#t2011
#cACM Transactions on Algorithms
#index3146204
#% 
#!
  
#*Philippe flajolet, the father of analytic combinatorics.
#@Bruno Salvy,Bob Sedgewick,Michèle Soria,Wojciech Szpankowski,Brigitte Vallée
#t2011
#cACM Transactions on Algorithms
#index3146205
#% 
#!
  
#*The optimality of the online greedy algorithm in carpool and chairman assignment problems.
#@Don Coppersmith,Tomasz Nowicki,Giuseppe Paleologo,Charles Philippe Tresser,Chai Wah Wu
#t2011
#cACM Transactions on Algorithms
#index3146186
#%890142
#%890420
#%952541
#!
  
#*All-pairs shortest paths with a sublinear additive error.
#@Liam Roditty,Asaf Shapira
#t2011
#cACM Transactions on Algorithms
#index3146196
#%211786
#%212029
#%623283
#%771709
#%887922
#%950342
#%951796
#%951918
#%960021
#%960157
#%971278
#%971983
#%972947
#%993684
#%1058424
#%1059068
#!
  
#*Three-coloring triangle-free planar graphs in linear time.
#@Zdenek Dvorak,Ken-ichi Kawarabayashi,Robin Thomas
#t2011
#cACM Transactions on Algorithms
#index3146206
#%611759
#%951839
#%977713
#%977724
#%978220
#%978211
#%1077298
#%1094601
#!
  
#*How well can primal-dual and local-ratio algorithms perform?
#@Allan Borodin,David Cashman,Avner Magen
#t2011
#cACM Transactions on Algorithms
#index3146199
#%104316
#%209940
#%406774
#%407073
#%415177
#%415463
#%609971
#%611245
#%611448
#%621533
#%622980
#%623421
#%749695
#%862354
#%931484
#%932894
#%949707
#%952899
#%953569
#%1059341
#%1059759
#%1061076
#%1061766
#%1077415
#%1096263
#%1209559
#%1214532
#%1219463
#%1219457
#%2817177
#%3060829
#%3075853
#!
  
#*Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.
#@Sergio Cabello,Panos Giannopoulos,Christian Knauer,Dániel Marx,Günter Rote
#t2011
#cACM Transactions on Algorithms
#index3146187
#%449542
#%610451
#%611664
#%621703
#%803590
#%832216
#%972274
#%994310
#%1059219
#!
  
#*The tree inclusion problem: In linear space and faster.
#@Philip Bille,Inge Li Gørtz
#t2011
#cACM Transactions on Algorithms
#index3146212
#%186159
#%186318
#%209884
#%210489
#%267191
#%302937
#%481151
#%595208
#%609772
#%611086
#%623144
#%624015
#%644066
#%651248
#%740436
#%853418
#%950684
#%951388
#%953052
#%952757
#%953527
#%956994
#%1059461
#%1059769
#%1060682
#%1089401
#%1138252
#!
  
#*Minimizing flow time in the wireless gathering problem.
#@Vincenzo Bonifaci,Peter Korteweg,Alberto Marchetti-Spaccamela,Leen Stougie
#t2011
#cACM Transactions on Algorithms
#index3146192
#%411464
#%597281
#%610010
#%610171
#%610911
#%793249
#%852820
#%950817
#%971445
#%973229
#%1059943
#%1061564
#%1077402
#%1122584
#%3005125
#!
  
#*Minimizing movement in mobile facility location problems.
#@Zachary Friggstad,Mohammad R. Salavatipour
#t2011
#cACM Transactions on Algorithms
#index3146193
#%46627
#%406996
#%506349
#%610669
#%611441
#%611384
#%621393
#%622359
#%623147
#%817978
#%820125
#%950780
#%971896
#%1058856
#%1060732
#!
  
#*Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree.
#@Paul Bonsma,Frederic Dorn
#t2011
#cACM Transactions on Algorithms
#index3146207
#%17098
#%32360
#%186511
#%219504
#%220072
#%416194
#%481380
#%493212
#%506575
#%623394
#%823293
#%825947
#%830565
#%861707
#%949588
#%952000
#%952718
#%1061551
#%1062115
#%1081241
#%1124878
#%1141108
#%1308311
#%2869272
#%3480180
#!
  
#*Fully compressed suffix trees.
#@Luís M. S. Russo,Gonzalo Navarro,Arlindo L. Oliveira
#t2011
#cACM Transactions on Algorithms
#index3146211
#%522
#%105387
#%118872
#%118903
#%147164
#%211977
#%212240
#%268889
#%481384
#%610658
#%654412
#%833272
#%937628
#%950286
#%951134
#%953385
#%953463
#%979471
#%979595
#%1016243
#%1059931
#%1060944
#%1077326
#%1077387
#%1077327
#%1077282
#%1090276
#%1092159
#%1256425
#%1256410
#%1256416
#%1256405
#%1269644
#%1343014
#%1342968
#%2816147
#%2816181
#%2854736
#%2862120
#%2908094
#%2908131
#!
  
#*A new upper bound 2.5545 on 2D Online Bin Packing.
#@Xin Han,Francis Y. L. Chin,Hing-Fung Ting,Guochuan Zhang,Yong Zhang
#t2011
#cACM Transactions on Algorithms
#index3146198
#%210294
#%610461
#%741881
#%836532
#%934300
#%951002
#%951557
#%951884
#%953419
#%1059124
#%1093532
#%1278938
#%1341504
#!
  
#*Max-coloring and online coloring with bandwidths on interval graphs.
#@Sriram V. Pemmaraju,Rajiv Raman,Kasturi R. Varadarajan
#t2011
#cACM Transactions on Algorithms
#index3146210
#%186211
#%360226
#%600825
#%610591
#%611196
#%623127
#%624374
#%652572
#%852883
#%853908
#%931497
#%1061515
#%1089037
#%1123832
#!
  
#*To fill or not to fill: The gas station problem.
#@Samir Khuller,Azarakhsh Malekian,Julián Mestre
#t2011
#cACM Transactions on Algorithms
#index3146190
#%110580
#%210148
#%407022
#%621370
#%952617
#%1058851
#!
  
#*Adversarial Queuing on the Multiple Access Channel.
#@Bogdan S. Chlebus,Dariusz R. Kowalski,Mariusz A. Rokicki
#t2012
#cACM Transactions on Algorithms
#index3317467
#%62907
#%267666
#%340792
#%415651
#%543761
#%544128
#%544177
#%610772
#%614069
#%621266
#%774301
#%841342
#%933575
#%949528
#%949831
#%950461
#%950526
#%971366
#%1015711
#%1024228
#%1058337
#%1058607
#%1059274
#%1059347
#%1059976
#%1060308
#%1060642
#%1060698
#%1061378
#%1121945
#%1257134
#%1308692
#%2800938
#!
  
#*Even Faster Exact Bandwidth.
#@Marek Cygan,Marcin Pilipczuk
#t2012
#cACM Transactions on Algorithms
#index3317469
#%211907
#%624146
#%1223170
#%1277117
#!
  
#*Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems.
#@Sudipto Guha,Kamesh Munagala
#t2012
#cACM Transactions on Algorithms
#index3317473
#%210344
#%210716
#%211858
#%268147
#%523811
#%544946
#%544945
#%545210
#%588438
#%597919
#%610186
#%610351
#%610768
#%611165
#%611576
#%622101
#%622205
#%642513
#%817569
#%951160
#%951928
#%971682
#%1059155
#%1059341
#%1059789
#%1060466
#%1278967
#%2976282
#!
  
#*Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.
#@Bernhard Haeupler,Telikepalli Kavitha,Rogers Mathew,Siddhartha Sen,Robert Endre Tarjan
#t2012
#cACM Transactions on Algorithms
#index3317474
#%75
#%609762
#%185911
#%611709
#%971555
#%621842
#%1059072
#%931262
#%269329
#%210905
#%772820
#%1077286
#%660844
#%932869
#%979958
#%933479
#%1060827
#%972934
#%951702
#%951710
#%973036
#!
  
#*Online Optimization with Uncertain Information.
#@Mohammad Mahdian,Hamid Nazerzadeh,Amin Saberi
#t2012
#cACM Transactions on Algorithms
#index3317472
#%46627
#%186608
#%621308
#%621531
#%621191
#%622359
#%750888
#%817978
#%820125
#%950780
#%951964
#%972373
#%1013938
#%1089029
#%1089035
#!
  
#*Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching.
#@Jianer Chen,Yang Liu,Songjian Lu,Sing-Hoi Sze,Fenghui Zhang
#t2012
#cACM Transactions on Algorithms
#index3317471
#%269340
#%611442
#%660781
#%749876
#%861707
#%949588
#!
  
#*Cache-Oblivious Algorithms.
#@Matteo Frigo,Charles E. Leiserson,Harald Prokop,Sridhar Ramachandran
#t2012
#cACM Transactions on Algorithms
#index3317470
#%73
#%2022
#%53708
#%105493
#%209839
#%209860
#%210302
#%210675
#%210102
#%267387
#%360070
#%542573
#%610927
#%614159
#%614122
#%614551
#%621196
#%622302
#%769519
#%776121
#%951563
#%989925
#%3316710
#!
  
#*Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees.
#@Sebastian Böcker,Quang Bao Anh Bui,Anke Truß
#t2012
#cACM Transactions on Algorithms
#index3317468
#%610559
#%610832
#%750095
#%837612
#%838058
#%929689
#%933120
#%1087044
#!
  
#*Multidimensional online tracking.
#@Ke Yi,Qin Zhang
#t2012
#cACM Transactions on Algorithms
#index3375766
#%46679
#%110876
#%111587
#%598451
#%599038
#%599456
#%611613
#%623312
#%642367
#%642513
#%642405
#%644262
#%774795
#%775197
#%949733
#%971408
#%1118535
#!
  
#*On the hardness of losing weight.
#@Andrei A. Krokhin,Dániel Marx
#t2012
#cACM Transactions on Algorithms
#index3375767
#%623072
#%751502
#%783733
#%888523
#%954786
#%972341
#%1059760
#%1090264
#%1213308
#%2915520
#%3393475
#!
  
#*On the query complexity of testing orientations for being Eulerian.
#@Eldar Fischer,Oded Lachish,Arie Matsliah,Ilan Newman,Orly Yahalom
#t2012
#cACM Transactions on Algorithms
#index3375764
#%104859
#%557776
#%609924
#%862225
#%950466
#%971412
#%971558
#%1051834
#%1052224
#%1058571
#%1059740
#%1060134
#%3060832
#!
  
#*The price of anarchy in network creation games.
#@Erik D. Demaine,Mohammad Taghi Hajiaghayi,Hamid Mahini,Morteza Zadimoghaddam
#t2012
#cACM Transactions on Algorithms
#index3375765
#%209920
#%268839
#%543830
#%543957
#%609855
#%610335
#%620516
#%621275
#%622872
#%622997
#%951026
#%2939566
#!
  
#*A precise analysis of Cuckoo hashing.
#@Michael Drmota,Reinhard Kutzelnigg
#t2012
#cACM Transactions on Algorithms
#index3375770
#%2023
#%186695
#%193057
#%267817
#%621845
#%854616
#%864392
#%930902
#%953454
#%1061272
#%1090690
#%1095719
#%2939941
#!
  
#*Elimination graphs.
#@Yuli Ye,Allan Borodin
#t2012
#cACM Transactions on Algorithms
#index3375763
#%104556
#%105251
#%204226
#%267492
#%610086
#%610030
#%621378
#%621533
#%622349
#%660892
#%749800
#%783569
#%934601
#%949686
#%949707
#%981358
#%1059129
#%1059629
#%1061323
#%1061230
#%1090904
#%1270189
#%1276197
#%1278935
#%2857064
#!
  
#*How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover.
#@Toshihiro Fujito
#t2012
#cACM Transactions on Algorithms
#index3375762
#%268396
#%611172
#%621855
#%741196
#%836868
#%861234
#%861479
#%929790
#%931230
#%1059441
#%1061076
#!
  
#*The traveling salesman problem in bounded degree graphs.
#@Andreas Björklund,Thore Husfeldt,Petteri Kaski,Mikko Koivisto
#t2012
#cACM Transactions on Algorithms
#index3375771
#%269332
#%949673
#%975106
#!
  
#*Succinct geometric indexes supporting point location queries.
#@Prosenjit Bose,Eric Y. Chen,Meng He,Anil Maheshwari,Pat Morin
#t2012
#cACM Transactions on Algorithms
#index3375768
#%110548
#%110782
#%210612
#%211020
#%212025
#%212119
#%416128
#%610658
#%610646
#%611073
#%611518
#%651119
#%768131
#%775749
#%803862
#%843169
#%953099
#%953512
#%972664
#%1058805
#%1059089
#%1059210
#%1060796
#%1060989
#%1077278
#%1077282
#%1095873
#%611451
#!
  
#*On approximating multicriteria TSP.
#@Bodo Manthey
#t2012
#cACM Transactions on Algorithms
#index3375761
#%46742
#%186658
#%203925
#%211553
#%624298
#%750966
#%827665
#%829353
#%950834
#%979560
#%1088796
#%1237739
#%3005546
#!
  
#*Dotted interval graphs.
#@Yonatan Aumann,Moshe Lewenstein,Oren Melamud,Ron Y. Pinter,Zohar Yakhini
#t2012
#cACM Transactions on Algorithms
#index3375769
#%609971
#%609910
#%611454
#%931968
#%935052
#!
  
#*Entropy, triangulation, and point location in planar subdivisions.
#@Sébastien Collette,Vida Dujmovic,John Iacono,Stefan Langerman,Pat Morin
#t2012
#cACM Transactions on Algorithms
#index3465288
#%209949
#%212025
#%212119
#%609743
#%609896
#%609895
#%610764
#%610646
#%611499
#%624053
#%775749
#%803862
#%844097
#%994297
#%1059089
#%1060796
#!
  
#*Scalably scheduling processes with arbitrary speedup curves.
#@Jeff Edmonds,Kirk Pruhs
#t2012
#cACM Transactions on Algorithms
#index3465291
#%186574
#%611407
#%611660
#%611717
#%614230
#%821009
#%823092
#%827853
#%949786
#%950818
#%950817
#%1025582
#%1064209
#%1090779
#%1256375
#%2792121
#%2816107
#!
  
#*I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths.
#@Ulrich Meyer,Norbert Zeh
#t2012
#cACM Transactions on Algorithms
#index3465289
#%110545
#%186402
#%186395
#%481254
#%609840
#%610122
#%610249
#%610235
#%611202
#%611069
#%611532
#%614081
#%614177
#%769519
#%949610
#%950342
#%951699
#%952613
#%953604
#!
  
#*Santa claus meets hypergraph matchings.
#@Arash Asadpour,Uriel Feige,Amin Saberi
#t2012
#cACM Transactions on Algorithms
#index3465292
#%46659
#%212122
#%610389
#%611569
#%611517
#%621373
#%623354
#%972341
#%1013938
#%1183692
#%1341470
#%2868663
#!
  
#*Tight approximation algorithms for scheduling with fixed jobs and nonavailability.
#@Florian Diedrich,Klaus Jansen,Lars Prädel,Ulrich M. Schwarz,Ola Svensson
#t2012
#cACM Transactions on Algorithms
#index3465293
#%610200
#%839126
#%885419
#%930314
#%950677
#%950753
#%1058879
#%1059555
#%3070958
#%3300771
#!
  
#*Polynomial-time algorithms for minimum energy scheduling.
#@Philippe Baptiste,Marek Chrobak,Christoph Dürr
#t2012
#cACM Transactions on Algorithms
#index3465286
#%142137
#%209966
#%609958
#%610783
#%614706
#%838894
#%1062207
#%1098603
#!
  
#*Expansion properties of (secure) wireless networks.
#@Alessandro Panconesi,Jaikumar Radhakrishnan
#t2012
#cACM Transactions on Algorithms
#index3465285
#%83869
#%573040
#%614223
#%742972
#%1103686
#%1141598
#%3002515
#!
  
#*Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location.
#@MohammadHossein Bateni,MohammadTaghi Hajiaghayi
#t2012
#cACM Transactions on Algorithms
#index3465287
#%46547
#%46598
#%46627
#%210344
#%211517
#%406708
#%557808
#%610200
#%610525
#%611227
#%611715
#%621300
#%621393
#%622359
#%623147
#%675475
#%820125
#%950677
#%953022
#%953262
#%971896
#%1013553
#%1013938
#%1014260
#%1058856
#%1059555
#%3185932
#!
  
#*Improved algorithms for orienteering and related problems.
#@Chandra Chekuri,Nitish Korula,Martin Pál
#t2012
#cACM Transactions on Algorithms
#index3465284
#%46641
#%46745
#%110580
#%210237
#%210737
#%611463
#%621370
#%622101
#%952609
#%1059341
#%1060819
#%1060788
#%3005546
#%210271
#!
  
#*Counting occurrences for a finite set of words: Combinatorial methods.
#@Frédérique Bassino,Julien Clément,Pierre Nicodème
#t2012
#cACM Transactions on Algorithms
#index3465283
#%481052
#%769542
#%837989
#%864074
#%976407
#%1093742
#%2939941
#%3001360
#%3006037
#!
  
#*The speed of convergence in congestion games under best-response dynamics.
#@Angelo Fanelli,Michele Flammini,Luca Moscardelli
#t2012
#cACM Transactions on Algorithms
#index3465295
#%210718
#%211945
#%592973
#%611558
#%620073
#%621725
#%621936
#%623434
#%952003
#%972341
#%1310324
#!
  
#*Testing nilpotence of galois groups in polynomial time.
#@V. Arvind,Piyush P. Kurur
#t2012
#cACM Transactions on Algorithms
#index3465290
#%198156
#%449659
#%493062
#%822537
#%953195
#%993841
#%1012224
#!
  
#*Smoothed analysis of left-to-right maxima with applications.
#@Valentina Damerow,Bodo Manthey,Friedhelm Meyer auf der Heide,Harald Räcke,Christian Scheideler,Christian Sohler,Till Tantau
#t2012
#cACM Transactions on Algorithms
#index3465294
#%110703
#%111602
#%139260
#%494871
#%609783
#%610740
#%843462
#%862231
#%950214
#%951421
#%951644
#%952630
#%952933
#%1095549
#!
  
#*New Algorithms for Disk Scheduling.
#@Matthew Andrews,Michael A. Bender,Lisa Zhang
#t2002
#cAlgorithmica
#index749568
#% 
#!
  
#*Boltzmann Machines as a Model for Parallel Annealing.
#@Emile H. L. Aarts,Jan H. M. Korst
#t1991
#cAlgorithmica
#index749569
#% 
#!
  
#*An Algorithmic Approach to Discovering and Proving q-Series Identities.
#@George E. Andrews,Arnold Knopfmacher
#t2001
#cAlgorithmica
#index749570
#% 
#!
  
#*Reinforcement Learning with Immediate Rewards and Linear Hypotheses.
#@Naoki Abe,Alan W. Biermann,Philip M. Long
#t2003
#cAlgorithmica
#index749571
#% 
#!
  
#*Improved Bounds for On-Line Load Balancing.
#@Matthew Andrews,Michel X. Goemans,Lisa Zhang
#t1999
#cAlgorithmica
#index749572
#% 
#!
  
#*A Functional Approach to External Graph Algorithms.
#@James Abello,Adam L. Buchsbaum,Jeffery Westbrook
#t2002
#cAlgorithmica
#index749573
#% 
#!
  
#*Approximation Algorithms for Access Network Design.
#@Matthew Andrews,Lisa Zhang
#t2002
#cAlgorithmica
#index749574
#% 
#!
  
#*Polynomial Algorithms for Linear Programming over the Algebraic Numbers.
#@Ilan Adler,Peter A. Beling
#t1994
#cAlgorithmica
#index749575
#% 
#!
  
#*Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
#@Enrico Angelelli,Maria Grazia Speranza,Zsolt Tuza
#t2003
#cAlgorithmica
#index749576
#% 
#!
  
#*Modeling Parallel Bandwidth: Local versus Global Restrictions.
#@Micah Adler,Phillip B. Gibbons,Yossi Matias,Vijaya Ramachandran
#t1999
#cAlgorithmica
#index749577
#% 
#!
  
#*Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
#@Esther M. Arkin,Refael Hassin,Shlomi Rubinstein,Maxim Sviridenko
#t2004
#cAlgorithmica
#index749578
#% 
#!
  
#*Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
#@Micah Adler,Sanjeev Khanna,Rajmohan Rajaraman,Adi Rosén
#t2003
#cAlgorithmica
#index749579
#% 
#!
  
#*Optimization Problems Related to Zigzag Pocket Machining.
#@Esther M. Arkin,Martin Held,Christopher L. Smith
#t2000
#cAlgorithmica
#index749580
#% 
#!
  
#*A Geometric View of Parametric Linear Programming.
#@Ilan Adler,Renato D. C. Monteiro
#t1992
#cAlgorithmica
#index749581
#% 
#!
  
#*Geometric Knapsack Problems.
#@Esther M. Arkin,Samir Khuller,Joseph S. B. Mitchell
#t1993
#cAlgorithmica
#index749582
#% 
#!
  
#*The Synthesis of Communication Protocols.
#@Foto N. Afrati,Christos H. Papadimitriou,George Papageorgiou
#t1988
#cAlgorithmica
#index749583
#% 
#!
  
#*Temporary Tasks Assignment Resolved.
#@Amitai Armon,Yossi Azar,Leah Epstein
#t2003
#cAlgorithmica
#index749584
#%621161
#%621308
#%1089035
#%451398
#%952552
#%952554
#%185904
#%621396
#%651093
#%3005125
#%950712
#%610853
#%1013938
#%622914
#%932540
#%1014260
#%186553
#!
  
#*Selecting Distances in the Plane.
#@Pankaj K. Agarwal,Boris Aronov,Micha Sharir,Subhash Suri
#t1993
#cAlgorithmica
#index749585
#% 
#!
  
#*On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon.
#@Boris Aronov
#t1989
#cAlgorithmica
#index749586
#% 
#!
  
#*Improved Algorithms for Uniform Partitions of Points.
#@Pankaj K. Agarwal,Binay K. Bhattacharya,Sandeep Sen
#t2002
#cAlgorithmica
#index749587
#% 
#!
  
#*Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems.
#@Sanjeev Arora,Kevin L. Chang
#t2004
#cAlgorithmica
#index749588
#% 
#!
  
#*Computing Approximate Shortest Paths on Convex Polytopes.
#@Pankaj K. Agarwal,Sariel Har-Peled,Meetesh Karia
#t2002
#cAlgorithmica
#index749589
#% 
#!
  
#*Efficient Construction of a Bounded-Degree Spanner with Low Weight.
#@Sunil Arya,Michiel H. M. Smid
#t1997
#cAlgorithmica
#index749590
#% 
#!
  
#*Near-Linear Time Approximation Algorithms for Curve Simplification.
#@Pankaj K. Agarwal,Sariel Har-Peled,Nabil H. Mustafa,Yusu Wang
#t2005
#cAlgorithmica
#index749591
#% 
#!
  
#*Visibility of Disjoint Polygons.
#@Takao Asano,Tetsuo Asano,Leonidas J. Guibas,John Hershberger,Hiroshi Imai
#t1986
#cAlgorithmica
#index749592
#% 
#!
  
#*Connected Component and Simple Polygon Intersection Searching.
#@Pankaj K. Agarwal,Marc J. van Kreveld
#t1996
#cAlgorithmica
#index749593
#% 
#!
  
#*Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing.
#@Tetsuo Asano,Takeshi Tokuyama
#t1993
#cAlgorithmica
#index749594
#% 
#!
  
#*Dynamic Half-Space Range Reporting and Its Applications.
#@Pankaj K. Agarwal,Jirí Matousek
#t1995
#cAlgorithmica
#index749595
#% 
#!
  
#*Feasibility of Design in Stereolithography.
#@Boudewijn Asberg,Gregoria Blanco,Prosenjit Bose,Jesus Garcia-Lopez,Mark H. Overmars,Godfried T. Toussaint,Gordon T. Wilfong,Binhai Zhu
#t1997
#cAlgorithmica
#index749596
#% 
#!
  
#*Exact and Approximation Algorithms for Clustering.
#@Pankaj K. Agarwal,Cecilia Magdalena Procopiuc
#t2002
#cAlgorithmica
#index749597
#% 
#!
  
#*Memory Requirements for Table Computations in Partial k-Tree Algorithms.
#@Bengt Aspvall,Jan Arne Telle,Andrzej Proskurowski
#t2000
#cAlgorithmica
#index749598
#% 
#!
  
#*Approximation Algorithms for a k-Line Center.
#@Pankaj K. Agarwal,Cecilia Magdalena Procopiuc,Kasturi R. Varadarajan
#t2005
#cAlgorithmica
#index749599
#% 
#!
  
#*Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry.
#@Mikhail J. Atallah
#t1992
#cAlgorithmica
#index749600
#% 
#!
  
#*Planar Geometric Location Problems.
#@Pankaj K. Agarwal,Micha Sharir
#t1994
#cAlgorithmica
#index749601
#% 
#!
  
#*A Faster Parallel Algorithm for a Matrix Searching Problem.
#@Mikhail J. Atallah
#t1993
#cAlgorithmica
#index749602
#% 
#!
  
#*Communication - Processor Tradeoffs in a Limited Resources PRAM.
#@Adnan Agbaria,Yosi Ben-Asher,Ilan Newman
#t2002
#cAlgorithmica
#index749603
#% 
#!
  
#*A Randomized Algorithm for Approximate String Matching.
#@Mikhail J. Atallah,Frédéric Chyzak,Philippe Dumas
#t2001
#cAlgorithmica
#index749604
#% 
#!
  
#*Editor's Foreword.
#@Alok Aggarwal
#t1992
#cAlgorithmica
#index749605
#% 
#!
  
#*Deterministic Parallel List Ranking.
#@Richard J. Anderson,Gary L. Miller
#t1991
#cAlgorithmica
#index749606
#% 
#!
  
#*Quantum Algorithms for Weighing Matrices and Quadratic Residues.
#@Wim van Dam
#t2002
#cAlgorithmica
#index749607
#% 
#!
  
#*Parallel Computational Geometry.
#@Alok Aggarwal,Bernard Chazelle,Leonidas J. Guibas,Colm Ó'Dúnlaing,Chee-Keng Yap
#t1988
#cAlgorithmica
#index749608
#% 
#!
  
#*Efficient Parallel Algorithms for Planar -Graphs.
#@Mikhail J. Atallah,Danny Z. Chen,Ovidiu Daescu
#t2003
#cAlgorithmica
#index749609
#% 
#!
  
#*Optimal Tradeoffs for Addition on Systolic Arrays.
#@Alok Aggarwal,J. Lawrence Carter,S. Rao Kosaraju
#t1991
#cAlgorithmica
#index749610
#% 
#!
  
#*Suffix Trees on Words.
#@Arne Andersson,N. Jesper Larsson,Kurt Swanson
#t1999
#cAlgorithmica
#index749611
#% 
#!
  
#*On Greedy Heuristics for Steiner Minimum Trees.
#@Ding-Zhu Du
#t1995
#cAlgorithmica
#index749612
#% 
#!
  
#*A Lower Bound on the Area of Permutation Layouts.
#@Alok Aggarwal,Maria M. Klawe,David Lichtenstein,Nathan Linial,Avi Wigderson
#t1991
#cAlgorithmica
#index749613
#% 
#!
  
#*Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems.
#@Marilyn G. Andrews,Mikhail J. Atallah,Danny Z. Chen,D. T. Lee
#t2000
#cAlgorithmica
#index749614
#% 
#!
  
#*A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio.
#@Ding-Zhu Du,Frank K. Hwang
#t1992
#cAlgorithmica
#index749615
#% 
#!
  
#*Geometric Applications of a Matrix-Searching Algorithm.
#@Alok Aggarwal,Maria M. Klawe,Shlomo Moran,Peter W. Shor,Robert E. Wilber
#t1987
#cAlgorithmica
#index749616
#% 
#!
  
#*An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications.
#@Mikhail J. Atallah,Danny Z. Chen,D. T. Lee
#t1995
#cAlgorithmica
#index749617
#% 
#!
  
#*Parallel Searching in Generalized Monge Arrays.
#@Alok Aggarwal,Dina Kravets,James K. Park,Sandeep Sen
#t1997
#cAlgorithmica
#index749618
#% 
#!
  
#*Parallel Algorithms for Some Functions of two Convex Polygons.
#@Mikhail J. Atallah,Michael T. Goodrich
#t1988
#cAlgorithmica
#index749619
#% 
#!
  
#*Multilayer Grid Embeddings for VLSI.
#@Alok Aggarwal,Maria M. Klawe,Peter W. Shor
#t1991
#cAlgorithmica
#index749620
#% 
#!
  
#*Topological Numbering of Features on a Mesh.
#@Mikhail J. Atallah,Susanne E. Hambrusch,Lynn E. Te Winkel
#t1991
#cAlgorithmica
#index749621
#% 
#!
  
#*An O(n³) Recognition Algorithm for Bithreshold Graphs.
#@Sergio De Agostino,Rossella Petreschi,Andrea Sterbini
#t1997
#cAlgorithmica
#index749622
#% 
#!
  
#*An Efficient Algorithm for Maxdominance, with Applications.
#@Mikhail J. Atallah,S. Rao Kosaraju
#t1989
#cAlgorithmica
#index749623
#% 
#!
  
#*Casting with Skewed Ejection Direction.
#@Hee-Kap Ahn,Siu-Wing Cheng,Otfried Cheong
#t2006
#cAlgorithmica
#index749624
#% 
#!
  
#*On the Parallel-Decomposability of Geometric Problems.
#@Mikhail J. Atallah,Jyh-Jong Tsay
#t1992
#cAlgorithmica
#index749625
#% 
#!
  
#*A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
#@Ravindra K. Ahuja,Dorit S. Hochbaum,James B. Orlin
#t2004
#cAlgorithmica
#index749626
#% 
#!
  
#*On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids.
#@John Atkins,William E. Hart
#t1999
#cAlgorithmica
#index749627
#% 
#!
  
#*Parts Feeding on a Conveyor with a One Joint Robot.
#@Srinivas Akella,Wesley H. Huang,Kevin M. Lynch,Matthew T. Mason
#t2000
#cAlgorithmica
#index749628
#% 
#!
  
#*Using Geometry To Solve the Transportation Problem in the Plane.
#@David S. Atkinson,Pravin M. Vaidya
#t1995
#cAlgorithmica
#index749629
#% 
#!
  
#*Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
#@Jochen Alber,Hans L. Bodlaender,Henning Fernau,Ton Kloks,Rolf Niedermeier
#t2002
#cAlgorithmica
#index749630
#% 
#!
  
#*The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction.
#@Kevin Atteson
#t1999
#cAlgorithmica
#index749631
#% 
#!
  
#*On the Influence of Lookahead in Competitive Paging Algorithms.
#@Susanne Albers
#t1997
#cAlgorithmica
#index749632
#% 
#!
  
#*Efficient Elections in Chordal Ring Networks.
#@Hagit Attiya,Jan van Leeuwen,Nicola Santoro,Shmuel Zaks
#t1989
#cAlgorithmica
#index749633
#% 
#!
  
#*Exploring Unknown Environments with Obstacles.
#@Susanne Albers,Klaus Kursawe,Sven Schuierer
#t2002
#cAlgorithmica
#index749634
#% 
#!
  
#*A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees.
#@Vincenzo Auletta,Angelo Monti,Mimmo Parente,Pino Persiano
#t1999
#cAlgorithmica
#index749635
#% 
#!
  
#*Average Case Analyses of List Update Algorithms, with Applications to Data Compression.
#@Susanne Albers,Michael Mitzenmacher
#t1998
#cAlgorithmica
#index749636
#% 
#!
  
#*Minkowski-Type Theorems and Least-Squares Clustering.
#@Franz Aurenhammer,F. Hoffmann,Boris Aronov
#t1998
#cAlgorithmica
#index749637
#% 
#!
  
#*Foreword.
#@Susanne Albers,Tomasz Radzik
#t2006
#cAlgorithmica
#index749638
#% 
#!
  
#*Algorithms for the On-Line Travelling Salesman.
#@Giorgio Ausiello,Esteban Feuerstein,Stefano Leonardi,Leen Stougie,Maurizio Talamo
#t2001
#cAlgorithmica
#index749639
#% 
#!
  
#*Average-Case Analysis of Dynamic Graph Algorithms.
#@David Alberts,Monika Rauch Henzinger
#t1998
#cAlgorithmica
#index749640
#% 
#!
  
#*Ancient and New Algorithms for Load Balancing in the Norm.
#@Adi Avidor,Yossi Azar,Jiri Sgall
#t2001
#cAlgorithmica
#index749641
#% 
#!
  
#*A. Metropolis-Type Optimization Algorithm on the Infinite Tree.
#@David Aldous
#t1998
#cAlgorithmica
#index749642
#% 
#!
  
#*Generating Rooted Triangulations Without Repetitions.
#@David Avis
#t1996
#cAlgorithmica
#index749643
#% 
#!
  
#*An Optimal Algorithm for the Boundary of a Cell in a Union of Rays.
#@Panagiotis Alevizos,Jean-Daniel Boissonnat,Franco P. Preparata
#t1990
#cAlgorithmica
#index749644
#% 
#!
  
#*Evaluating Signs of Determinants Using Single-Precision Arithmetic.
#@Francis Avnaim,Jean-Daniel Boissonnat,Olivier Devillers,Franco P. Preparata,Mariette Yvinec
#t1997
#cAlgorithmica
#index749645
#% 
#!
  
#*An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum.
#@Panagiotis Alevizos,Jean-Daniel Boissonnat,Franco P. Preparata
#t1991
#cAlgorithmica
#index749646
#% 
#!
  
#*On-Line Competitive Algorithms for Call Admission in Optical Networks.
#@Baruch Awerbuch,Yossi Azar,Amos Fiat,Stefano Leonardi,Adi Rosén
#t2001
#cAlgorithmica
#index749647
#% 
#!
  
#*Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.
#@Farid Alizadeh,Richard M. Karp,Lee Aaron Newberg,Deborah K. Weisser
#t1995
#cAlgorithmica
#index749648
#% 
#!
  
#*An Online Algorithm for the Dynamic Maximal Dense Tree Problem.
#@Baruch Awerbuch,Tripurari Singh
#t2002
#cAlgorithmica
#index749649
#% 
#!
  
#*Processor-Time Optimal Parallel Algorithms for Digitized Images on Mesh-Connected Processor Arrays.
#@Hussein M. Alnuweiri,Viktor K. Prasanna
#t1991
#cAlgorithmica
#index749650
#% 
#!
  
#*A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees.
#@Mauricio Ayala-Rincón,Paulo D. Conejo
#t2003
#cAlgorithmica
#index749651
#% 
#!
  
#*On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
#@Noga Alon,Yossi Azar,János Csirik,Leah Epstein,Sergey V. Sevastianov,Arjen P. A. Vestjens,Gerhard J. Woeginger
#t1998
#cAlgorithmica
#index749652
#% 
#!
  
#*Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(nsqrt(tau/log n) Algorithm.
#@Béchir el Ayeb
#t2002
#cAlgorithmica
#index749653
#% 
#!
  
#*Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions.
#@Noga Alon,Moni Naor
#t1996
#cAlgorithmica
#index749654
#% 
#!
  
#*On Capital Investment.
#@Yossi Azar,Yair Bartal,Esteban Feuerstein,Amos Fiat,Stefano Leonardi,Adi Rosén
#t1999
#cAlgorithmica
#index749655
#% 
#!
  
#*Improved Parallel Approximation of a Class of Integer Programming Problems.
#@Noga Alon,Aravind Srinivasan
#t1997
#cAlgorithmica
#index749656
#% 
#!
  
#*Fair versus Unrestricted Bin Packing.
#@Yossi Azar,Joan Boyar,Lene M. Favrholdt,Kim S. Larsen,Morten N. Nielsen,Leah Epstein
#t2002
#cAlgorithmica
#index749657
#% 
#!
  
#*Finding and Counting Given Length Cycles.
#@Noga Alon,Raphael Yuster,Uri Zwick
#t1997
#cAlgorithmica
#index749658
#% 
#!
  
#*Maximizing Throughput in Multi-Queue Switches.
#@Yossi Azar,Arik Litichevskey
#t2006
#cAlgorithmica
#index749659
#% 
#!
  
#*Algorithmic Aspects of Acyclic Edge Colorings.
#@Noga Alon,Ayal Zaks
#t2002
#cAlgorithmica
#index749660
#% 
#!
  
#*Management of Multi-Queue Switches in QoS Networks.
#@Yossi Azar,Yossi Richter
#t2005
#cAlgorithmica
#index749661
#% 
#!
  
#*A Linear-Time Algorithm for the Generation of Trees.
#@Laurent Alonso,Jean-Luc Remy,René Schott
#t1997
#cAlgorithmica
#index749662
#% 
#!
  
#*Combinatorial Algorithms for the Unsplittable Flow Problem.
#@Yossi Azar,Oded Regev
#t2006
#cAlgorithmica
#index749663
#% 
#!
  
#*The Uniform Memory Hierarchy Model of Computation.
#@Bowen Alpern,Larry Carter,Ephraim Feig,Ted Selker
#t1994
#cAlgorithmica
#index749664
#% 
#!
  
#*Sieve Algorithms for Perfect Power Testing.
#@Eric Bach,Jonathan Sorenson
#t1993
#cAlgorithmica
#index749665
#% 
#!
  
#*Generalized Dominators for Structured Programs.
#@Stephen Alstrup,Peter W. Lauridsen,Mikkel Thorup
#t2000
#cAlgorithmica
#index749666
#% 
#!
  
#*On the Competitive Theory and Practice of Online List Accessing Algorithms.
#@Ran Bachrach,Ran El-Yaniv,M. Reinstadtler
#t2002
#cAlgorithmica
#index749667
#% 
#!
  
#*Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
#@Helmut Alt,Rudolf Fleischer,Michael Kaufmann,Kurt Mehlhorn,Stefan Näher,Stefan Schirra,Christian Uhrig
#t1992
#cAlgorithmica
#index749668
#% 
#!
  
#*An Experimental Study of Algorithms for Weighted Completion Time Scheduling.
#@Ivan D. Baev,Waleed Meleis,Alexandre E. Eichenberger
#t2002
#cAlgorithmica
#index749669
#% 
#!
  
#*Matching Convex Shapes with Respect to the Symmetric Difference.
#@Helmut Alt,Ulrich Fuchs,Günter Rote,Gerald Weber
#t1998
#cAlgorithmica
#index749670
#% 
#!
  
#*On Boyer-Moore Automata.
#@Ricardo A. Baeza-Yates,Christian Choffrut,Gaston H. Gonnet
#t1994
#cAlgorithmica
#index749671
#% 
#!
  
#*A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
#@Helmut Alt,Leonidas J. Guibas,Kurt Mehlhorn,Richard M. Karp,Avi Wigderson
#t1996
#cAlgorithmica
#index749672
#% 
#!
  
#*Faster Approximate String Matching.
#@Ricardo A. Baeza-Yates,Gonzalo Navarro
#t1999
#cAlgorithmica
#index749673
#% 
#!
  
#*Comparison of Distance Measures for Planar Curves.
#@Helmut Alt,Christian Knauer,Carola Wenk
#t2003
#cAlgorithmica
#index749674
#% 
#!
  
#*Biased Skip Lists.
#@Amitabha Bagchi,Adam L. Buchsbaum,Michael T. Goodrich
#t2005
#cAlgorithmica
#index749675
#% 
#!
  
#*Finding a Closest Visible Vertex Pair Between Two Polygons.
#@Nancy M. Amato
#t1995
#cAlgorithmica
#index749676
#% 
#!
  
#*The k-Splittable Flow Problem.
#@Georg Baier,Ekkehard Köhler,Martin Skutella
#t2005
#cAlgorithmica
#index749677
#% 
#!
  
#*A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls.
#@Nancy M. Amato,Franco P. Preparata
#t1995
#cAlgorithmica
#index749678
#% 
#!
  
#*Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data.
#@Chandrajit L. Bajaj,Fausto Bernardini,Guoliang Xu
#t1997
#cAlgorithmica
#index749679
#% 
#!
  
#*Communication Complexity in a 3-Computer Model.
#@Andris Ambainis
#t1996
#cAlgorithmica
#index749680
#% 
#!
  
#*Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves.
#@Chandrajit L. Bajaj,Myung-Soo Kim
#t1989
#cAlgorithmica
#index749681
#% 
#!
  
#*Delayed Binary Search, or Playing Twenty Questions with a Procrastinator.
#@Andris Ambainis,Stephen A. Bloch,David L. Schweizer
#t2002
#cAlgorithmica
#index749682
#% 
#!
  
#*Convex Hulls of Objects Bounded by Algebraic Curves.
#@Chandrajit L. Bajaj,Myung-Soo Kim
#t1991
#cAlgorithmica
#index749683
#% 
#!
  
#*Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems.
#@Arnon Amir,Alon Efrat,Piotr Indyk,Hanan Samet
#t2001
#cAlgorithmica
#index749684
#% 
#!
  
#*Parameterization in Finite Precision.
#@Chandrajit L. Bajaj,Andrew V. Royappa
#t2000
#cAlgorithmica
#index749685
#% 
#!
  
#*Swap and Mismatch Edit Distance.
#@Amihood Amir,Estrella Eisenberg,Ely Porat
#t2006
#cAlgorithmica
#index749686
#% 
#!
  
#*Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring.
#@Egon Balas,Jue Xue
#t1996
#cAlgorithmica
#index749687
#% 
#!
  
#*Scheduling Independent Multiprocessor Tasks.
#@Abdel Krim Amoura,Evripidis Bampis,Claire Kenyon,Yannis Manoussakis
#t2002
#cAlgorithmica
#index749688
#% 
#!
  
#*A Conjecture on Wiener Indices in Combinatorial Chemistry.
#@Yih-En Andrew Ban,Sergey Bereg,Nabil H. Mustafa
#t2004
#cAlgorithmica
#index749689
#% 
#!
  
#*Parallel Algorithms for Arrangements.
#@Richard J. Anderson,Paul Beame,Erik Brisson
#t1996
#cAlgorithmica
#index749690
#% 
#!
  
#*A New Proof for the Existence of Mutually Unbiased Bases.
#@Somshubhro Bandyopadhyay,P. Oscar Boykin,Vwani P. Roychowdhury,Farrokh Vatan
#t2002
#cAlgorithmica
#index749691
#% 
#!
  
#*Single-Layer Cylindrical Compaction.
#@Richard Anderson,Simon Kahan,Martine D. F. Schlag
#t1993
#cAlgorithmica
#index749692
#% 
#!
  
#*A Branch-Checking Algorithm for All-Pairs Shortest Paths.
#@Cees Duin
#t2004
#cAlgorithmica
#index749693
#% 
#!
  
#*On Heuristics for Minimum Length Rectilinear Partitions.
#@Ding-Zhu Du,Yanjun Zhang
#t1990
#cAlgorithmica
#index749694
#% 
#!
  
#*The Power of Priority Algorithms for Facility Location and Set Cover.
#@Spyros Angelopoulos,Allan Borodin
#t2004
#cAlgorithmica
#index749695
#% 
#!
  
#*Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
#@Jørgen Bang-Jensen,Mohamed El Haddad,Yannis Manoussakis,Teresa M. Przytycka
#t1997
#cAlgorithmica
#index749696
#% 
#!
  
#*A Monotonic Projective Algorithm for Fractional Linear Programming.
#@Kurt M. Anstreicher
#t1986
#cAlgorithmica
#index749697
#% 
#!
  
#*Efficient Bulk Operations on Dynamic R-Trees.
#@Lars Arge,Klaus Hinrichs,Jan Vahrenhold,Jeffrey Scott Vitter
#t2002
#cAlgorithmica
#index749698
#% 
#!
  
#*A Comparison of Resource-Bounded Molecular Computation Models.
#@Bin Fu,Richard Beigel
#t1999
#cAlgorithmica
#index749699
#% 
#!
  
#*A Long-Step Barrier Method for Convex Quadratic Programming.
#@Kurt M. Anstreicher,Dick den Hertog,Cornelis Roos,Tamás Terlaky
#t1993
#cAlgorithmica
#index749700
#% 
#!
  
#*Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.
#@Nikhil Bansal,Kedar Dhamdhere,Jochen Könemann,Amitabh Sinha
#t2004
#cAlgorithmica
#index749701
#% 
#!
  
#*Optimal Parallel Detection of Squares in Strings.
#@Alberto Apostolico
#t1992
#cAlgorithmica
#index749702
#% 
#!
  
#*Competitive On-Line Switching Policies.
#@Amotz Bar-Noy,Ari Freund,Shimon Landa,Joseph Naor
#t2003
#cAlgorithmica
#index749703
#%952554
#%949761
#%1036707
#%950525
#%622483
#%402037
#!
  
#*Guest Editor's Foreword: Special Issue on String Algorithmics and Its Applications.
#@Alberto Apostolico
#t1994
#cAlgorithmica
#index749704
#% 
#!
  
#*One for the Price of Two: a Unified Approach for Approximating Covering Problems.
#@Reuven Bar-Yehuda
#t2000
#cAlgorithmica
#index749705
#% 
#!
  
#*The Longest Common Subsequence Problem Revisited.
#@Alberto Apostolico,Concettina Guerra
#t1987
#cAlgorithmica
#index749706
#% 
#!
  
#*On Minimum-Area Hulls.
#@Esther M. Arkin,Yi-Jen Chiang,Martin Held,Joseph S. B. Mitchell,Vera Sacristan,Steven Skiena,Tae-Heng Yang
#t1998
#cAlgorithmica
#index749707
#% 
#!
  
#*Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs.
#@Xin He
#t1990
#cAlgorithmica
#index749708
#% 
#!
  
#*Parallel Construction of a Suffix Tree with Applications.
#@Alberto Apostolico,Costas S. Iliopoulos,Gad M. Landau,Baruch Schieber,Uzi Vishkin
#t1988
#cAlgorithmica
#index749709
#% 
#!
  
#*Variations on Ray Shooting.
#@Reuven Bar-Yehuda,Sergio Fogel
#t1994
#cAlgorithmica
#index749710
#% 
#!
  
#*Data Structures and Algorithms for the String Statistics Problem.
#@Alberto Apostolico,Franco P. Preparata
#t1996
#cAlgorithmica
#index749711
#% 
#!
  
#*Efficient Algorithms for Integer Programs with Two Variables per Constraint.
#@Reuven Bar-Yehuda,Dror Rawitz
#t2001
#cAlgorithmica
#index749712
#% 
#!
  
#*The Buffer Tree: A Technique for Designing Batched External Data Structures.
#@Lars Arge
#t2003
#cAlgorithmica
#index749713
#% 
#!
  
#*Issues in Computing Contact Forces for Non-Penetrating Rigid Bodies.
#@David Baraff
#t1993
#cAlgorithmica
#index749714
#% 
#!
  
#*Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms.
#@David Baraff,Raju Mattikalli,Pradeep K. Khosla
#t1997
#cAlgorithmica
#index749715
#% 
#!
  
#*Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
#@Gill Barequet,Danny Z. Chen,Ovidiu Daescu,Michael T. Goodrich,Jack Snoeyink
#t2002
#cAlgorithmica
#index749716
#% 
#!
  
#*Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles.
#@Jérôme Barraquand,Jean-Claude Latombe
#t1993
#cAlgorithmica
#index749717
#% 
#!
  
#*Fast, Fair and Frugal Bandwidth Allocation in ATM Networks.
#@Yair Bartal,Martin Farach-Colton,Shibu Yooseph,Lisa Zhang
#t2002
#cAlgorithmica
#index749718
#% 
#!
  
#*Proportionate Progress: A Notion of Fairness in Resource Allocation.
#@Sanjoy K. Baruah,N. K. Cohen,C. Greg Plaxton,Donald A. Varvel
#t1996
#cAlgorithmica
#index749719
#% 
#!
  
#*Reporting Red - Blue Intersections between Two Sets of Connected Line Segments.
#@Julien Basch,Leonidas J. Guibas,G. D. Ramkumar
#t2003
#cAlgorithmica
#index749720
#% 
#!
  
#*A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
#@Holger Bast,Kurt Mehlhorn,Guido Schäfer
#t2003
#cAlgorithmica
#index749721
#% 
#!
  
#*Planar Graph Blocking for External Searching.
#@Surender Baswana,Sandeep Sen
#t2002
#cAlgorithmica
#index749722
#% 
#!
  
#*Dynamic Programming and Convex Clustering.
#@Vladimir Batagelj,Simona Korenjak-Cerne,Sandi Klavzar
#t1994
#cAlgorithmica
#index749723
#% 
#!
  
#*On-Line Maintenance of Triconnected Components with SPQR-Trees.
#@Giuseppe Di Battista,Roberto Tamassia
#t1996
#cAlgorithmica
#index749724
#% 
#!
  
#*Guest Editors' Introduction to the Special Issue on Graph Drwaing
#@Giuseppe Di Battista,Roberto Tamassia
#t1996
#cAlgorithmica
#index749725
#% 
#!
  
#*Output-Sensitive Reporting of Disjoint Paths.
#@Giuseppe Di Battista,Roberto Tamassia,Luca Vismara
#t1999
#cAlgorithmica
#index749726
#% 
#!
  
#*Foreword.
#@Roberto Battiti,Alan A. Bertossi
#t2002
#cAlgorithmica
#index749727
#% 
#!
  
#*Reactive Local Search for the Maximum Clique Problem.
#@Roberto Battiti,Marco Protasi
#t2001
#cAlgorithmica
#index749728
#% 
#!
  
#*The Complexity of Parallel Multisearch on Coarse-Grained Machines.
#@Armin Bäumker,Wolfgang Dittrich,Andrea Pietracaprina
#t1999
#cAlgorithmica
#index749729
#% 
#!
  
#*Approximation of Geometric Dispersion Problems.
#@Christoph Baur,Sándor P. Fekete
#t2001
#cAlgorithmica
#index749730
#% 
#!
  
#*A Permanent Algorithm with exp[Omega (n/2 ln n )] Expected Speedup for 0-1 Matrices.
#@Eric T. Bax,Joel Franklin
#t2002
#cAlgorithmica
#index749731
#% 
#!
  
#*The Solution of Linear Probabilistic Recurrence Relations.
#@Louay Bazzi,Sanjoy K. Mitter
#t2003
#cAlgorithmica
#index749732
#% 
#!
  
#*The Complexity of Almost-Optimal Simultaneous Coordination.
#@Rida A. Bazzi,Gil Neiger
#t1997
#cAlgorithmica
#index749733
#% 
#!
  
#*Equivalence of Binary and Ternary Algebraic Decision Trees.
#@Robert Beals
#t1997
#cAlgorithmica
#index749734
#% 
#!
  
#*Sharp Quantum versus Classical Query Complexity Separations.
#@J. Niel de Beaudrap,Richard Cleve,John Watrous
#t2002
#cAlgorithmica
#index749735
#% 
#!
  
#*Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms.
#@Olivier Beaumont,Vincent Boudet,Fabrice Rastello,Yves Robert
#t2002
#cAlgorithmica
#index749736
#% 
#!
  
#*An Experimental Study of Random Knapsack Problems.
#@René Beier,Berthold Vöcking
#t2006
#cAlgorithmica
#index749737
#% 
#!
  
#*Molecular Computing, Bounded Nondeterminism, and Efficient Recursion.
#@Richard Beigel,Bin Fu
#t1999
#cAlgorithmica
#index749738
#% 
#!
  
#*Learning Boxes in High Dimension.
#@Amos Beimel,Eyal Kushilevitz
#t1998
#cAlgorithmica
#index749739
#% 
#!
  
#*Reductions Do Not Preserve Fast Convergence Rates in Average Time.
#@Jay Belanger,Aduri Pavan,Jie Wang
#t1999
#cAlgorithmica
#index749740
#% 
#!
  
#*Exact Algorithms for Linear Programming over Algebraic Extensions.
#@Peter A. Beling
#t2001
#cAlgorithmica
#index749741
#% 
#!
  
#*A Generalization of a Lower Bound Technique due to Fredman and Saks.
#@Amir M. Ben-Amram,Zvi Galil
#t2001
#cAlgorithmica
#index749742
#% 
#!
  
#*Lower Bounds for Dynamic Data Structures on Algebraic RAMs.
#@Amir M. Ben-Amram,Zvi Galil
#t2002
#cAlgorithmica
#index749743
#% 
#!
  
#*A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms.
#@Ishai Ben-Aroya,Donald D. Chinn,Assaf Schuster
#t1998
#cAlgorithmica
#index749744
#% 
#!
  
#*Can Finite Samples Detect Singularities of Reao-Valued Functions?
#@Shai Ben-David
#t1998
#cAlgorithmica
#index749745
#% 
#!
  
#*A New Measure for the Study of On-Line Algorithms.
#@Shai Ben-David,Allan Borodin
#t1994
#cAlgorithmica
#index749746
#% 
#!
  
#*On the Power of Randomization in On-Line Algorithms.
#@Shai Ben-David,Allan Borodin,Richard M. Karp,Gábor Tardos,Avi Wigderson
#t1994
#cAlgorithmica
#index749747
#% 
#!
  
#*The Representation of Numbers in Quantum Mechanics.
#@Paul Benioff
#t2002
#cAlgorithmica
#index749748
#% 
#!
  
#*Representing Trees of Higher Degree.
#@David Benoit,Erik D. Demaine,J. Ian Munro,Rajeev Raman,Venkatesh Raman,S. Srinivasa Rao
#t2005
#cAlgorithmica
#index749749
#% 
#!
  
#*Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls.
#@Jon Louis Bentley,Kenneth L. Clarkson,David B. Levine
#t1993
#cAlgorithmica
#index749750
#% 
#!
  
#*Linear Size Binary Space Partitions for Uncluttered Scenes.
#@Mark de Berg
#t2000
#cAlgorithmica
#index749751
#% 
#!
  
#*Efficient Ray Shooting and Hidden Surface Removal.
#@Mark de Berg,Dan Halperin,Mark H. Overmars,Jack Snoeyink,Marc J. van Kreveld
#t1994
#cAlgorithmica
#index749752
#% 
#!
  
#*Trekking in the Alps Without Freezing or Getting Tired.
#@Mark de Berg,Marc J. van Kreveld
#t1997
#cAlgorithmica
#index749753
#% 
#!
  
#*Realistic Input Models for Geometric Algorithms.
#@Mark de Berg,A. Frank van der Stappen,Jules Vleugels,Matthew J. Katz
#t2002
#cAlgorithmica
#index749754
#% 
#!
  
#*Minimum Cycle Bases for Network Graphs.
#@Franziska Berger,Peter Gritzmann,Sven de Vries
#t2004
#cAlgorithmica
#index749755
#% 
#!
  
#*Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size.
#@T. Berger,A. Hekstra,Alon Orlitsky
#t1993
#cAlgorithmica
#index749756
#% 
#!
  
#*A Better Performance Guarantee for Approximate Graph Coloring.
#@Bonnie Berger,John Rompel
#t1990
#cAlgorithmica
#index749757
#% 
#!
  
#*Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems.
#@Piotr Berman,Bhaskar DasGupta
#t1997
#cAlgorithmica
#index749758
#% 
#!
  
#*Two Probabilistic Results on Rectilinear Steiner Trees.
#@Marshall W. Bern
#t1988
#cAlgorithmica
#index749759
#% 
#!
  
#*Visibility with a Moving Point of View.
#@Marshall W. Bern,David P. Dobkin,David Eppstein,Robert L. Grossman
#t1994
#cAlgorithmica
#index749760
#% 
#!
  
#*On-Line Algorithms for Locating Checkpoints.
#@Marshall W. Bern,Daniel H. Greene,Arvind Raghunathan,Madhu Sudan
#t1994
#cAlgorithmica
#index749761
#% 
#!
  
#*Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.
#@Anne Berry,Jean R. S. Blair,Pinar Heggernes,Barry W. Peyton
#t2004
#cAlgorithmica
#index749762
#% 
#!
  
#*Sorting-Based Selection Algorithms for Hypercubic Networks.
#@Pascal Berthomé,Afonso Ferreira,Bruce M. Maggs,Stephane Perennes,C. Greg Plaxton
#t2000
#cAlgorithmica
#index749763
#% 
#!
  
#*Quasi-Upward Planarity.
#@Paola Bertolazzi,Giuseppe Di Battista,Walter Didimo
#t2002
#cAlgorithmica
#index749764
#% 
#!
  
#*Upward Drawings of Triconnected Digraphs.
#@Paola Bertolazzi,Giuseppe Di Battista,Giuseppe Liotta,Carlo Mannino
#t1994
#cAlgorithmica
#index749765
#% 
#!
  
#*A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation.
#@Alberto Bertoni,Paola Campadelli,Giuliano Grossi
#t2002
#cAlgorithmica
#index749766
#% 
#!
  
#*On Constructing Minimum Spanning Trees in R.
#@Sergei Bespamyatnikh
#t1997
#cAlgorithmica
#index749767
#% 
#!
  
#*Fast Algorithms for Approximating Distances.
#@Sergei Bespamyatnikh,Michael Segal
#t2002
#cAlgorithmica
#index749768
#% 
#!
  
#*A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph.
#@Jayaram Bhasker,Sartaj Sahni
#t1988
#cAlgorithmica
#index749769
#% 
#!
  
#*Partitioning Circuits for Improved Testability.
#@Sandeep N. Bhatt,Fan R. K. Chung,Arnold L. Rosenberg
#t1991
#cAlgorithmica
#index749770
#% 
#!
  
#*Algorithms for the Boundary Selection Problem.
#@Jay N. Bhuyan,Jitender S. Deogun,Vijay V. Raghavan
#t1997
#cAlgorithmica
#index749771
#% 
#!
  
#*On Triangulating Planar Graphs Under the Four-Connectivity Constraint.
#@Therese C. Biedl,Goos Kant,Michael Kaufmann
#t1997
#cAlgorithmica
#index749772
#% 
#!
  
#*Three-Dimensional Orthogonal Graph Drawing with Optimal Volume.
#@Therese C. Biedl,Torsten Thiele,David R. Wood
#t2006
#cAlgorithmica
#index749773
#% 
#!
  
#*On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.
#@Daniel Bienstock,Clyde L. Monma
#t1990
#cAlgorithmica
#index749774
#% 
#!
  
#*Security of Quantum Key Distribution against All Collective Attacks.
#@Eli Biham,Michel Boyer,Gilles Brassard,Jeroen van de Graaf,Tal Mor
#t2002
#cAlgorithmica
#index749775
#% 
#!
  
#*Area-Time Lower-Bound Techniques with Applications to Sorting.
#@Gianfranco Bilardi,Franco P. Preparata
#t1986
#cAlgorithmica
#index749776
#% 
#!
  
#*BSP versus LogP.
#@Gianfranco Bilardi,Andrea Pietracaprina,Geppino Pucci,Kieran T. Herley,Paul G. Spirakis
#t1999
#cAlgorithmica
#index749777
#% 
#!
  
#*The Iterative Step in the Linear Programming Algorithm of N. Karmarkar.
#@C. E. Blair
#t1986
#cAlgorithmica
#index749778
#% 
#!
  
#*Minimizing Channel Density in Standard Cell Layout.
#@Jean R. S. Blair,Sanjiv Kapoor,Errol L. Lloyd,Kenneth J. Supowit
#t1987
#cAlgorithmica
#index749779
#% 
#!
  
#*Internal and External Algorithms for the Points-in-Regions Problem-the INSIDE Join of Geo-Relational Algebra.
#@Gabriele Blankenagel,Ralf Hartmut Güting
#t1990
#cAlgorithmica
#index749780
#% 
#!
  
#*External Segment Trees.
#@Gabriele Blankenagel,Ralf Hartmut Güting
#t1994
#cAlgorithmica
#index749781
#% 
#!
  
#*Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One.
#@Markus Bläser,Bodo Manthey
#t2005
#cAlgorithmica
#index749782
#% 
#!
  
#*Design and Implementation of a Practical Parallel Delaunay Algorithm.
#@Guy E. Blelloch,Jonathan C. Hardwick,Gary L. Miller,Dafna Talmor
#t1999
#cAlgorithmica
#index749783
#% 
#!
  
#*Denesting by Bounded Degree Radicals.
#@Johannes Blömer
#t2000
#cAlgorithmica
#index749784
#% 
#!
  
#*Static Optimality and Dynamic Search-Optimality in Lists and Trees.
#@Avrim Blum,Shuchi Chawla,Adam Kalai
#t2003
#cAlgorithmica
#index749785
#%929666
#%1009347
#%3005125
#%108904
#%211056
#%888676
#%776121
#%951628
#%934100
#%1060637
#!
  
#*Checking the Correctness of Memories.
#@Manuel Blum,William S. Evans,Peter Gemmell,Sampath Kannan,Moni Naor
#t1994
#cAlgorithmica
#index749786
#% 
#!
  
#*A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions.
#@Avrim Blum,Alan M. Frieze,Ravi Kannan,Santosh Vempala
#t1998
#cAlgorithmica
#index749787
#% 
#!
  
#*Introduction.
#@Hans L. Bodlaender
#t2000
#cAlgorithmica
#index749788
#% 
#!
  
#*Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.
#@Hans L. Bodlaender,Babette van Antwerpen-de Fluiter
#t2001
#cAlgorithmica
#index749789
#% 
#!
  
#*Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.
#@Hans L. Bodlaender,Udi Rotics
#t2003
#cAlgorithmica
#index749790
#%1061054
#%1061056
#%619930
#%1058697
#%660362
#%836239
#%70760
#%610337
#%651274
#%1059793
#%851455
#%1061829
#!
  
#*Algorithms for Sensorless Manipulation Using a Vibrating Surface.
#@Karl-Friedrich Böhringer,Vivek Bhatt,Bruce Randall Donald,Kenneth Y. Goldberg
#t2000
#cAlgorithmica
#index749791
#% 
#!
  
#*Circular Separability of Polygons.
#@Jean-Daniel Boissonnat,Jurek Czyzowicz,Olivier Devillers,Mariette Yvinec
#t2001
#cAlgorithmica
#index749792
#% 
#!
  
#*A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis.
#@Jean-Daniel Boissonnat,Olivier Devillers,Monique Teillaud
#t1993
#cAlgorithmica
#index749793
#% 
#!
  
#*An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.
#@Jean-Daniel Boissonnat,Subir Kumar Ghosh,Telikepalli Kavitha,Sylvain Lazard
#t2002
#cAlgorithmica
#index749794
#% 
#!
  
#*Probing a Scene of Nonconvex Polyhedra.
#@Jean-Daniel Boissonnat,Mariette Yvinec
#t1992
#cAlgorithmica
#index749795
#% 
#!
  
#*Steiner Minimal Trees for a Class of Zigzag Lines.
#@R. S. Booth,J. F. Weng
#t1992
#cAlgorithmica
#index749796
#% 
#!
  
#*A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs.
#@Heather Booth,Jeffery Westbrook
#t1994
#cAlgorithmica
#index749797
#% 
#!
  
#*Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs.
#@Richard B. Borie
#t1995
#cAlgorithmica
#index749798
#% 
#!
  
#*Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families.
#@Richard B. Borie,R. Gary Parker,Craig A. Tovey
#t1992
#cAlgorithmica
#index749799
#% 
#!
  
#*(Incremental) Priority Algorithms.
#@Allan Borodin,Morten N. Nielsen,Charles Rackoff
#t2003
#cAlgorithmica
#index749800
#%949605
#%952554
#%621377
#%210041
#%289172
#%621670
#%2022
#%950677
#%1092701
#%610981
#%951514
#!
  
#*On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise.
#@Robert A. Bosch,Kurt M. Anstreicher
#t1993
#cAlgorithmica
#index749801
#% 
#!
  
#*Determining the Castability of Simple Polyhedra.
#@Prosenjit Bose,David Bremner,Marc J. van Kreveld
#t1997
#cAlgorithmica
#index749802
#% 
#!
  
#*Constructing Plane Spanners of Bounded Degree and Low Weight.
#@Prosenjit Bose,Joachim Gudmundsson,Michiel H. M. Smid
#t2005
#cAlgorithmica
#index749803
#% 
#!
  
#*Some Aperture-Angle Optimization Problems.
#@Prosenjit Bose,Ferran Hurtado,Elsa Omaña-Pulido,Jack Snoeyink,Godfried T. Toussaint
#t2002
#cAlgorithmica
#index749804
#% 
#!
  
#*Characterizing Proximity Trees.
#@Prosenjit Bose,William Lenhart,Giuseppe Liotta
#t1996
#cAlgorithmica
#index749805
#% 
#!
  
#*Testing the Quality of Manufactured Disks and Balls.
#@Prosenjit Bose,Pat Morin
#t2003
#cAlgorithmica
#index749806
#% 
#!
  
#*Guest Editors' Foreword.
#@Prosenjit Bose,Pat Morin
#t2005
#cAlgorithmica
#index749807
#% 
#!
  
#*The Seat Reservation Problem.
#@Joan Boyar,Kim S. Larsen
#t1999
#cAlgorithmica
#index749808
#% 
#!
  
#*Optimal Multilayer Channel Routing with Overlap.
#@Martin L. Brady,Donna J. Brown
#t1991
#cAlgorithmica
#index749809
#% 
#!
  
#*Hexagonal Models for Channel Routing.
#@Martin L. Brady,Donna J. Brown,K. D. Powers
#t1997
#cAlgorithmica
#index749810
#% 
#!
  
#*A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs.
#@Ulrik Brandes,Dorothea Wagner
#t2000
#cAlgorithmica
#index749811
#% 
#!
  
#*Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics.
#@Marcus Brazil,D. A. Thomas,J. F. Weng,Martin Zachariasen
#t2006
#cAlgorithmica
#index749812
#% 
#!
  
#*Small Strictly Convex Quadrilateral Meshes of Point Sets.
#@David Bremner,Ferran Hurtado,Suneeta Ramaswami,Vera Sacristan
#t2003
#cAlgorithmica
#index749813
#% 
#!
  
#*Finding All Periods and Initial Palindromes of a String in Parallel.
#@Dany Breslauer,Zvi Galil
#t1995
#cAlgorithmica
#index749814
#% 
#!
  
#*An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty.
#@Amy J. Briggs
#t1992
#cAlgorithmica
#index749815
#% 
#!
  
#*Visibility-Based Planning of Sensor Control Strategies.
#@Amy J. Briggs,Bruce Randall Donald
#t2000
#cAlgorithmica
#index749816
#% 
#!
  
#*Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
#@Gerth Stølting Brodal,Rolf Fagerberg,Christian N. S. Pedersen
#t2003
#cAlgorithmica
#index749817
#% 
#!
  
#*Optimal Solutions for the Temporal Precedence Problem.
#@Gerth Stølting Brodal,Christos Makris,Spyros Sioutas,Athanasios K. Tsakalidis,Kostas Tsichlas
#t2002
#cAlgorithmica
#index749818
#% 
#!
  
#*Online and Offline Algorithms for the Time-Dependent TSP with Time Zones.
#@Björn Brodén,Mikael Hammar,Bengt J. Nilsson
#t2004
#cAlgorithmica
#index749819
#% 
#!
  
#*Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.
#@Hajo Broersma,Fedor V. Fomin,Jan Kratochvíl,Gerhard J. Woeginger
#t2006
#cAlgorithmica
#index749820
#% 
#!
  
#*A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.
#@Hajo Broersma,Ton Kloks,Dieter Kratsch,Haiko Müller
#t2002
#cAlgorithmica
#index749821
#% 
#!
  
#*Efficient Exact Evaluation of Signs of Determinants.
#@Hervé Brönnimann,Mariette Yvinec
#t2000
#cAlgorithmica
#index749822
#% 
#!
  
#*Mobile Robot Self-Localization without Explicit Landmarks.
#@R. G. Brown,Bruce Randall Donald
#t2000
#cAlgorithmica
#index749823
#% 
#!
  
#*Remotely Prepared Entanglement: a Quantum Web Page.
#@Todd A. Brun
#t2002
#cAlgorithmica
#index749824
#% 
#!
  
#*Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles.
#@Danilo Bruschi,F. Ravasio
#t1995
#cAlgorithmica
#index749825
#% 
#!
  
#*The Complete Solution of the Competitive Rank Selection Problem.
#@F. Thomas Bruss,Michael Drmota,Guy Louchard
#t1998
#cAlgorithmica
#index749826
#% 
#!
  
#*On Learning Decision Trees with Large Output Domains.
#@Nader H. Bshouty,Christino Tamon,David K. Wilson
#t1998
#cAlgorithmica
#index749827
#% 
#!
  
#*Learning Matrix Functions over Rings.
#@Nader H. Bshouty,Christino Tamon,David K. Wilson
#t1998
#cAlgorithmica
#index749828
#% 
#!
  
#*Three-Dimensional Layers of Maxima.
#@Adam L. Buchsbaum,Michael T. Goodrich
#t2004
#cAlgorithmica
#index749829
#% 
#!
  
#*An Approximate Determinization Algorithm for Weighted Finite-State Automata.
#@Adam L. Buchsbaum,Raffaele Giancarlo,Jeffery Westbrook
#t2001
#cAlgorithmica
#index749830
#% 
#!
  
#*On Algorithm Design for Metrical Task Systems.
#@William R. Burley,Sandy Irani
#t1997
#cAlgorithmica
#index749831
#% 
#!
  
#*A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.
#@Christoph Burnikel,Rudolf Fleischer,Kurt Mehlhorn,Stefan Schirra
#t2000
#cAlgorithmica
#index749832
#% 
#!
  
#*Direct Routing: Algorithms and Complexity.
#@Costas Busch,Malik Magdon-Ismail,Marios Mavronicolas,Paul G. Spirakis
#t2006
#cAlgorithmica
#index749833
#% 
#!
  
#*Approximation Algorithms for Aligning Points.
#@Sergio Cabello,Marc J. van Kreveld
#t2003
#cAlgorithmica
#index749834
#%949686
#%110792
#%836992
#%950618
#%950675
#!
  
#*Isomorphic Tree Spanner Problems.
#@Leizhen Cai,Derek G. Corneil
#t1995
#cAlgorithmica
#index749835
#% 
#!
  
#*Minimum k Arborescences with Bandwidth Constraints.
#@Mao-cheng Cai,Xiaotie Deng,Lusheng Wang
#t2004
#cAlgorithmica
#index749836
#% 
#!
  
#*Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems.
#@Yang Cai,M. C. Kong
#t1996
#cAlgorithmica
#index749837
#% 
#!
  
#*Foreword.
#@Jin-yi Cai,C. K. Wong
#t1999
#cAlgorithmica
#index749838
#% 
#!
  
#*A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
#@Gruia Calinescu,Cristina G. Fernandes,Howard J. Karloff,Alexander Zelikovsky
#t2003
#cAlgorithmica
#index749839
#% 
#!
  
#*An Opportunistic Global Path Planner.
#@John F. Canny,Ming C. Lin
#t1993
#cAlgorithmica
#index749840
#% 
#!
  
#*Sublinear Merging and Natural Mergesort.
#@Svante Carlsson,Christos Levcopoulos,Ola Petersson
#t1993
#cAlgorithmica
#index749841
#% 
#!
  
#*Computing Vision Points in Polygons.
#@Svante Carlsson,Bengt J. Nilsson
#t1999
#cAlgorithmica
#index749842
#% 
#!
  
#*Geographic Quorum System Approximations.
#@Paz Carmi,Shlomi Dolev,Sariel Har-Peled,Matthew J. Katz,Michael Segal
#t2005
#cAlgorithmica
#index749843
#% 
#!
  
#*A Good Oracle Is Hard to Beat.
#@Douglas A. Cenzer,William R. Moser
#t1998
#cAlgorithmica
#index749844
#% 
#!
  
#*On Bayes Methods for On-Line Boolean Prediction.
#@Nicolò Cesa-Bianchi,David P. Helmbold,Sandra Panizza
#t1998
#cAlgorithmica
#index749845
#% 
#!
  
#*Approximate Option Pricing.
#@Prasad Chalasani,Somesh Jha,Isaac Saias
#t1999
#cAlgorithmica
#index749846
#% 
#!
  
#*A Near-Linear Area Bound for Drawing Binary Trees.
#@Timothy M. Chan
#t2002
#cAlgorithmica
#index749847
#% 
#!
  
#*Schedulers for Larger Classes of Pinwheel Instances.
#@Mee Yee Chan,Francis Y. L. Chin
#t1993
#cAlgorithmica
#index749848
#% 
#!
  
#*Escaping a Grid by Edge-Disjoint Paths.
#@Wun-Tat Chan,Francis Y. L. Chin,Hing-Fung Ting
#t2003
#cAlgorithmica
#index749849
#% 
#!
  
#*Parallel Computational Geometry of Rectangles.
#@Sharat Chandran,Sung Kwon Kim,David M. Mount
#t1992
#cAlgorithmica
#index749850
#% 
#!
  
#*Sublinear Approximate String Matching and Biological Applications.
#@William I. Chang,Eugene L. Lawler
#t1994
#cAlgorithmica
#index749851
#% 
#!
  
#*Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
#@Maw-Shang Chang,Chuan Yi Tang,Richard C. T. Lee
#t1992
#cAlgorithmica
#index749852
#% 
#!
  
#*A Simultaneous Search Problem.
#@Ee-Chien Chang,Chee-Keng Yap
#t2000
#cAlgorithmica
#index749853
#% 
#!
  
#*Finding All Minimal Shapes in a Routing Channel.
#@Liang-Fang Chao,Andrea S. LaPaugh
#t1998
#cAlgorithmica
#index749854
#% 
#!
  
#*Linear-Space Algorithms that Build Local Alignments from Fragments.
#@Kun-Mao Chao,Webb Miller
#t1995
#cAlgorithmica
#index749855
#% 
#!
  
#*Computing Mimicking Networks.
#@Shiva Chaudhuri,K. V. Subrahmanyam,Frank Wagner,Christos D. Zaroliagis
#t2000
#cAlgorithmica
#index749856
#% 
#!
  
#*Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms.
#@Shiva Chaudhuri,Christos D. Zaroliagis
#t2000
#cAlgorithmica
#index749857
#% 
#!
  
#*Erratum to 'Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes'.
#@Frédéric Chazal,Véronique Maume-Deschamps,Brigitte Vallée
#t2004
#cAlgorithmica
#index749858
#% 
#!
  
#*Editor's Foreword.
#@Bernard Chazelle
#t1987
#cAlgorithmica
#index749859
#% 
#!
  
#*Computing on a Free Tree via Complexity-Preserving Mappings.
#@Bernard Chazelle
#t1987
#cAlgorithmica
#index749860
#% 
#!
  
#*An Algorithm for Segment-Dragging and Its Implementation.
#@Bernard Chazelle
#t1988
#cAlgorithmica
#index749861
#% 
#!
  
#*Splitting a Delaunay Triangulation in Linear Time.
#@Bernard Chazelle,Olivier Devillers,Ferran Hurtado,Mercè Mora,Vera Sacristan,Monique Teillaud
#t2002
#cAlgorithmica
#index749862
#%842918
#%110631
#%843012
#%110758
#%1089517
#%843169
#%1058865
#%929927
#%804006
#!
  
#*Ray Shooting in Polygons Using Geodesic Triangulations.
#@Bernard Chazelle,Herbert Edelsbrunner,Michelangelo Grigni,Leonidas J. Guibas,John Hershberger,Micha Sharir,Jack Snoeyink
#t1994
#cAlgorithmica
#index749863
#% 
#!
  
#*Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains.
#@Bernard Chazelle,Herbert Edelsbrunner,Leonidas J. Guibas,Micha Sharir
#t1994
#cAlgorithmica
#index749864
#% 
#!
  
#*Lines in Space: Combinatorics and Algorithms.
#@Bernard Chazelle,Herbert Edelsbrunner,Leonidas J. Guibas,Micha Sharir,Jorge Stolfi
#t1996
#cAlgorithmica
#index749865
#% 
#!
  
#*Fractional Cascading: I. A Data Structuring Technique.
#@Bernard Chazelle,Leonidas J. Guibas
#t1986
#cAlgorithmica
#index749866
#% 
#!
  
#*Fractional Cascading: II. Applications.
#@Bernard Chazelle,Leonidas J. Guibas
#t1986
#cAlgorithmica
#index749867
#% 
#!
  
#*Decomposing the Boundary of a Nonconvex Polyhedron.
#@Bernard Chazelle,Leonidas Palios
#t1997
#cAlgorithmica
#index749868
#% 
#!
  
#*Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.
#@Bernard Chazelle,Micha Sharir,Emo Welzl
#t1992
#cAlgorithmica
#index749869
#% 
#!
  
#*Building Edge-Failure Resilient Networks.
#@Chandra Chekuri,Anupam Gupta,Amit Kumar,Joseph Naor,Danny Raz
#t2005
#cAlgorithmica
#index749870
#% 
#!
  
#*Efficient Parallel Recognition of Some Circular Arc Graphs, I.
#@Lin Chen
#t1993
#cAlgorithmica
#index749871
#% 
#!
  
#*Heuristic Sampling on DAGs.
#@Pang-Chieh Chen
#t1994
#cAlgorithmica
#index749872
#% 
#!
  
#*Efficient Parallel Recognition of Some Circular Arc Graphs, II.
#@Lin Chen
#t1997
#cAlgorithmica
#index749873
#% 
#!
  
#*Budget Management with Applications.
#@Chunhong Chen,Elaheh Bozorgzadeh,Ankur Srivastava,Majid Sarrafzadeh
#t2002
#cAlgorithmica
#index749874
#% 
#!
  
#*Parallel Algorithms for Partitioning Sorted Sets and Related Problems.
#@Danny Z. Chen,Wei Chen,Koichi Wada,Kimio Kawaguchi
#t2000
#cAlgorithmica
#index749875
#% 
#!
  
#*Using Nondeterminism to Design Efficient Deterministic Algorithms.
#@Jianer Chen,Donald K. Friesen,Weijia Jia,Iyad A. Kanj
#t2004
#cAlgorithmica
#index749876
#% 
#!
  
#*Disk Embeddings of Planar Graphs.
#@Zhi-Zhong Chen,Xin He
#t2004
#cAlgorithmica
#index749877
#% 
#!
  
#*An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs.
#@Xin He
#t1995
#cAlgorithmica
#index749878
#% 
#!
  
#*Parallel Algorithms for Maximal Acyclic Sets.
#@Zhi-Zhong Chen,Xin He
#t1997
#cAlgorithmica
#index749879
#% 
#!
  
#*Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy.
#@Danny Z. Chen,Xiaobo Sharon Hu,Shuang Luan,Xiaodong Wu,Cedric X. Yu
#t2005
#cAlgorithmica
#index749880
#% 
#!
  
#*The Complexity of Oblivious Plans for Orienting and Distinguishing Polygonal Parts.
#@Yui-Bin Chen,Doug Ierardi
#t1995
#cAlgorithmica
#index749881
#% 
#!
  
#*Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints.
#@Yui-Bin Chen,Doug Ierardi
#t1997
#cAlgorithmica
#index749882
#% 
#!
  
#*A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs.
#@Zhi-Zhong Chen,Mitsuharu Kouno
#t2005
#cAlgorithmica
#index749883
#% 
#!
  
#*Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
#@Jianer Chen,Iyad A. Kanj,Ge Xia
#t2005
#cAlgorithmica
#index749884
#% 
#!
  
#*A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion.
#@Hsiao-Feng Steven Chen,D. T. Lee
#t2000
#cAlgorithmica
#index749885
#% 
#!
  
#*Efficient Algorithms for k-Terminal Cuts on Planar Graphs.
#@Danny Z. Chen,Xiaodong Wu
#t2003
#cAlgorithmica
#index749886
#% 
#!
  
#*An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
#@Xujin Chen,Wenan Zang
#t2006
#cAlgorithmica
#index749887
#% 
#!
  
#*Maximum Concurrent Flows and Minimum Cuts.
#@Chung-Kuan Cheng,T. C. Hu
#t1992
#cAlgorithmica
#index749888
#% 
#!
  
#*Minimum Dominating Sets of Intervals on Lines.
#@Siu-Wing Cheng,Michael Kaminski,Shmuel Zaks
#t1998
#cAlgorithmica
#index749889
#% 
#!
  
#*Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts.
#@Jae-Sook Cheong,Herman J. Haverkort,A. Frank van der Stappen
#t2006
#cAlgorithmica
#index749890
#% 
#!
  
#*Augmenting Trees to Meet Biconnectivity and Diameter Constraints.
#@Victor Chepoi,Yann Vaxès
#t2002
#cAlgorithmica
#index749891
#% 
#!
  
#*On Rooted Node-Connectivity Problems.
#@Joseph Cheriyan,Tibor Jordán,Zeev Nutov
#t2001
#cAlgorithmica
#index749892
#% 
#!
  
#*Algorithms for Dense Graphs and Networks on the Random Access Computer.
#@Joseph Cheriyan,Kurt Mehlhorn
#t1996
#cAlgorithmica
#index749893
#% 
#!
  
#*Hardness and Approximation Results for Packing Steiner Trees.
#@Joseph Cheriyan,Mohammad R. Salavatipour
#t2006
#cAlgorithmica
#index749894
#% 
#!
  
#*On Implementing the Push-Relabel Method for the Maximum Flow Problem.
#@Boris V. Cherkassky,Andrew V. Goldberg
#t1997
#cAlgorithmica
#index749895
#% 
#!
  
#*Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1).
#@Hua-Huai Chern,Hsien-Kuei Hwang
#t2001
#cAlgorithmica
#index749896
#% 
#!
  
#*Constrained Delaunay Triangulations.
#@L. Paul Chew
#t1989
#cAlgorithmica
#index749897
#% 
#!
  
#*Sorting Helps for Voronoi Diagrams.
#@L. Paul Chew,Steven Fortune
#t1997
#cAlgorithmica
#index749898
#% 
#!
  
#*Finding the Consensus Shape for a Protein Family.
#@L. Paul Chew,Klara Kedem
#t2003
#cAlgorithmica
#index749899
#% 
#!
  
#*New Approximation Results for the Maximum Scatter TSP.
#@Yi-Jen Chiang
#t2005
#cAlgorithmica
#index749900
#% 
#!
  
#*Locality-Preserving Hash Functions for General Purpose Parallel Computation.
#@A. Chin
#t1994
#cAlgorithmica
#index749901
#% 
#!
  
#*Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
#@Francis Y. L. Chin,Stanley P. Y. Fung
#t2003
#cAlgorithmica
#index749902
#% 
#!
  
#*Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences.
#@Francis Y. L. Chin,Chung Keung Poon
#t1994
#cAlgorithmica
#index749903
#% 
#!
  
#*An Improved Algorithm for Finding the Median Distributively.
#@Francis Y. L. Chin,H. F. Ting
#t1987
#cAlgorithmica
#index749904
#% 
#!
  
#*O(log log n)-Time Integer Geometry on the CRCW PRAM.
#@Bogdan S. Chlebus,Krzysztof Diks,Miroslaw Kowaluk
#t1995
#cAlgorithmica
#index749905
#% 
#!
  
#*Lopsided Trees, I: Analyses.
#@Vicky Siu-Ngan Choi,Mordecai J. Golin
#t2001
#cAlgorithmica
#index749906
#% 
#!
  
#*Data Transfers in Networks.
#@Hyeong-Ah Choi,S. Louis Hakimi
#t1988
#cAlgorithmica
#index749907
#% 
#!
  
#*Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon.
#@Seung-Hak Choi,Sung Yong Shin,Kyung-Yong Chwa
#t1995
#cAlgorithmica
#index749908
#% 
#!
  
#*Approximating Biconnectivity in Parallel.
#@Ka Wong Chong,Tak Wah Lam
#t1998
#cAlgorithmica
#index749909
#% 
#!
  
#*An Improved Parallel Algorithm for Integer GCD.
#@Benny Chor,Oded Goldreich
#t1990
#cAlgorithmica
#index749910
#% 
#!
  
#*An Evaluation of Buffer Management Strategies for Relational Database Systems.
#@Hong-Tai Chou,David J. DeWitt
#t1986
#cAlgorithmica
#index749911
#%1118209
#%642028
#%598167
#%1073706
#%1127945
#%1118323
#%1118497
#%643637
#%1118645
#%1118673
#%1118695
#%776344
#%1118696
#!
  
#*An Algorithm for Constructing Gröbner Bases from Characteristic Sets and Its Application to Geometry.
#@Shang-Ching Chou,William F. Schelter,Jin-Gen Yang
#t1990
#cAlgorithmica
#index749912
#% 
#!
  
#*A Linear-Time Algorithm for Constructing a Circular Visibility Diagram.
#@Shuo-Yan Chou,R. C. Woo
#t1995
#cAlgorithmica
#index749913
#% 
#!
  
#*On the Algebraic Formulation of Certain Geometry Statements and Mechanical Geometry Theorem Proving.
#@Shang-Ching Chou,Jin-Gen Yang
#t1989
#cAlgorithmica
#index749914
#% 
#!
  
#*Efficiently Extendible Mappings for Balanced Data Distribution.
#@David M. Choy,Ronald Fagin,Larry J. Stockmeyer
#t1996
#cAlgorithmica
#index749915
#% 
#!
  
#*Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.
#@Thomas Christof,Gerhard Reinelt
#t2001
#cAlgorithmica
#index749916
#% 
#!
  
#*An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph.
#@Marek Chrobak,Joseph Naor
#t1991
#cAlgorithmica
#index749917
#% 
#!
  
#*LRU Is Better than FIFO.
#@Marek Chrobak,John Noga
#t1999
#cAlgorithmica
#index749918
#%971582
#%776121
#%210620
#%621990
#%610778
#!
  
#*Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve.
#@Jinhee Chun,Kunihiko Sadakane,Takeshi Tokuyama
#t2006
#cAlgorithmica
#index749919
#% 
#!
  
#*A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.
#@Vijaya Chung
#t2003
#cAlgorithmica
#index749920
#% 
#!
  
#*Editor's Foreword: Special Issue on Algorithmic Aspects of Communications.
#@Israel Cidon,Inder S. Gopal
#t1989
#cAlgorithmica
#index749921
#% 
#!
  
#*Dynamic Detection of Subgraphs in Computer Networks.
#@Israel Cidon,Inder S. Gopal
#t1990
#cAlgorithmica
#index749922
#% 
#!
  
#*An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time.
#@Kenneth L. Clarkson
#t1989
#cAlgorithmica
#index749923
#% 
#!
  
#*Dynamical Sources in Information Theory: A General Analysis of Trie Structures.
#@Julien Clément,Philippe Flajolet,Brigitte Vallée
#t2001
#cAlgorithmica
#index749924
#% 
#!
  
#*The Minimum Range Assignment Problem on Linear Radio Networks.
#@Andrea E. F. Clementi,Paolo Penna,Afonso Ferreira,Stephane Perennes,Riccardo Silvestri
#t2003
#cAlgorithmica
#index749925
#% 
#!
  
#*Improved Computation of Plane Steiner Minimal Trees.
#@Ernest J. Cockayne,Denton E. Hewgill
#t1992
#cAlgorithmica
#index749926
#% 
#!
  
#*The Role of Arithmetic in Fast Parallel Matrix Inversion.
#@Bruno Codenotti,Mauro Leoncini,Franco P. Preparata
#t2001
#cAlgorithmica
#index749927
#% 
#!
  
#*Packing Random Intervals On-Line.
#@Edward G. Coffman Jr.,Leopold Flatto,Predrag R. Jelenkovic,Bjorn Poonen
#t1998
#cAlgorithmica
#index749928
#% 
#!
  
#*Bandwidth Packing.
#@Edward G. Coffman Jr.,Alexander L. Stolyar
#t2001
#cAlgorithmica
#index749929
#% 
#!
  
#*Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms.
#@Edward G. Coffman Jr.,Peter W. Shor
#t1993
#cAlgorithmica
#index749930
#% 
#!
  
#*Permutation Routing on Reconfigurable Meshes.
#@J. C. Cogolludo,Sanguthevar Rajasekaran
#t2001
#cAlgorithmica
#index749931
#% 
#!
  
#*Three-Dimensional Graph Drawing.
#@Robert F. Cohen,Peter Eades,Tao Lin,Frank Ruskey
#t1997
#cAlgorithmica
#index749932
#% 
#!
  
#*Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach.
#@Edith Cohen,Haim Kaplan
#t2002
#cAlgorithmica
#index749933
#% 
#!
  
#*Exploiting Regularities in Web Traffic Patterns for Cache Replacement.
#@Edith Cohen,Haim Kaplan
#t2002
#cAlgorithmica
#index749934
#% 
#!
  
#*Competitive Analysis of the LRFU Paging Algorithm.
#@Edith Cohen,Haim Kaplan,Uri Zwick
#t2002
#cAlgorithmica
#index749935
#%3005125
#%636728
#%610282
#%622343
#%597301
#%611379
#!
  
#*Algorithms and Complexity Analysis for Some Flow Problems.
#@Edith Cohen,Nimrod Megiddo
#t1994
#cAlgorithmica
#index749936
#% 
#!
  
#*Efficient Convexity and Domination Algorithms for Fine-and Medium-Grain Hypercube Computers.
#@Ed Cohen,Russ Miller,Elias M. Sarraf,Quentin F. Stout
#t1992
#cAlgorithmica
#index749937
#% 
#!
  
#*Dynamic Expression Trees.
#@Robert F. Cohen,Roberto Tamassia
#t1995
#cAlgorithmica
#index749938
#% 
#!
  
#*Combine and Conquer.
#@Robert F. Cohen,Roberto Tamassia
#t1997
#cAlgorithmica
#index749939
#% 
#!
  
#*A Note on Bounding k-Terminal Reliability.
#@Charles J. Colbourn
#t1992
#cAlgorithmica
#index749940
#% 
#!
  
#*Optimal Parallel Algorithms for Point-Set and Polygon Problems.
#@Richard Cole,Michael T. Goodrich
#t1992
#cAlgorithmica
#index749941
#% 
#!
  
#*A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm.
#@Richard Cole,Michael T. Goodrich,Colm Ó'Dúnlaing
#t1996
#cAlgorithmica
#index749942
#% 
#!
  
#*The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time.
#@Richard Cole,Uzi Vishkin
#t1988
#cAlgorithmica
#index749943
#% 
#!
  
#*Upper and Lower Bounds for Selection in the Mesh.
#@Anne Condon,Lata Narayanan
#t1998
#cAlgorithmica
#index749944
#% 
#!
  
#*Discrete Logarithms in GF(p).
#@Don Coppersmith,Andrew M. Odlyzko,Richard Schroeppel
#t1986
#cAlgorithmica
#index749945
#% 
#!
  
#*Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI.
#@Thomas H. Cormen,James C. Clippinger
#t1999
#cAlgorithmica
#index749946
#% 
#!
  
#*Analysis of the SSAP Method for the Numerical Valuation of High-Dimensional Multivariate American Securities.
#@L. N. Coyle,J. J. Yang
#t1999
#cAlgorithmica
#index749947
#% 
#!
  
#*A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory.
#@Andreas Crauser,Paolo Ferragina
#t2002
#cAlgorithmica
#index749948
#% 
#!
  
#*Speeding Up Two String-Matching Algorithms.
#@Maxime Crochemore,Artur Czumaj,Leszek Gasieniec,Stefan Jarominek,Thierry Lecroq,Wojciech Plandowski,Wojciech Rytter
#t1994
#cAlgorithmica
#index749949
#% 
#!
  
#*Two-Dimensional Prefix String Matching and Covering on Square Matrices.
#@Maxime Crochemore,Costas S. Iliopoulos,Maureen Korda
#t1998
#cAlgorithmica
#index749950
#% 
#!
  
#*Sqares, Cubes, and Time-Space Efficient String Searching.
#@Maxime Crochemore,Wojciech Rytter
#t1995
#cAlgorithmica
#index749951
#% 
#!
  
#*Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.
#@Mary Cryan,Leslie Ann Goldberg,Cynthia A. Phillips
#t1999
#cAlgorithmica
#index749952
#% 
#!
  
#*Bounded Space On-Line Bin Packing: Best Is Better than First.
#@János Csirik,David S. Johnson
#t2001
#cAlgorithmica
#index749953
#% 
#!
  
#*Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.
#@Joseph C. Culberson,J. Ian Munro
#t1990
#cAlgorithmica
#index749954
#% 
#!
  
#*Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles.
#@Paul Czerwinski,Vijaya Ramachandran
#t1988
#cAlgorithmica
#index749955
#% 
#!
  
#*Fast Generation of Random Permutations Via Networks Simulation.
#@Artur Czumaj,Przemyslawa Kanarek,Miroslaw Kutylowski,Krzysztof Lorys
#t1998
#cAlgorithmica
#index749956
#% 
#!
  
#*New Results on Path Approximation.
#@Ovidiu Daescu
#t2003
#cAlgorithmica
#index749957
#% 
#!
  
#*Multiple Spin-Block Decisions.
#@Peter Damaschke
#t2006
#cAlgorithmica
#index749958
#% 
#!
  
#*Computing Optimal Diameter-Bounded Polygon Partitions.
#@Mirela Damian,Sriram V. Pemmaraju
#t2004
#cAlgorithmica
#index749959
#% 
#!
  
#*Multiple Translational Containment. Part I: An Approximate Algorithm.
#@Karen L. Daniels,Victor Milenkovic
#t1997
#cAlgorithmica
#index749960
#% 
#!
  
#*On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.
#@Bhaskar DasGupta,Xin He,Tao Jiang,Ming Li,John Tromp
#t1999
#cAlgorithmica
#index749961
#% 
#!
  
#*On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
#@Gautam Das,Sanjiv Kapoor,Michiel H. M. Smid
#t1997
#cAlgorithmica
#index749962
#% 
#!
  
#*Reconstructing a Minimum Spanning Tree after Deletion of Any Node.
#@B. Das,Michael C. Loui
#t2001
#cAlgorithmica
#index749963
#% 
#!
  
#*Editor's Foreword Special Issue on Parallel Algorithms for Geometric Problems on Digitzed Pictures.
#@Frank K. H. A. Dehne
#t1991
#cAlgorithmica
#index749964
#% 
#!
  
#*Guest Editor's Introduction
#@Frank K. H. A. Dehne
#t1999
#cAlgorithmica
#index749965
#% 
#!
  
#*Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms.
#@Frank K. H. A. Dehne,Wolfgang Dittrich,David A. Hutchinson
#t2003
#cAlgorithmica
#index749966
#% 
#!
  
#*Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.
#@Frank K. H. A. Dehne,Afonso Ferreira,Edson Cáceres,Siang W. Song,Alessandro Roncato
#t2002
#cAlgorithmica
#index749967
#% 
#!
  
#*Computational Geometry Algorithms for the Systolic Screen.
#@Frank K. H. A. Dehne,Anne-Lise Hassenklover,Jörg-Rüdiger Sack,Nicola Santoro
#t1991
#cAlgorithmica
#index749968
#% 
#!
  
#*"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams.
#@Frank K. H. A. Dehne,Rolf Klein
#t1997
#cAlgorithmica
#index749969
#% 
#!
  
#*Diameter and Treewidth in Minor-Closed Graph Families, Revisited.
#@Erik D. Demaine,Mohammad Taghi Hajiaghayi
#t2004
#cAlgorithmica
#index749970
#% 
#!
  
#*Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.
#@Erik D. Demaine,Mohammad Taghi Hajiaghayi,Dimitrios M. Thilikos
#t2005
#cAlgorithmica
#index749971
#% 
#!
  
#*Geometric Restrictions on Producible Polygonal Protein Chains.
#@Erik D. Demaine,Stefan Langerman,Joseph O'Rourke
#t2006
#cAlgorithmica
#index749972
#% 
#!
  
#*Minimizing Mean Completion Time in a Batch Processing System.
#@Xiaotie Deng,Haodi Feng,Pixing Zhang,Yuzhong Zhang,Hong Zhu
#t2004
#cAlgorithmica
#index749973
#% 
#!
  
#*Competitive Implementation of Parallel Programs.
#@Xiaotie Deng,Elias Koutsoupias,Philip D. MacKenzie
#t1999
#cAlgorithmica
#index749974
#% 
#!
  
#*Competitive Distributed Decision-Making.
#@Xiaotie Deng,Christos H. Papadimitriou
#t1996
#cAlgorithmica
#index749975
#% 
#!
  
#*A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.
#@Xiaotie Deng,Binhai Zhu
#t1999
#cAlgorithmica
#index749976
#% 
#!
  
#*Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.
#@Anders Dessmark,Andrzej Lingas,Andrzej Proskurowski
#t2000
#cAlgorithmica
#index749977
#% 
#!
  
#*On the Probablistic Worst-Case Time of ``Find''.
#@Luc Devroye
#t2001
#cAlgorithmica
#index749978
#% 
#!
  
#*Universal Asymptotics for Random Tries and PATRICIA Trees.
#@Luc Devroye
#t2005
#cAlgorithmica
#index749979
#% 
#!
  
#*A Note on the Expected Time for Finding Maxima by List Algorithms.
#@Luc Devroye
#t1999
#cAlgorithmica
#index749980
#% 
#!
  
#*A Note on Point Location in Delaunay Triangulations of Random Points.
#@Luc Devroye,Ernst P. Mücke,Binhai Zhu
#t1998
#cAlgorithmica
#index749981
#% 
#!
  
#*Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee.
#@Tamal K. Dey,Wulue Zhao
#t2003
#cAlgorithmica
#index749982
#% 
#!
  
#*Lower Bounds for Set Intersection Queries.
#@Paul F. Dietz,Kurt Mehlhorn,Rajeev Raman,Christian Uhrig
#t1995
#cAlgorithmica
#index749983
#% 
#!
  
#*Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes.
#@Krzysztof Diks,Andrzej Pelc
#t2000
#cAlgorithmica
#index749984
#% 
#!
  
#*Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees.
#@Michael B. Dillencourt,Hanan Samet
#t1996
#cAlgorithmica
#index749985
#% 
#!
  
#*Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.
#@Yefim Dinitz,Jeffery Westbrook
#t1998
#cAlgorithmica
#index749986
#% 
#!
  
#*Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time.
#@Brandon Dixon,Robert Endre Tarjan
#t1997
#cAlgorithmica
#index749987
#% 
#!
  
#*Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications.
#@Hristo Djidjev
#t2000
#cAlgorithmica
#index749988
#% 
#!
  
#*Separators in Graphs with Negative and Multiple Vertex Weights.
#@Hristo Djidjev,John R. Gilbert
#t1999
#cAlgorithmica
#index749989
#% 
#!
  
#*Improved Algorithms for Dynamic Shortest Paths.
#@Hristo Djidjev,Grammati E. Pantziou,Christos D. Zaroliagis
#t2000
#cAlgorithmica
#index749990
#% 
#!
  
#*Searching for Empty Convex Polygons.
#@David P. Dobkin,Herbert Edelsbrunner,Mark H. Overmars
#t1990
#cAlgorithmica
#index749991
#% 
#!
  
#*An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon.
#@David P. Dobkin,Leonidas J. Guibas,John Hershberger,Jack Snoeyink
#t1993
#cAlgorithmica
#index749992
#% 
#!
  
#*Computing the Intersection-Depth of Polyhedra.
#@David P. Dobkin,John Hershberger,David G. Kirkpatrick,Subhash Suri
#t1993
#cAlgorithmica
#index749993
#% 
#!
  
#*Primitives for the Manipulation of Three-Dimensional Subdivisions.
#@David P. Dobkin,Michael J. Laszlo
#t1989
#cAlgorithmica
#index749994
#% 
#!
  
#*Computational Geometry in a Curved World.
#@David P. Dobkin,Diane L. Souvaine
#t1990
#cAlgorithmica
#index749995
#% 
#!
  
#*Decomposition and Intersection of Simple Splinegons.
#@David P. Dobkin,Diane L. Souvaine,Christopher J. Van Wyk
#t1988
#cAlgorithmica
#index749996
#% 
#!
  
#*Wait-Free Clock Synchronization.
#@Shlomi Dolev,Jennifer L. Welch
#t1997
#cAlgorithmica
#index749997
#% 
#!
  
#*Error Compensation in Leaf Power Problems.
#@Michael Dom,Jiong Guo,Falk Hüffner,Rolf Niedermeier
#t2006
#cAlgorithmica
#index749998
#% 
#!
  
#*The Complexity of Planar Compliant Motion Planning Under Uncertainty.
#@Bruce Randall Donald
#t1990
#cAlgorithmica
#index749999
#% 
#!
  
#*Special Issue on Computational Robotics: The Geometric Theory of Manipulation, Planning, and Control.
#@Bruce Randall Donald
#t1993
#cAlgorithmica
#index750000
#% 
#!
  
#*Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds.
#@Bruce Randall Donald,Patrick G. Xavier
#t1995
#cAlgorithmica
#index750001
#% 
#!
  
#*Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators.
#@Bruce Randall Donald,Patrick G. Xavier
#t1995
#cAlgorithmica
#index750002
#% 
#!
  
#*An Analytic Approach to the Height of Binary Search Trees.
#@Michael Drmota
#t2001
#cAlgorithmica
#index750003
#% 
#!
  
#*The Asymptotic Number of Leftist Trees.
#@Michael Drmota
#t2001
#cAlgorithmica
#index750004
#% 
#!
  
#*A Unified Presentation of Some Urn Models.
#@Michael Drmota,Danièle Gardy,Bernhard Gittenberger
#t2001
#cAlgorithmica
#index750005
#% 
#!
  
#*Discrete Simulation of NC Machining.
#@Robert L. (Scot) Drysdale III,Robert B. Jerard,Barry Schaudt,Ken Hauck
#t1989
#cAlgorithmica
#index750006
#% 
#!
  
#*Sparse Normalized Local Alignment.
#@Nadav Efraty,Gad M. Landau
#t2005
#cAlgorithmica
#index750007
#% 
#!
  
#*An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.
#@Vida Dujmovic,Sue Whitesides
#t2004
#cAlgorithmica
#index750008
#% 
#!
  
#*Inapproximability Results for Guarding Polygons and Terrains.
#@Stephan Eidenbenz,Christoph Stamm,Peter Widmayer
#t2001
#cAlgorithmica
#index750009
#% 
#!
  
#*Optimal Two-Description Scalar Quantizer Design.
#@Sorina Dumitrescu,Xiaolin Wu
#t2005
#cAlgorithmica
#index750010
#% 
#!
  
#*Optimal Search and One-Way Trading Online Algorithms.
#@Ran El-Yaniv,Amos Fiat,Richard M. Karp,G. Turpin
#t2001
#cAlgorithmica
#index750011
#% 
#!
  
#*A Minimum-Area Circuit for l-Selection.
#@Pavol Duris,Ondrej Sýkora,Clark D. Thompson,Imrich Vrto
#t1987
#cAlgorithmica
#index750012
#% 
#!
  
#*Competitive Optimal On-Line Leasing.
#@Ran El-Yaniv,R. Kaniel,Nathan Linial
#t1999
#cAlgorithmica
#index750013
#% 
#!
  
#*A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations.
#@Rex A. Dwyer
#t1987
#cAlgorithmica
#index750014
#% 
#!
  
#*Efficient Perturbations for Handling Geometric Degeneracies.
#@Ioannis Z. Emiris,John F. Canny,Raimund Seidel
#t1997
#cAlgorithmica
#index750015
#% 
#!
  
#*The Relative Complexity of Approximate Counting Problems.
#@Martin E. Dyer,Leslie Ann Goldberg,Catherine S. Greenhill,Mark Jerrum
#t2003
#cAlgorithmica
#index750016
#% 
#!
  
#*Computer Algebra Methods for Studying and Computing Molecular Conformations.
#@Ioannis Z. Emiris,Bernard Mourrain
#t1999
#cAlgorithmica
#index750017
#% 
#!
  
#*Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
#@Peter Eades,Qing-Wen Feng,Xuemin Lin,Hiroshi Nagamochi
#t2006
#cAlgorithmica
#index750018
#% 
#!
  
#*An Explicit Lower Bound for TSP with Distances One and Two.
#@Lars Engebretsen
#t2003
#cAlgorithmica
#index750019
#% 
#!
  
#*Edge Crossings in Drawings of Bipartite Graphs.
#@Peter Eades,Nicholas C. Wormald
#t1994
#cAlgorithmica
#index750020
#% 
#!
  
#*Diameter and Treewidth in Minor-Closed Graph Families.
#@David Eppstein
#t2000
#cAlgorithmica
#index750021
#% 
#!
  
#*The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard.
#@Peter Eades,Sue Whitesides
#t1996
#cAlgorithmica
#index750022
#% 
#!
  
#*Multicast Pull Scheduling: When Fairness Is Fine.
#@Jeff Edmonds,Kirk Pruhs
#t2003
#cAlgorithmica
#index750023
#% 
#!
  
#*Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees.
#@Xin He,Yaacov Yesha
#t1990
#cAlgorithmica
#index750024
#% 
#!
  
#*Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.
#@K. S. Easwarakumar,S. V. Krishnan,C. Pandu Rangan,S. Seshadri
#t1996
#cAlgorithmica
#index750025
#% 
#!
  
#*Covering with Ellipses.
#@Alon Efrat,Frank Hoffmann,Christian Knauer,Klaus Kriegel,Günter Rote,Carola Wenk
#t2003
#cAlgorithmica
#index750026
#% 
#!
  
#*Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic.
#@Zhenyu Li,Victor Milenkovic
#t1992
#cAlgorithmica
#index750027
#% 
#!
  
#*The Geometric Dilation of Finite Point Sets.
#@Annette Ebbers-Baumann,Ansgar Grüne,Rolf Klein
#t2006
#cAlgorithmica
#index750028
#% 
#!
  
#*Asymptotic Speed-Ups in Constructive Solid Geometry.
#@David Eppstein
#t1995
#cAlgorithmica
#index750029
#% 
#!
  
#*Polygonal Representations of Digital Sets.
#@Ulrich Eckhardt,Helene Reiter
#t2003
#cAlgorithmica
#index750030
#% 
#!
  
#*Algorithms for Coloring Quadtrees.
#@David Eppstein,Marshall W. Bern,Brad L. Hutchings
#t2002
#cAlgorithmica
#index750031
#% 
#!
  
#*Equispreading Tree in Manhattan Distance.
#@Masato Edahiro
#t1996
#cAlgorithmica
#index750032
#% 
#!
  
#*A Workbench for Computational Geometry.
#@Peter Epstein,J. Kavanagh,A. Knight,J. May,T. Nguyen,Jörg-Rüdiger Sack
#t1994
#cAlgorithmica
#index750033
#% 
#!
  
#*A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency.
#@Masato Edahiro,Katsuhiko Tanaka,Takashi Hoshino,Takao Asano
#t1989
#cAlgorithmica
#index750034
#% 
#!
  
#*Geometry Helps in Bottleneck Matching and Related Problems.
#@Alon Efrat,Alon Itai,Matthew J. Katz
#t2001
#cAlgorithmica
#index750035
#% 
#!
  
#*Computing the Cover Array in Linear Time.
#@Yin Li,William F. Smyth
#t2002
#cAlgorithmica
#index750036
#% 
#!
  
#*Edge-Skeletons in Arrangements with Applications.
#@Herbert Edelsbrunner
#t1986
#cAlgorithmica
#index750037
#% 
#!
  
#*Pattern Matching for Sets of Segments.
#@Alon Efrat,Piotr Indyk,Suresh Venkatasubramanian
#t2004
#cAlgorithmica
#index750038
#% 
#!
  
#*Delay Optimization in Quorum Consensus.
#@Xuemin Lin
#t2003
#cAlgorithmica
#index750039
#% 
#!
  
#*Incremental Topological Flipping Works for Regular Triangulations.
#@Herbert Edelsbrunner,Nimish R. Shah
#t1996
#cAlgorithmica
#index750040
#% 
#!
  
#*Robust Distance-Based Clustering with Applications to Spatial Data Mining.
#@Vladimir Estivill-Castro,Michael E. Houle
#t2001
#cAlgorithmica
#index750041
#% 
#!
  
#*Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
#@Leah Epstein,Jiri Sgall
#t2004
#cAlgorithmica
#index750042
#% 
#!
  
#*Randomization for Robot Tasks: Using Dynamic Programming in the Space of Knowledge States.
#@Michael Erdmann
#t1993
#cAlgorithmica
#index750043
#% 
#!
  
#*On Multiple Moving Objects.
#@Michael Erdmann,Tomás Lozano-Pérez
#t1987
#cAlgorithmica
#index750044
#% 
#!
  
#*Mechanical Parts Orienting: The Case of a Polyhedron on a Table.
#@Michael Erdmann,Matthew T. Mason,George Vanecek Jr.
#t1993
#cAlgorithmica
#index750045
#% 
#!
  
#*Routing Flow Through a Strongly Connected Graph.
#@Thomas Erlebach,Torben Hagerup
#t2002
#cAlgorithmica
#index750046
#% 
#!
  
#*Wavelength Conversion in All-Optical Networks with Shortest-Path Routing.
#@Thomas Erlebach,Stamatis Stefanakos
#t2005
#cAlgorithmica
#index750047
#% 
#!
  
#*Orienting Polygonal Parts Without Sensors.
#@Kenneth Y. Goldberg
#t1993
#cAlgorithmica
#index750048
#% 
#!
  
#*Right-Triangulated Irregular Networks.
#@William S. Evans,David G. Kirkpatrick,G. Townsend
#t2001
#cAlgorithmica
#index750049
#% 
#!
  
#*Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem.
#@Donald Goldfarb,Jianxiu Hao
#t1992
#cAlgorithmica
#index750050
#% 
#!
  
#*Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.
#@Guy Even,Joseph Naor,Baruch Schieber,Madhu Sudan
#t1998
#cAlgorithmica
#index750051
#% 
#!
  
#*Can PAC Learning Algorithms Tolerate Random Attribute Noise?
#@Sally A. Goldman,Robert H. Sloan
#t1995
#cAlgorithmica
#index750052
#% 
#!
  
#*A Robust Model for Finding Optimal Evolutionary Trees.
#@Martin Farach,Sampath Kannan,Tandy Warnow
#t1995
#cAlgorithmica
#index750053
#% 
#!
  
#*Property Testing in Bounded Degree Graphs.
#@Oded Goldreich,Dana Ron
#t2002
#cAlgorithmica
#index750054
#% 
#!
  
#*String Matching in Lempel-Ziv Compressed Strings.
#@Martin Farach,Mikkel Thorup
#t1998
#cAlgorithmica
#index750055
#% 
#!
  
#*A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm.
#@Mordecai J. Golin
#t1994
#cAlgorithmica
#index750056
#% 
#!
  
#*Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization.
#@Amir H. Farrahi,D. T. Lee,Majid Sarrafzadeh
#t1999
#cAlgorithmica
#index750057
#% 
#!
  
#*Data Migration on Parallel Disks: Algorithms and Evaluation.
#@Leana Golubchik,Samir Khuller,Yoo Ah Kim,Svetlana Shargorodskaya,Yung-Chun (Justin) Wan
#t2006
#cAlgorithmica
#index750058
#% 
#!
  
#*On-Line Edge-Coloring with a Fixed Number of Colors.
#@Lene M. Favrholdt,Morten N. Nielsen
#t2003
#cAlgorithmica
#index750059
#% 
#!
  
#*Uniquely Restricted Matchings.
#@Martin Charles Golumbic,Tirza Hirst,Moshe Lewenstein
#t2001
#cAlgorithmica
#index750060
#% 
#!
  
#*Network Flow and 2-Satisfiability.
#@Tomás Feder
#t1994
#cAlgorithmica
#index750061
#% 
#!
  
#*Search Directions for Interior Linear-Programming Methods.
#@Clovis C. Gonzaga
#t1991
#cAlgorithmica
#index750062
#% 
#!
  
#*Approximating Min Sum Set Cover.
#@Uriel Feige,László Lovász,Prasad Tetali
#t2004
#cAlgorithmica
#index750063
#% 
#!
  
#*Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems.
#@Teofilo F. Gonzalez
#t2000
#cAlgorithmica
#index750064
#% 
#!
  
#*The Dense -Subgraph Problem.
#@Uriel Feige,David Peleg,Guy Kortsarz
#t2001
#cAlgorithmica
#index750065
#% 
#!
  
#*A Polynomial Newton Method for Linear Programming.
#@Guy de Ghellinck,Jean-Philippe Vial
#t1986
#cAlgorithmica
#index750066
#% 
#!
  
#*Line-Segment Intersection Reporting in Parallel.
#@Christine Rüb
#t1992
#cAlgorithmica
#index750067
#% 
#!
  
#*Testing and Spot-Checking of Data Streams.
#@Joan Feigenbaum,Sampath Kannan,Martin Strauss,Mahesh Viswanathan
#t2002
#cAlgorithmica
#index750068
#% 
#!
  
#*Decremental 2- and 3-Connectivity on Planar Graphs.
#@Dora Giammarresi,Giuseppe F. Italiano
#t1996
#cAlgorithmica
#index750069
#% 
#!
  
#*Computing Diameter in the Streaming and Sliding-Window Models.
#@Joan Feigenbaum,Sampath Kannan,Jian Zhang
#t2004
#cAlgorithmica
#index750070
#% 
#!
  
#*Simple Algorithms for Multimessage Multicasting with Forwarding.
#@Teofilo F. Gonzalez
#t2001
#cAlgorithmica
#index750071
#% 
#!
  
#*Maximum Dispersion and Geometric Maximum Weight Cliques.
#@Sándor P. Fekete,Henk Meijer
#t2003
#cAlgorithmica
#index750072
#% 
#!
  
#*Approximation Algorithms for Partitioning a Rectangle with Interior Points.
#@Teofilo F. Gonzalez,Si-Qing Zheng
#t1990
#cAlgorithmica
#index750073
#% 
#!
  
#*On Finding Optimal and Near-Optimal Lineal Spanning Trees.
#@Michael R. Fellows,Donald K. Friesen,Michael A. Langston
#t1988
#cAlgorithmica
#index750074
#% 
#!
  
#*Guest Editor's Foreword.
#@Michael T. Goodrich
#t2002
#cAlgorithmica
#index750075
#% 
#!
  
#*The Complexity of Induced Minors and Related Problems.
#@Michael R. Fellows,Jan Kratochvíl,Martin Middendorf,Frank Pfeiffer
#t1995
#cAlgorithmica
#index750076
#% 
#!
  
#*From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction.
#@Robert Giegerich,Stefan Kurtz
#t1997
#cAlgorithmica
#index750077
#% 
#!
  
#*Coordinated Manipulation of Objects in a Plane.
#@Daniela Rus
#t1997
#cAlgorithmica
#index750078
#% 
#!
  
#*On Nonlinear Parametric Search.
#@David Fernández-Baca
#t2001
#cAlgorithmica
#index750079
#% 
#!
  
#*Secrecy, Computational Loads and Rates in Practical Quantum Cryptography.
#@Gerald Gilbert,Michael Hamrick
#t2002
#cAlgorithmica
#index750080
#% 
#!
  
#*A 3-Party Simultaneous Protocol for SUM-INDEX.
#@Xiaoming Sun
#t2003
#cAlgorithmica
#index750081
#% 
#!
  
#*On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities.
#@David Fernández-Baca,Charles U. Martel
#t1989
#cAlgorithmica
#index750082
#% 
#!
  
#*Sweep Methods for Parallel Computational Geometry.
#@Michael T. Goodrich,Mujtaba R. Ghouse,J. Bright
#t1996
#cAlgorithmica
#index750083
#% 
#!
  
#*String Search in Coarse-Grained Parallel Computers.
#@Paolo Ferragina,Fabrizio Luccio
#t1999
#cAlgorithmica
#index750084
#% 
#!
  
#*Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.
#@Michael T. Goodrich,Colm Ó'Dúnlaing,Chee-Keng Yap
#t1993
#cAlgorithmica
#index750085
#% 
#!
  
#*An Edit Distance between Quotiented Trees.
#@Pascal Ferraro,Christophe Godin
#t2003
#cAlgorithmica
#index750086
#% 
#!
  
#*Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons.
#@Michael T. Goodrich,Steven B. Shauck,Sumanta Guha
#t1992
#cAlgorithmica
#index750087
#% 
#!
  
#*-Dimensional Range Search on Multicomputers.
#@Afonso Ferreira,Claire Kenyon,Andrew Rau-Chaplin,Stéphane Ubéda
#t1999
#cAlgorithmica
#index750088
#% 
#!
  
#*An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons.
#@Michael T. Goodrich,Steven B. Shauck,Sumanta Guha
#t1993
#cAlgorithmica
#index750089
#% 
#!
  
#*On-Line Multi-Threaded Paging.
#@Esteban Feuerstein,Alejandro Strejilevich de Loma
#t2002
#cAlgorithmica
#index750090
#% 
#!
  
#*Parallel Sorting on Cayley Graphs.
#@Daniel M. Gordon
#t1991
#cAlgorithmica
#index750091
#% 
#!
  
#*A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.
#@Amos Fiat,Yuval Rabani,Yiftach Ravid,Baruch Schieber
#t1994
#cAlgorithmica
#index750092
#% 
#!
  
#*On Coloring Unit Disk Graphs.
#@A. Gräf,M. Stumpf,Gerhard Weißenfels
#t1998
#cAlgorithmica
#index750093
#% 
#!
  
#*Simulations Among Concurrent-Write PRAMs.
#@Faith E. Fich,Prabhakar Ragde,Avi Wigderson
#t1988
#cAlgorithmica
#index750094
#% 
#!
  
#*Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.
#@Jens Gramm,Jiong Guo,Falk Hüffner,Rolf Niedermeier
#t2004
#cAlgorithmica
#index750095
#% 
#!
  
#*Computational Approaches to Drug Design.
#@Paul W. Finn,Lydia E. Kavraki
#t1999
#cAlgorithmica
#index750096
#% 
#!
  
#*Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.
#@Jens Gramm,Rolf Niedermeier,Peter Rossmanith
#t2003
#cAlgorithmica
#index750097
#% 
#!
  
#*An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
#@Irene Finocchi,Alessandro Panconesi,Riccardo Silvestri
#t2004
#cAlgorithmica
#index750098
#% 
#!
  
#*Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines.
#@Frieda Granot,Jadranka Skorin-Kapov,Amir Tamir
#t1997
#cAlgorithmica
#index750099
#% 
#!
  
#*Pinwheel Scheduling: Achievable Densities.
#@Peter C. Fishburn,J. C. Lagarias
#t2002
#cAlgorithmica
#index750100
#% 
#!
  
#*Optimal Reconstruction of Graphs under the Additive Model.
#@Vladimir Grebinski,Gregory Kucherov
#t2000
#cAlgorithmica
#index750101
#% 
#!
  
#*Analytic Variations on Quadtrees.
#@Philippe Flajolet,Gaston H. Gonnet,Claude Puech,J. M. Robson
#t1993
#cAlgorithmica
#index750102
#% 
#!
  
#*Fast Parallel Reordering and Isomorphism Testing of k-Trees.
#@John G. Del Greco,Chandra N. Sekharan,R. Sridhar
#t2002
#cAlgorithmica
#index750103
#% 
#!
  
#*Analytic Variations on the Airy Distribution.
#@Philippe Flajolet,Guy Louchard
#t2001
#cAlgorithmica
#index750104
#% 
#!
  
#*Minimizing Channel Density with Movable Terminals.
#@Ronald I. Greenberg,Jau-Der Shih
#t1997
#cAlgorithmica
#index750105
#% 
#!
  
#*On the Analysis of Linear Probing Hashing.
#@Philippe Flajolet,Patricio V. Poblete,Alfredo Viola
#t1998
#cAlgorithmica
#index750106
#% 
#!
  
#*Large Parallel Machines Can Be Extremely Slow for Small Problems.
#@Vince Grolmusz
#t1991
#cAlgorithmica
#index750107
#% 
#!
  
#*Interval Routing Schemes.
#@Michele Flammini,Giorgio Gambosi,Sandro Salomone
#t1996
#cAlgorithmica
#index750108
#% 
#!
  
#*Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions.
#@Vince Grolmusz
#t1999
#cAlgorithmica
#index750109
#% 
#!
  
#*A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort.
#@Rudolf Fleischer
#t1994
#cAlgorithmica
#index750110
#% 
#!
  
#*Approximation Algorithms for Connected Dominating Sets.
#@Sudipto Guha,Samir Khuller
#t1998
#cAlgorithmica
#index750111
#% 
#!
  
#*Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness.
#@Rudolf Fleischer,Hisashi Koga
#t2003
#cAlgorithmica
#index750112
#% 
#!
  
#*Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?
#@Nicolas Gisin,Renato Renner,Stefan Wolf
#t2002
#cAlgorithmica
#index750113
#% 
#!
  
#*Optimal Algorithms for Adjacent Side Routing.
#@S. Alice Wu,Joseph JáJá
#t1991
#cAlgorithmica
#index750114
#% 
#!
  
#*Simultaneous Inner and Outer Approximation of Shapes.
#@Rudolf Fleischer,Kurt Mehlhorn,Günter Rote,Emo Welzl,Chee-Keng Yap
#t1992
#cAlgorithmica
#index750115
#% 
#!
  
#*Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles.
#@S. Guha,I. Suzuki
#t1997
#cAlgorithmica
#index750116
#% 
#!
  
#*On Sorting Triangles in a Delaunay Tessellation.
#@Leila De Floriani,Bianca Falcidieno,George Nagy,Caterina Pienovi
#t1991
#cAlgorithmica
#index750117
#% 
#!
  
#*Reconstructing Curves without Delaunay Computation.
#@Sumanta Guha,Son Dinh Tran
#t2005
#cAlgorithmica
#index750118
#% 
#!
  
#*FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2].
#@Sally Floyd,Richard M. Karp
#t1991
#cAlgorithmica
#index750119
#% 
#!
  
#*Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.
#@Leonidas J. Guibas,John Hershberger,Daniel Leven,Micha Sharir,Robert Endre Tarjan
#t1987
#cAlgorithmica
#index750120
#% 
#!
  
#*Graph Searching, Elimination Trees, and a Generalization of Bandwidth.
#@Fedor V. Fomin,Pinar Heggernes,Jan Arne Telle
#t2004
#cAlgorithmica
#index750121
#% 
#!
  
#*Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
#@Leonidas J. Guibas,Donald E. Knuth,Micha Sharir
#t1992
#cAlgorithmica
#index750122
#% 
#!
  
#*Better Alternatives to OSPF Routing.
#@Jessica H. Fong,Anna C. Gilbert,Sampath Kannan,Martin J. Strauss
#t2005
#cAlgorithmica
#index750123
#% 
#!
  
#*Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives.
#@Leonidas J. Guibas,David Salesin,Jorge Stolfi
#t1993
#cAlgorithmica
#index750124
#% 
#!
  
#*Introduction.
#@Steven Fortune
#t2000
#cAlgorithmica
#index750125
#% 
#!
  
#*Linear-Time Algorithms for Partial -Tree Complements.
#@Arvind Gupta,Damon Kaller,Thomas C. Shermer
#t2000
#cAlgorithmica
#index750126
#% 
#!
  
#*A Sweepline Algorithm for Voronoi Diagrams.
#@Steven Fortune
#t1987
#cAlgorithmica
#index750127
#% 
#!
  
#*Finding Largest Subtrees and Smallest Supertrees.
#@Arvind Gupta,Naomi Nishimura
#t1998
#cAlgorithmica
#index750128
#% 
#!
  
#*On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.
#@Ulrich Fößmeier,Michael Kaufmann
#t2000
#cAlgorithmica
#index750129
#% 
#!
  
#*An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.
#@Neelima Gupta,Sandeep Sen
#t2001
#cAlgorithmica
#index750130
#% 
#!
  
#*Minimum Congestion Redundant Assignments to Tolerate Random Faults.
#@Dimitris Fotakis,Paul G. Spirakis
#t2002
#cAlgorithmica
#index750131
#% 
#!
  
#*Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses.
#@Venkatesan Guruswami
#t2003
#cAlgorithmica
#index750132
#% 
#!
  
#*Complexity Aspects of Guessing Prefix Codes.
#@Aviezri S. Fraenkel,Shmuel T. Klein
#t1994
#cAlgorithmica
#index750133
#% 
#!
  
#*Parametric Optimization of Sequence Alignment.
#@Dan Gusfield,K. Balasubramanian,Dalit Naor
#t1994
#cAlgorithmica
#index750134
#% 
#!
  
#*Interval Routing Schemes.
#@Pierre Fraigniaud,Cyril Gavoille
#t1998
#cAlgorithmica
#index750135
#% 
#!
  
#*Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk.
#@Ashish Goel,Deborah Estrin
#t2005
#cAlgorithmica
#index750136
#% 
#!
  
#*An Efficient Distributed Algorithm for Maximum Matching in General Graphs.
#@Michael M. Wu,Michael C. Loui
#t1990
#cAlgorithmica
#index750137
#% 
#!
  
#*Editor's Foreword Special Issue on Graph Algorithms.
#@Greg N. Frederickson
#t1992
#cAlgorithmica
#index750138
#% 
#!
  
#*Extending Greedy Multicast Routing to Delay Sensitive Applications.
#@Ashish Goel,Kamesh Munagala
#t2002
#cAlgorithmica
#index750139
#% 
#!
  
#*Path-Matching Problems.
#@Sun Wu,Udi Manber
#t1992
#cAlgorithmica
#index750140
#% 
#!
  
#*Searching Among Intervals and Compact Routing Tables.
#@Greg N. Frederickson
#t1996
#cAlgorithmica
#index750141
#% 
#!
  
#*Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs.
#@Ashish Goel,Adam Meyerson
#t2006
#cAlgorithmica
#index750142
#% 
#!
  
#*An O(n) Deterministic Gossiping Algorithm for Radio Networks.
#@Ying Xu
#t2003
#cAlgorithmica
#index750143
#% 
#!
  
#*Maintaining Regular Properties Dynamically in -Terminal Graphs.
#@Greg N. Frederickson
#t1998
#cAlgorithmica
#index750144
#% 
#!
  
#*A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks.
#@Yaron I. Gold,Shlomo Moran
#t1989
#cAlgorithmica
#index750145
#% 
#!
  
#*On Selecting the k Largest with Median Tests.
#@Andrew Chi-Chih Yao
#t1989
#cAlgorithmica
#index750146
#% 
#!
  
#*Designing Networks with Compact Routing Tables.
#@Greg N. Frederickson,Ravi Janardan
#t1988
#cAlgorithmica
#index750147
#% 
#!
  
#*Guest Editors' Foreword.
#@Dan Gusfield,Ming-Yang Kao
#t1999
#cAlgorithmica
#index750148
#% 
#!
  
#*The Pairing Heap: A New Form of Self-Adjusting Heap.
#@Michael L. Fredman,Robert Sedgewick,Daniel Dominic Sleator,Robert Endre Tarjan
#t1986
#cAlgorithmica
#index750149
#% 
#!
  
#*The Structure and Complexity of Sports Elimination Numbers.
#@Dan Gusfield,Charles U. Martel
#t2002
#cAlgorithmica
#index750150
#% 
#!
  
#*Computing Betti Numbers via Combinatiorial Laplacians.
#@J. Friedman
#t1998
#cAlgorithmica
#index750151
#% 
#!
  
#*A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.
#@Dan Gusfield,Charles U. Martel
#t1992
#cAlgorithmica
#index750152
#% 
#!
  
#*Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.
#@Alan M. Frieze,Mark Jerrum
#t1997
#cAlgorithmica
#index750153
#% 
#!
  
#*Extracting Maximal Information About Sets of Minimum Cuts.
#@Dan Gusfield,Dalit Naor
#t1993
#cAlgorithmica
#index750154
#% 
#!
  
#*Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal.
#@Alan M. Frieze,Wojciech Szpankowski
#t1998
#cAlgorithmica
#index750155
#% 
#!
  
#*A Bounded Approximation for the Minimum Cost 2-Sat Problem.
#@Dan Gusfield,Leonard Pitt
#t1992
#cAlgorithmica
#index750156
#% 
#!
  
#*Dynamically Switching Vertices in Planar Graphs.
#@Daniele Frigioni,Giuseppe F. Italiano
#t2000
#cAlgorithmica
#index750157
#% 
#!
  
#*A Faster Parametric Minimum-Cut Algorithm.
#@Dan Gusfield,Éva Tardos
#t1994
#cAlgorithmica
#index750158
#% 
#!
  
#*Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.
#@Daniele Frigioni,Alberto Marchetti-Spaccamela,Umberto Nanni
#t1998
#cAlgorithmica
#index750159
#% 
#!
  
#*Approximation Algorithms for Minimum -Cut.
#@Nili Guttmann-Beck,Refael Hassin
#t2000
#cAlgorithmica
#index750160
#% 
#!
  
#*Planning a Time-Minimal Motion Among Moving Obstacles.
#@Kikuo Fujimura,Hanan Samet
#t1993
#cAlgorithmica
#index750161
#% 
#!
  
#*Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
#@Nili Guttmann-Beck,Refael Hassin,Samir Khuller,Balaji Raghavachari
#t2000
#cAlgorithmica
#index750162
#% 
#!
  
#*Average-Case Competitive Analyses for Ski-Rental Problems.
#@Hiroshi Fujiwara,Kazuo Iwama
#t2005
#cAlgorithmica
#index750163
#% 
#!
  
#*Inserting an Edge into a Planar Graph.
#@Carsten Gutwenger,Petra Mutzel,René Weiskircher
#t2005
#cAlgorithmica
#index750164
#% 
#!
  
#*Editor's Foreword: Special Issur on Network Flow Algorithms.
#@Harold N. Gabow
#t1994
#cAlgorithmica
#index750165
#% 
#!
  
#*A Linear Algorithm To Decompose Inheritance Graphs Into Modules.
#@Michel Habib,Marianne Huchard,Jeremy Spinrad
#t1995
#cAlgorithmica
#index750166
#% 
#!
  
#*Forests, Frames, and Games: Algorithms for Matroid Sums and Applications.
#@Harold N. Gabow,Herbert H. Westermann
#t1992
#cAlgorithmica
#index750167
#% 
#!
  
#*Dynamic Algorithms for Graphs of Bounded Treewidth.
#@Torben Hagerup
#t2000
#cAlgorithmica
#index750168
#% 
#!
  
#*Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.
#@Anna Galluccio,Guido Proietti
#t2003
#cAlgorithmica
#index750169
#% 
#!
  
#*Fast Integer Merging on the EREW PRAM.
#@Torben Hagerup,Miroslaw Kutylowski
#t1997
#cAlgorithmica
#index750170
#% 
#!
  
#*Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks.
#@Richard A. Games
#t1986
#cAlgorithmica
#index750171
#% 
#!
  
#*Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs.
#@Magnús M. Halldórsson,Guy Kortsarz,Hadas Shachnai
#t2003
#cAlgorithmica
#index750172
#% 
#!
  
#*Algorithms for Minimizing Response Time in Broadcast Scheduling.
#@Rajiv Gandhi,Samir Khuller,Yoo Ah Kim,Yung-Chun (Justin) Wan
#t2004
#cAlgorithmica
#index750173
#% 
#!
  
#*Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs.
#@Magnús M. Halldórsson,Jaikumar Radhakrishnan
#t1997
#cAlgorithmica
#index750174
#% 
#!
  
#*Finding Extrema with Unary Predicates.
#@Feng Gao,Leonidas J. Guibas,David G. Kirkpatrick,William T. Laaser,James B. Saxe
#t1993
#cAlgorithmica
#index750175
#% 
#!
  
#*A General Framework for Assembly Planning: The Motion Space Approach.
#@Dan Halperin,Jean-Claude Latombe,Randall H. Wilson
#t2000
#cAlgorithmica
#index750176
#% 
#!
  
#*Two-Layer Channel Routing with Vertical Uni-Length Overlap.
#@Shaodi Gao,Susanne E. Hambrusch
#t1986
#cAlgorithmica
#index750177
#% 
#!
  
#*A One-Step Crust and Skeleton Extraction Algorithm.
#@Christopher M. Gold,Jack Snoeyink
#t2001
#cAlgorithmica
#index750178
#% 
#!
  
#*Minimean Optimal Key Arrangements in Hash Tables.
#@Andrew Chi-Chih Yao
#t1995
#cAlgorithmica
#index750179
#% 
#!
  
#*A Unified Approach to Conic Visibility.
#@Jesus Garcia-Lopez,Pedro A. Ramos
#t2000
#cAlgorithmica
#index750180
#% 
#!
  
#*New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.
#@Susanne E. Hambrusch,Hung-Yi Tu
#t1997
#cAlgorithmica
#index750181
#% 
#!
  
#*An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane.
#@Naveen Garg,Dorit S. Hochbaum
#t1997
#cAlgorithmica
#index750182
#% 
#!
  
#*Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs.
#@Yijie Han,Victor Y. Pan,John H. Reif
#t1997
#cAlgorithmica
#index750183
#% 
#!
  
#*Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees.
#@Naveen Garg,Vijay V. Vazirani,Mihalis Yannakakis
#t1997
#cAlgorithmica
#index750184
#% 
#!
  
#*Near-Optimal Bounded-Degree Spanning Trees.
#@Jennie C. Hansen,Eric Schmutz
#t2001
#cAlgorithmica
#index750185
#% 
#!
  
#*Combinatorial and Experimental Methods for Approximate Point Pattern Matching.
#@Martin Gavrilov,Piotr Indyk,Rajeev Motwani,Suresh Venkatasubramanian
#t2003
#cAlgorithmica
#index750186
#% 
#!
  
#*Fast Algorithms for Computing the Smallest k-Enclosing Circle.
#@Sariel Har-Peled,Soham Mazumdar
#t2005
#cAlgorithmica
#index750187
#% 
#!
  
#*Simulated Annealing Type Algorithms for Multivariate Optimization.
#@Saul B. Gelfand,Sanjoy K. Mitter
#t1991
#cAlgorithmica
#index750188
#% 
#!
  
#*How Fast Is the k-Means Method?
#@Sariel Har-Peled,Bardia Sadri
#t2005
#cAlgorithmica
#index750189
#% 
#!
  
#*The Bit Complexity of Distributed Sorting.
#@Ornan Ori Gerstel,Shmuel Zaks
#t1997
#cAlgorithmica
#index750190
#% 
#!
  
#*TSP Heuristics: Domination Analysis and Complexity.
#@Abraham P. Punnen,François Margot,Santosh N. Kabadi
#t2003
#cAlgorithmica
#index750191
#% 
#!
  
#*On-the-Fly, Incremental, Consistent Reading of Entire Databases.
#@Calton Pu
#t1986
#cAlgorithmica
#index750192
#%1118253
#%771521
#%1118375
#%832561
#%17461
#%832752
#%773487
#%599175
#%1118529
#%599625
#%1117636
#!
  
#*An Algorithm for Straight-Line Drawing of Planar Graphs.
#@David Harel,Meir Sardas
#t1998
#cAlgorithmica
#index750193
#% 
#!
  
#*Characterizing History Independent Data Structures.
#@Jason D. Hartline,Edwin S. Hong,Alexander E. Mohr,William R. Pentney,Emily Rocke
#t2005
#cAlgorithmica
#index750194
#% 
#!
  
#*Approximation Algorithms for Quickest Spanning Tree Problems.
#@Refael Hassin,Asaf Levin
#t2004
#cAlgorithmica
#index750195
#% 
#!
  
#*Approximation Algorithms for a Capacitated Network Design Problem.
#@Refael Hassin,R. Ravi,F. Sibel Salman
#t2003
#cAlgorithmica
#index750196
#% 
#!
  
#*The Quantum Black-Box Complexity of Majority.
#@Thomas P. Hayes,Samuel Kutin,Dieter van Melkebeek
#t2002
#cAlgorithmica
#index750197
#% 
#!
  
#*New Results for the Minimum Weight Triangulation Problem.
#@Lenwood S. Heath,Sriram V. Pemmaraju
#t1994
#cAlgorithmica
#index750198
#% 
#!
  
#*Sorting by Short Block-Moves.
#@Lenwood S. Heath,John Paul C. Vergara
#t2000
#cAlgorithmica
#index750199
#% 
#!
  
#*Strongly Adaptive Token Distribution.
#@Friedhelm Meyer auf der Heide,Brigitte Oesterdiekhoff,Rolf Wanka
#t1996
#cAlgorithmica
#index750200
#% 
#!
  
#*FIST: Fast Industrial-Strength Triangulation of Polygons.
#@Martin Held
#t2001
#cAlgorithmica
#index750201
#% 
#!
  
#*Coding Techniques for Handling Failures in Large Disk Arrays.
#@Lisa Hellerstein,Garth A. Gibson,Richard M. Karp,Randy H. Katz,David A. Patterson
#t1994
#cAlgorithmica
#index750202
#% 
#!
  
#*Fully Dynamic Biconnectivity in Graphs.
#@Monika Rauch Henzinger
#t1995
#cAlgorithmica
#index750203
#% 
#!
  
#*Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.
#@Monika Rauch Henzinger,Michael L. Fredman
#t1998
#cAlgorithmica
#index750204
#% 
#!
  
#*Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
#@Monika Rauch Henzinger,Valerie King,Tandy Warnow
#t1999
#cAlgorithmica
#index750205
#% 
#!
  
#*An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons.
#@John Hershberger
#t1989
#cAlgorithmica
#index750206
#% 
#!
  
#*Strategy Under the Unknown Stochastic Environment: The Nonparametric Lob-Pass Problem.
#@K. Hiraoka,Shun-ichi Amari
#t1998
#cAlgorithmica
#index750207
#% 
#!
  
#*The Set LCS Problem.
#@Daniel S. Hirschberg,Lawrence L. Larmore
#t1987
#cAlgorithmica
#index750208
#% 
#!
  
#*The Set-Set LCS Problem.
#@Daniel S. Hirschberg,Lawrence L. Larmore
#t1989
#cAlgorithmica
#index750209
#% 
#!
  
#*A Characterization of Planar Graphs by Pseudo-Line Arrangements.
#@Takeshi Hisao
#t2003
#cAlgorithmica
#index750210
#% 
#!
  
#*Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms.
#@Micha Hofri,Philippe Jacquet
#t1998
#cAlgorithmica
#index750211
#% 
#!
  
#*Efficient Reorganization of Binary Search Trees.
#@Micha Hofri,Hadas Shachnai
#t2001
#cAlgorithmica
#index750212
#% 
#!
  
#*Drawing Trees Symmetrically in Three Dimensions.
#@Seok-Hee Hong,Peter Eades
#t2003
#cAlgorithmica
#index750213
#% 
#!
  
#*Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs.
#@Seok-Hee Hong,Peter Eades
#t2005
#cAlgorithmica
#index750214
#% 
#!
  
#*Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs.
#@Seok-Hee Hong,Peter Eades
#t2006
#cAlgorithmica
#index750215
#% 
#!
  
#*A Paradigm for Robust Geometric Algorithms.
#@John E. Hopcroft,Peter J. Kahn
#t1992
#cAlgorithmica
#index750216
#% 
#!
  
#*On Problem Transformability in VLSI.
#@Scot W. Hornick,Majid Sarrafzadeh
#t1987
#cAlgorithmica
#index750217
#% 
#!
  
#*Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
#@Peter Høyer,Jan Neerbek,Yaoyun Shi
#t2002
#cAlgorithmica
#index750218
#%209893
#%621240
#%210062
#%1058548
#%1058576
#%104416
#%930251
#%1060454
#!
  
#*Optimal Algorithms for Dissemination of Information in Some Interconnection Networks.
#@Juraj Hromkovic,Claus-Dieter Jeschke,Burkhard Monien
#t1993
#cAlgorithmica
#index750219
#% 
#!
  
#*A New Combinatorial Approach to Optimal Embeddings of Rectangles.
#@Shou-Hsuan Stephen Huang,Hongfei Liu,Rakesh M. Verma
#t1996
#cAlgorithmica
#index750220
#% 
#!
  
#*Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.
#@Mark Huber
#t2006
#cAlgorithmica
#index750221
#% 
#!
  
#*A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems.
#@Keith E. Humenik,Peter Matthews,A. B. Stephens,Yelena Yesha
#t1995
#cAlgorithmica
#index750222
#% 
#!
  
#*Foreword.
#@Frank K. Hwang
#t1992
#cAlgorithmica
#index750223
#% 
#!
  
#*Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic.
#@Hsien-Kuei Hwang
#t1998
#cAlgorithmica
#index750224
#% 
#!
  
#*The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time.
#@R. Z. Hwang,R. C. Chang,Richard C. T. Lee
#t1993
#cAlgorithmica
#index750225
#% 
#!
  
#*The Slab Dividing Approach To Solve the Euclidean P-Center Problem.
#@R. Z. Hwang,Richard C. T. Lee,R. C. Chang
#t1993
#cAlgorithmica
#index750226
#% 
#!
  
#*Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees.
#@Frank K. Hwang,Y. C. Yao
#t1990
#cAlgorithmica
#index750227
#% 
#!
  
#*Bit-Parallel Witnesses and Their Applications to Approximate String Matching.
#@Heikki Hyyrö,Gonzalo Navarro
#t2005
#cAlgorithmica
#index750228
#% 
#!
  
#*Key-Independent Optimality.
#@John Iacono
#t2005
#cAlgorithmica
#index750229
#% 
#!
  
#*Queaps.
#@John Iacono,Stefan Langerman
#t2005
#cAlgorithmica
#index750230
#% 
#!
  
#*Shortest Paths for Line Segments.
#@Christian Icking,Günter Rote,Emo Welzl,Chee-Keng Yap
#t1993
#cAlgorithmica
#index750231
#% 
#!
  
#*Covering a String.
#@Costas S. Iliopoulos,D. W. G. Moore,Kunsoo Park
#t1996
#cAlgorithmica
#index750232
#% 
#!
  
#*A Linear-Time Algorithm for Linear L_1 Approximation of Points.
#@Hiroshi Imai,Kenji Kato,Peter Yamamoto
#t1989
#cAlgorithmica
#index750233
#% 
#!
  
#*A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors.
#@Celina Imielinska,Bahman Kalantari
#t1997
#cAlgorithmica
#index750234
#% 
#!
  
#*Security of Practical Time-Reversed EPR Quantum Key Distribution.
#@Hitoshi Inamori
#t2002
#cAlgorithmica
#index750235
#% 
#!
  
#*Security of Practical BB84 Quantum Key Distribution.
#@Hitoshi Inamori
#t2002
#cAlgorithmica
#index750236
#% 
#!
  
#*A Time Bound on the Materialization of Some Recursively Defined Views.
#@Yannis E. Ioannidis
#t1986
#cAlgorithmica
#index750237
#%770718
#%832492
#%950649
#%951454
#!
  
#*An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary Structure.
#@T. C. Ip,Vincent A. Fischetti,Jeanette P. Schmidt
#t1999
#cAlgorithmica
#index750238
#% 
#!
  
#*Randomized Weighted Caching with Two Page Weights.
#@Sandy Irani
#t2002
#cAlgorithmica
#index750239
#% 
#!
  
#*Page Replacement with Multi-Size Pages and Applications to Web Caching.
#@Sandy Irani
#t2002
#cAlgorithmica
#index750240
#% 
#!
  
#*Coloring Inductive Graphs On-Line.
#@Sandy Irani
#t1994
#cAlgorithmica
#index750241
#% 
#!
  
#*A Multiplicative Barrier Function Method for Linear Programming.
#@Masao Iri,Hiroshi Imai
#t1986
#cAlgorithmica
#index750242
#% 
#!
  
#*Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.
#@Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki
#t2006
#cAlgorithmica
#index750243
#% 
#!
  
#*Guest Editor's Introduction.
#@Giuseppe F. Italiano
#t2001
#cAlgorithmica
#index750244
#% 
#!
  
#*Maintaining Spanning Trees of Small Diameter.
#@Giuseppe F. Italiano,Rajiv Ramaswami
#t1998
#cAlgorithmica
#index750245
#% 
#!
  
#*A New Scaling Algorithm for the Maximum Mean Cut Problem.
#@Kazuo Iwano,Shinji Misono,Shu Tezuka,Satoru Fujishige
#t1994
#cAlgorithmica
#index750246
#% 
#!
  
#*Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
#@Satoru Iwata
#t2003
#cAlgorithmica
#index750247
#% 
#!
  
#*Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source.
#@Philippe Jacquet,Wojciech Szpankowski,Jing Tang
#t2001
#cAlgorithmica
#index750248
#% 
#!
  
#*Maximal Selection in Tandem Networks with Symmetric Hearing Range.
#@Jeffrey M. Jaffe,Zvi Rosberg
#t1989
#cAlgorithmica
#index750249
#% 
#!
  
#*Distributed Deadlock Resolution in Store-and-Forward Networks.
#@Jeffrey M. Jaffe,Moshe Sidi
#t1989
#cAlgorithmica
#index750250
#% 
#!
  
#*VISOR: Vast Independence System Optimization Routine.
#@B. de Jager,J. Banens
#t2001
#cAlgorithmica
#index750251
#% 
#!
  
#*An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem.
#@Kamal Jain,Vijay V. Vazirani
#t2003
#cAlgorithmica
#index750252
#% 
#!
  
#*Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme.
#@Klaus Jansen
#t2004
#cAlgorithmica
#index750253
#% 
#!
  
#*Guest Editors' Introduction.
#@Klaus Jansen,Samir Khuller
#t2003
#cAlgorithmica
#index750254
#% 
#!
  
#*Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
#@Klaus Jansen,Lorant Porkolab
#t2002
#cAlgorithmica
#index750255
#% 
#!
  
#*Guest Editors' Introduction.
#@Klaus Jansen,José D. P. Rolim
#t2001
#cAlgorithmica
#index750256
#% 
#!
  
#*The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
#@Thomas Jansen,Ingo Wegener
#t2002
#cAlgorithmica
#index750257
#% 
#!
  
#*Rooted Maximum Agreement Supertrees.
#@Jesper Jansson,Joseph H.-K. Ng,Kunihiko Sadakane,Wing-Kin Sung
#t2005
#cAlgorithmica
#index750258
#% 
#!
  
#*Numerical Stability of a Convex Hull Algorithm for Simple Polygons.
#@Jerzy W. Jaromczyk,Grzegorz W. Wasilkowski
#t1993
#cAlgorithmica
#index750259
#% 
#!
  
#*Parallel Geometric Algorithms on a Mesh-Connected Computer.
#@C. S. Jeong,D. T. Lee
#t1990
#cAlgorithmica
#index750260
#% 
#!
  
#*A Mildly Exponential Approximation Algorithm for the Permanent.
#@Mark Jerrum,Umesh V. Vazirani
#t1996
#cAlgorithmica
#index750261
#% 
#!
  
#*The Derivation of On-Line Algorithms, with an Application To Finding Palindromes.
#@Johan Jeuring
#t1994
#cAlgorithmica
#index750262
#% 
#!
  
#*Mapping Clones with a Given Ordering or Interleaving.
#@Tao Jiang,Richard M. Karp
#t1998
#cAlgorithmica
#index750263
#%2022
#%2616
#%622444
#!
  
#*Duality of Constrained Voronoi Diagrams and Delaunay Triangulations.
#@Barry Joe,Cao An Wang
#t1993
#cAlgorithmica
#index750264
#% 
#!
  
#*Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree.
#@Donald B. Johnson,Panagiotis Takis Metaxas
#t1996
#cAlgorithmica
#index750265
#% 
#!
  
#*Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.
#@Michael Jünger,Petra Mutzel
#t1996
#cAlgorithmica
#index750266
#% 
#!
  
#*New Primal and Dual Matching Heuristics.
#@Michael Jünger,William R. Pulleyblank
#t1995
#cAlgorithmica
#index750267
#% 
#!
  
#*Practical Performance of Efficient Minimum Cut Algorithms.
#@Michael Jünger,Giovanni Rinaldi
#t2000
#cAlgorithmica
#index750268
#% 
#!
  
#*Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions.
#@Santosh N. Kabadi,Yash P. Aneja
#t2001
#cAlgorithmica
#index750269
#% 
#!
  
#*Optimal Read-Once Parallel Disk Scheduling.
#@Mahesh Kallahalla,Peter J. Varman
#t2005
#cAlgorithmica
#index750270
#% 
#!
  
#*Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees.
#@Damon Kaller
#t2000
#cAlgorithmica
#index750271
#% 
#!
  
#*Scheduling Tree DAGs on Parallel Architectures.
#@Konstantinos Kalpakis,Yelena Yesha
#t1996
#cAlgorithmica
#index750272
#% 
#!
  
#*Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.
#@Konstantinos Kalpakis,Yaacov Yesha
#t1999
#cAlgorithmica
#index750273
#% 
#!
  
#*Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields.
#@Erich Kaltofen,A. Lobo
#t1999
#cAlgorithmica
#index750274
#% 
#!
  
#*Caching for Web Searching.
#@Bala Kalyanasundaram,John Noga,Kirk Pruhs,Gerhard J. Woeginger
#t2002
#cAlgorithmica
#index750275
#% 
#!
  
#*Fault-Tolerant Real-Time Scheduling.
#@Bala Kalyanasundaram,Kirk Pruhs
#t2000
#cAlgorithmica
#index750276
#% 
#!
  
#*Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks.
#@Bala Kalyanasundaram,Kirk Pruhs,Eric Torng
#t2000
#cAlgorithmica
#index750277
#% 
#!
  
#*A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem.
#@Yoko Kamidoi,Shin'ichi Wakabayashi,Noriyoshi Yoshida
#t2002
#cAlgorithmica
#index750278
#% 
#!
  
#*Minimizing alpha-Information for Generalization and Interpretation.
#@R. Kamimura
#t1998
#cAlgorithmica
#index750279
#% 
#!
  
#*On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes.
#@Paris C. Kanellakis,Scott A. Smolka
#t1988
#cAlgorithmica
#index750280
#% 
#!
  
#*Drawing Planar Graphs Using the Canonical Ordering.
#@Goos Kant
#t1996
#cAlgorithmica
#index750281
#% 
#!
  
#*Guest Editors' Foreword.
#@Ming-Yang Kao,A. S. Kyle,P. Lakner
#t1999
#cAlgorithmica
#index750282
#% 
#!
  
#*An Optimal Parallel Algorithm for Planar Cycle Separators.
#@Ming-Yang Kao,Shang-Hua Teng,Kentaro Toyama
#t1995
#cAlgorithmica
#index750283
#% 
#!
  
#*Bounded Degree Interval Sandwich Problems.
#@Haim Kaplan,Ron Shamir
#t1999
#cAlgorithmica
#index750284
#% 
#!
  
#*A Tutorial for Designing Flexible Geometric Algorithms.
#@Vikas Kapoor,Dietmar Kühl,Alexander Wolff
#t2002
#cAlgorithmica
#index750285
#% 
#!
  
#*An Algorithm for Enumerating All Spanning Trees of a Directed Graph.
#@Sanjiv Kapoor,H. Ramesh
#t2000
#cAlgorithmica
#index750286
#% 
#!
  
#*Lower Bounds for Maximal and Convex Layers Problems.
#@Sanjiv Kapoor,Prakash V. Ramanan
#t1989
#cAlgorithmica
#index750287
#% 
#!
  
#*Stochastic Rearrangement Rules for Self-Organizing Data Structures.
#@Sanjiv Kapoor,Edward M. Reingold
#t1991
#cAlgorithmica
#index750288
#% 
#!
  
#*Visualization of Three-Dimensional Delaunay Meshes.
#@Michael S. Karasick,Derek Lieber,Lee R. Nackman,V. T. Rajan
#t1997
#cAlgorithmica
#index750289
#% 
#!
  
#*On Approximating the Longest Path in a Graph.
#@David R. Karger,Rajeev Motwani,G. D. S. Ramkumar
#t1997
#cAlgorithmica
#index750290
#% 
#!
  
#*Lempel-Ziv Index for -Grams.
#@Juha Kärkkäinen,Erkki Sutinen
#t1998
#cAlgorithmica
#index750291
#% 
#!
  
#*Dynamic TCP Acknowledgment and Other Stories about e/(e-1).
#@Anna R. Karlin,Claire Kenyon,Dana Randall
#t2003
#cAlgorithmica
#index750292
#% 
#!
  
#*Competitive Randomized Algorithms for Nonuniform Problems.
#@Anna R. Karlin,Mark S. Manasse,Lyle A. McGeoch,Susan S. Owicki
#t1994
#cAlgorithmica
#index750293
#% 
#!
  
#*Competitive Snoopy Caching.
#@Anna R. Karlin,Mark S. Manasse,Larry Rudolph,Daniel Dominic Sleator
#t1988
#cAlgorithmica
#index750294
#% 
#!
  
#*Algorithms for the Compilation of Regular Expressions into PLAs.
#@Anna R. Karlin,Howard Trickey,Jeffrey D. Ullman
#t1987
#cAlgorithmica
#index750295
#% 
#!
  
#*Efficient PRAM Simulation on a Distributed Memory Machine.
#@Richard M. Karp,Michael Luby,Friedhelm Meyer auf der Heide
#t1996
#cAlgorithmica
#index750296
#% 
#!
  
#*Global Wire Routing in Two-Dimensional Arrays.
#@Richard M. Karp,Frank Thomson Leighton,Ronald L. Rivest,Clark D. Thompson,Umesh V. Vazirani,Vijay V. Vazirani
#t1987
#cAlgorithmica
#index750297
#% 
#!
  
#*Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
#@Marek Karpinski
#t2001
#cAlgorithmica
#index750298
#% 
#!
  
#*Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem.
#@Marek Karpinski,Ion I. Mandoiu,Alexander Olshevsky,Alexander Zelikovsky
#t2005
#cAlgorithmica
#index750299
#% 
#!
  
#*Foreword.
#@Naoki Katoh
#t2006
#cAlgorithmica
#index750300
#% 
#!
  
#*A Cautious Scheduler for Multistep Transactions.
#@Naoki Katoh,Tiko Kameda,Toshihide Ibaraki
#t1987
#cAlgorithmica
#index750301
#% 
#!
  
#*Maintenance of a Piercing Set for Intervals with Applications.
#@Matthew J. Katz,Frank Nielsen,Michael Segal
#t2003
#cAlgorithmica
#index750302
#% 
#!
  
#*Parity Conditions in Homotopic Knock-Knee Routing.
#@Michael Kaufmann,F. Miller Maley
#t1993
#cAlgorithmica
#index750303
#% 
#!
  
#*Routing on Meshes with Buses.
#@Michael Kaufmann,Rajeev Raman,Jop F. Sibeyn
#t1997
#cAlgorithmica
#index750304
#% 
#!
  
#*Randomized Multipacket Routing and Sorting on Meshes.
#@Michael Kaufmann,Jop F. Sibeyn
#t1997
#cAlgorithmica
#index750305
#% 
#!
  
#*Optimal Online Algorithms for an Electronic Commerce Money Distribution System.
#@Hiroshi Kawazoe,Tetsuo Shibuya,Takeshi Tokuyama
#t2002
#cAlgorithmica
#index750306
#% 
#!
  
#*A Reflective Symmetry Descriptor for 3D Models.
#@Michael M. Kazhdan,Bernard Chazelle,David P. Dobkin,Thomas A. Funkhouser,Szymon Rusinkiewicz
#t2003
#cAlgorithmica
#index750307
#% 
#!
  
#*An Approximation Algorithm for a Large-Scale Facility Location Problem.
#@Hiroyuki Kazuyoshi
#t2003
#cAlgorithmica
#index750308
#% 
#!
  
#*Evolutionary Trees and Ordinal Assertions.
#@Paul E. Kearney,Ryan Hayward,Henk Meijer
#t1999
#cAlgorithmica
#index750309
#% 
#!
  
#*Combinatiorial Algorithms for DNA Sequence Assembly.
#@John D. Kececioglu,Eugene W. Myers
#t1995
#cAlgorithmica
#index750310
#% 
#!
  
#*Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement.
#@John D. Kececioglu,David Sankoff
#t1995
#cAlgorithmica
#index750311
#% 
#!
  
#*Tiling a Polygon with Parallelograms.
#@Richard Kenyon
#t1993
#cAlgorithmica
#index750312
#% 
#!
  
#*The Data Broadcast Problem with Non-Uniform Transmission Times.
#@Claire Kenyon,Nicolas Schabanel
#t2003
#cAlgorithmica
#index750313
#% 
#!
  
#*Maximum Queue Size and Hashing with Lazy Deletion.
#@Claire Kenyon,Jeffrey Scott Vitter
#t1991
#cAlgorithmica
#index750314
#% 
#!
  
#*Adaptive AIMD Congestion Control.
#@Alexander Kesselman,Yishay Mansour
#t2005
#cAlgorithmica
#index750315
#% 
#!
  
#*Improved Competitive Guarantees for QoS Buffering.
#@Alexander Kesselman,Yishay Mansour,Rob van Stee
#t2005
#cAlgorithmica
#index750316
#% 
#!
  
#*On Certificates and Lookahead in Dynamic Graph Problems.
#@Sanjeev Khanna,Rajeev Motwani,Randall H. Wilson
#t1998
#cAlgorithmica
#index750317
#% 
#!
  
#*Flow in Planar Graphs with Vertex Capacities.
#@Samir Khuller,Joseph Naor
#t1994
#cAlgorithmica
#index750318
#% 
#!
  
#*Balancing Minimum Spanning Trees and Shortest-Path Trees.
#@Samir Khuller,Balaji Raghavachari,Neal E. Young
#t1995
#cAlgorithmica
#index750319
#% 
#!
  
#*Efficient Collision Detection among Moving Spheres with Unknown Trajectories.
#@Ho Kyung Kim,Leonidas J. Guibas,Sung Yong Shin
#t2005
#cAlgorithmica
#index750320
#% 
#!
  
#*Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space.
#@Dae Seoung Kim,Kwan-Hee Yoo,Kyung-Yong Chwa,Sung Yong Shin
#t1998
#cAlgorithmica
#index750321
#% 
#!
  
#*Interleaved Prefetching.
#@Tracy Kimbrel
#t2002
#cAlgorithmica
#index750322
#% 
#!
  
#*A Simpler Minimum Spanning Tree Verification Algorithm.
#@Valerie King
#t1997
#cAlgorithmica
#index750323
#% 
#!
  
#*Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt.
#@David G. Kirkpatrick,Teresa M. Przytycka
#t1996
#cAlgorithmica
#index750324
#% 
#!
  
#*Detecting Race Conditions in Parallel Programs that Use Semaphores.
#@Philip N. Klein,Robert H. B. Netzer,Hsueh-I Lu
#t2003
#cAlgorithmica
#index750325
#% 
#!
  
#*A Dynamic Fixed Windowing Problem.
#@Rolf Klein,Otto Nurmi,Thomas Ottmann,Derick Wood
#t1989
#cAlgorithmica
#index750326
#% 
#!
  
#*A Parallel Algorithm for Approximating the Minimum Cycle Cover.
#@Philip N. Klein,Clifford Stein
#t1993
#cAlgorithmica
#index750327
#% 
#!
  
#*A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs.
#@Philip N. Klein,Sairam Subramanian
#t1998
#cAlgorithmica
#index750328
#% 
#!
  
#*A Note on the Asymptotic Behavior of the Depth of Tries.
#@Charles Knessl
#t1998
#cAlgorithmica
#index750329
#% 
#!
  
#*Super-Pattern Matching.
#@James R. Knight,Eugene W. Myers
#t1995
#cAlgorithmica
#index750330
#% 
#!
  
#*Approximate Regular Expression Pattern Matching with Concave Gap Penalties.
#@James R. Knight,Eugene W. Myers
#t1995
#cAlgorithmica
#index750331
#% 
#!
  
#*Linear Probing and Graphs.
#@Donald E. Knuth
#t1998
#cAlgorithmica
#index750332
#% 
#!
  
#*An Optimal Approximation Algorithm for the Rectilinear m-Center Problem.
#@Ming-Tat Ko,Richard C. T. Lee,Jyun-Sheng Chang
#t1990
#cAlgorithmica
#index750333
#% 
#!
  
#*Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size.
#@Daniel Kobler,Udi Rotics
#t2003
#cAlgorithmica
#index750334
#% 
#!
  
#*Multidimensional Cube Packing.
#@Yoshiharu Kohayakawa,Flávio Keidi Miyazawa,Prabhakar Raghavan,Yoshiko Wakabayashi
#t2004
#cAlgorithmica
#index750335
#% 
#!
  
#*Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm.
#@Masakazu Kojima
#t1986
#cAlgorithmica
#index750336
#% 
#!
  
#*Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.
#@Petr Kolman,Christian Scheideler
#t2004
#cAlgorithmica
#index750337
#% 
#!
  
#*Matching Polyhedral Terrains Using Overlays of Envelopes.
#@Vladlen Koltun,Carola Wenk
#t2005
#cAlgorithmica
#index750338
#% 
#!
  
#*Improved Approximations for Tour and Tree Covers.
#@Jochen Könemann,Goran Konjevod,Ojas Parekh,Amitabh Sinha
#t2003
#cAlgorithmica
#index750339
#% 
#!
  
#*Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
#@Jochen Könemann,Asaf Levin,Amitabh Sinha
#t2004
#cAlgorithmica
#index750340
#% 
#!
  
#*Parallel Strategies for Computing the Orthogonal Factorizations Used in the Estimation of Econometric Models.
#@Erricos John Kontoghiorghes
#t1999
#cAlgorithmica
#index750341
#% 
#!
  
#*On the Hardness of Approximating Spanners.
#@Guy Kortsarz
#t2001
#cAlgorithmica
#index750342
#% 
#!
  
#*Approximating Node Connectivity Problems via Set Covers.
#@Guy Kortsarz,Zeev Nutov
#t2003
#cAlgorithmica
#index750343
#% 
#!
  
#*Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence.
#@Madhukar R. Korupolu,Vijaya Ramachandran
#t2002
#cAlgorithmica
#index750344
#% 
#!
  
#*Guest Editor's Foreword.
#@Marc J. van Kreveld
#t2001
#cAlgorithmica
#index750345
#% 
#!
  
#*Divided k-d Trees.
#@Marc J. van Kreveld,Mark H. Overmars
#t1991
#cAlgorithmica
#index750346
#% 
#!
  
#*Approximate Unions of Lines and Minkowski Sums.
#@Marc J. van Kreveld,A. Frank van der Stappen
#t2006
#cAlgorithmica
#index750347
#% 
#!
  
#*Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments.
#@P. Krishnan,Philip M. Long,Jeffrey Scott Vitter
#t1999
#cAlgorithmica
#index750348
#% 
#!
  
#*Fast Deterministic Selection on Mesh-Connected Processor Arrays.
#@Danny Krizanc,Lata Narayanan,Rajeev Raman
#t1996
#cAlgorithmica
#index750349
#% 
#!
  
#*A Flexible Way of Counting Large Numbers Approximately in Small Registers.
#@J. B. Kruskal,Albert G. Greenberg
#t1991
#cAlgorithmica
#index750350
#% 
#!
  
#*Efficient Parallel Algorithms for Graph Problems.
#@Clyde P. Kruskal,Larry Rudolph,Marc Snir
#t1990
#cAlgorithmica
#index750351
#% 
#!
  
#*Optimizing Area for Three-Layer Knock-Knee Channel Routing.
#@Ruth Kuchem,Dorothea Wagner,Frank Wagner
#t1996
#cAlgorithmica
#index750352
#% 
#!
  
#*An Approximation Algorithm for Circular Arc Colouring.
#@V. Kumar
#t2001
#cAlgorithmica
#index750353
#% 
#!
  
#*Approximating Latin Square Extensions.
#@Ravi Kumar,Alexander Russell,Ravi Sundaram
#t1999
#cAlgorithmica
#index750354
#% 
#!
  
#*Packet Routing on Grids of Processors.
#@Manfred Kunde
#t1993
#cAlgorithmica
#index750355
#% 
#!
  
#*Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.
#@Manfred Kunde,Rolf Niedermeier,Klaus Reinhardt,Peter Rossmanith
#t1999
#cAlgorithmica
#index750356
#% 
#!
  
#*PAC Learning Intersections of Halfspaces with Membership Queries.
#@Stephen Kwek,Leonard Pitt
#t1998
#cAlgorithmica
#index750357
#% 
#!
  
#*Editors' Introduction.
#@Andrea S. LaPaugh,Frank Thomson Leighton
#t1991
#cAlgorithmica
#index750358
#% 
#!
  
#*Preface Special Issue on Robotics.
#@Chee-Keng Yap
#t1987
#cAlgorithmica
#index750359
#% 
#!
  
#*Robot Motion Planning: A Game-Theoretic Foundation.
#@Steven M. LaValle
#t2000
#cAlgorithmica
#index750360
#% 
#!
  
#*A Technique for Constructing Highly Available Services.
#@Rivka Ladin,Barbara Liskov,Liuba Shrira
#t1988
#cAlgorithmica
#index750361
#% 
#!
  
#*A Theory of Rectangular Dual Graphs.
#@Yen-Tai Lai,Sany M. Leinwand
#t1990
#cAlgorithmica
#index750362
#% 
#!
  
#*Finding Least-Weight Subsequences with Fewer Processors.
#@Tak Wah Lam,Kwong-fai Chan
#t1993
#cAlgorithmica
#index750363
#% 
#!
  
#*Optimal Edge Ranking of Trees in Linear Time.
#@Tak Wah Lam,Fung Ling Yue
#t2001
#cAlgorithmica
#index750364
#% 
#!
  
#*Efficient On-Line Nonparametric Kernel Density Estimation.
#@C. G. Lambert,S. E. Harrington,C. R. Harvey,A. Glodjo
#t1999
#cAlgorithmica
#index750365
#% 
#!
  
#*Embedding Linkages on an Integer Lattice.
#@Susan Landau,Neil Immerman
#t2002
#cAlgorithmica
#index750366
#% 
#!
  
#*Pattern Matching in a Digitized Image.
#@Gad M. Landau,Uzi Vishkin
#t1994
#cAlgorithmica
#index750367
#% 
#!
  
#*Approximating Shortest Paths on Weighted Polyhedral Surfaces.
#@Mark Lanthier,Anil Maheshwari,Jörg-Rüdiger Sack
#t2001
#cAlgorithmica
#index750368
#% 
#!
  
#*Relaxed Balance Using Standard Rotations.
#@Kim S. Larsen,Eljas Soisalon-Soininen,Peter Widmayer
#t2001
#cAlgorithmica
#index750369
#% 
#!
  
#*Landmark-Based Robot Navigation.
#@Anthony Lazanas,Jean-Claude Latombe
#t1995
#cAlgorithmica
#index750370
#% 
#!
  
#*Some Chain Visibility Problems in a Simple Polygon.
#@Sang Ho Lee,Kyung-Yong Chwa
#t1990
#cAlgorithmica
#index750371
#% 
#!
  
#*Parallel Implementation of a Class of Adaptive Signal Processing Applications.
#@Myungho Lee,Wenheng Liu,Viktor K. Prasanna
#t2001
#cAlgorithmica
#index750372
#% 
#!
  
#*Complexity of Some Laction Problems.
#@D. T. Lee,Ying-Fung Wu
#t1986
#cAlgorithmica
#index750373
#% 
#!
  
#*A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues.
#@Frank Thomson Leighton,Fillia Makedon,Ioannis G. Tollis
#t1995
#cAlgorithmica
#index750374
#% 
#!
  
#*Efficient Algorithms for Dynamic Allocation of Distributed Memo.
#@Frank Thomson Leighton,Eric J. Schwabe
#t1999
#cAlgorithmica
#index750375
#% 
#!
  
#*Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines.
#@Charles E. Leiserson,Bruce M. Maggs
#t1988
#cAlgorithmica
#index750376
#% 
#!
  
#*Retiming Synchronous Circuitry.
#@Charles E. Leiserson,James B. Saxe
#t1991
#cAlgorithmica
#index750377
#% 
#!
  
#*Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity.
#@Hans-Peter Lenhof,Michiel H. M. Smid
#t1995
#cAlgorithmica
#index750378
#% 
#!
  
#*Preface.
#@Stefano Leonardi
#t2004
#cAlgorithmica
#index750379
#% 
#!
  
#*On-Line Resource Management with Application to Routing and Scheduling.
#@Stefano Leonardi,Alberto Marchetti-Spaccamela
#t1999
#cAlgorithmica
#index750380
#% 
#!
  
#*Guest Editors' Foreword.
#@Hon Wai Leong,Hiroshi Imai
#t2003
#cAlgorithmica
#index750381
#% 
#!
  
#*A New Algorithm for Scheduling Periodic Real-Time Tasks.
#@Joseph Y.-T. Leung
#t1989
#cAlgorithmica
#index750382
#% 
#!
  
#*Minimizing Mean Flow Time with Error Constraint.
#@Joseph Y.-T. Leung,Tommy W. Tam,C. S. Wong,Gilbert H. Young
#t1998
#cAlgorithmica
#index750383
#% 
#!
  
#*A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.
#@Christos Levcopoulos,Drago Krznaric
#t1998
#cAlgorithmica
#index750384
#% 
#!
  
#*On Approximation Behavior of the Greedy Triangulation for Convex Polygons.
#@Christos Levcopoulos,Andrzej Lingas
#t1987
#cAlgorithmica
#index750385
#% 
#!
  
#*There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees.
#@Christos Levcopoulos,Andrzej Lingas
#t1992
#cAlgorithmica
#index750386
#% 
#!
  
#*Improved Algorithms for Constructing Fault-Tolerant Spanners.
#@Christos Levcopoulos,Giri Narasimhan,Michiel H. M. Smid
#t2002
#cAlgorithmica
#index750387
#% 
#!
  
#*Admission Control in Networks with Advance Reservations.
#@Liane Lewin-Eytan,Joseph Naor,Ariel Orda
#t2004
#cAlgorithmica
#index750388
#% 
#!
  
#*Three Priority Queue Applications Revisited.
#@Andrew M. Liao
#t1992
#cAlgorithmica
#index750389
#% 
#!
  
#*Efficient Algorithms for Block-Cyclic Redistribution of Arrays.
#@Young Won Lim,Prashanth B. Bhat,Viktor K. Prasanna
#t1999
#cAlgorithmica
#index750390
#% 
#!
  
#*A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound.
#@Shun-Shii Lin,Kwei-Jay Lin
#t1997
#cAlgorithmica
#index750391
#% 
#!
  
#*Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.
#@Andrzej Lingas,Anil Maheshwari,Jörg-Rüdiger Sack
#t1995
#cAlgorithmica
#index750392
#% 
#!
  
#*On-Line Dial-a-Ride Problems Under a Restricted Information Model.
#@Maarten Lipmann,Xiwen Lu,Willem de Paepe,René Sitters,Leen Stougie
#t2004
#cAlgorithmica
#index750393
#% 
#!
  
#*Clocked Adversaries for Hashing.
#@Richard J. Lipton,Jeffrey F. Naughton
#t1993
#cAlgorithmica
#index750394
#% 
#!
  
#*Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling.
#@Björn Lisper
#t1996
#cAlgorithmica
#index750395
#% 
#!
  
#*Structural Lines, TINs, and DEMs.
#@James J. Little,Ping Shi
#t2001
#cAlgorithmica
#index750396
#% 
#!
  
#*On Steiner Minimal Trees with L_p Distance.
#@Zi-Cheng Liu,Ding-Zhu Du
#t1992
#cAlgorithmica
#index750397
#% 
#!
  
#*On Partitioning Rectilinear Polygons into Star-Shaped Polygons.
#@Robon Liu,Simeon C. Ntafos
#t1991
#cAlgorithmica
#index750398
#% 
#!
  
#*A Preliminary Study of a Diagonal Channel-Routing Model.
#@Elena Lodi,Fabrizio Luccio,Linda Pagli
#t1989
#cAlgorithmica
#index750399
#% 
#!
  
#*An Iterative Displacement Method for Conflict Resolution in Map Generalization.
#@M. Lonergan,Cliff B. Jones
#t2001
#cAlgorithmica
#index750400
#% 
#!
  
#*Introduction to Special Issue on Randomized and Derandomized Algorithms.
#@Michael Luby
#t1996
#cAlgorithmica
#index750401
#% 
#!
  
#*A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior.
#@Michael Luby,Prabhakar Ragde
#t1989
#cAlgorithmica
#index750402
#% 
#!
  
#*On Deterministic Approximation of DNF.
#@Michael Luby,Boban Velickovic
#t1996
#cAlgorithmica
#index750403
#% 
#!
  
#*Efficient Parallel Algorithms for Path Problems in Directed Graphs.
#@Joan M. Lucas,Marian Gunsher Sackrowitz
#t1992
#cAlgorithmica
#index750404
#% 
#!
  
#*A New Scheme for the Deterministic Simulation of PRAMs in VLSI.
#@Fabrizio Luccio,Andrea Pietracaprina,Geppino Pucci
#t1990
#cAlgorithmica
#index750405
#% 
#!
  
#*Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs.
#@Corinne Lucet,Jean-Francois Manouvrier,Jacques Carlier
#t2000
#cAlgorithmica
#index750406
#% 
#!
  
#*Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape.
#@Vladimir J. Lumelsky,Alexander A. Stepanov
#t1987
#cAlgorithmica
#index750407
#% 
#!
  
#*Linear Bidirectional On-Line Construction of Affix Trees.
#@Moritz G. Maaß
#t2003
#cAlgorithmica
#index750408
#% 
#!
  
#*Automated Displacement for Large Numbers of Discrete Map Objects.
#@William A. Mackaness,Ross S. Purves
#t2001
#cAlgorithmica
#index750409
#% 
#!
  
#*Improved Routing and Sorting on Multibutterflies.
#@Bruce M. Maggs,Berthold Vöcking
#t2000
#cAlgorithmica
#index750410
#% 
#!
  
#*Solving Some Discrepancy Problems in NC.
#@Sanjeev Mahajan,Edgar A. Ramos,K. V. Subrahmanyam
#t2001
#cAlgorithmica
#index750411
#% 
#!
  
#*A Dynamic Dictionary for Priced Information with Application.
#@Anil Maheshwari,Michiel H. M. Smid
#t2006
#cAlgorithmica
#index750412
#% 
#!
  
#*The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees.
#@Hosam M. Mahmoud
#t1995
#cAlgorithmica
#index750413
#% 
#!
  
#*Probabilistic Analysis of MULTIPLE QUICK SELECT.
#@Hosam M. Mahmoud,Robert T. Smythe
#t1998
#cAlgorithmica
#index750414
#% 
#!
  
#*Approximate Matching of Run-Length Compressed Strings.
#@Veli Mäkinen,Esko Ukkonen,Gonzalo Navarro
#t2003
#cAlgorithmica
#index750415
#% 
#!
  
#*Max- and Min-Neighborhood Monopolies.
#@Kazuhisa Makino,Masafumi Yamashita,Tiko Kameda
#t2002
#cAlgorithmica
#index750416
#% 
#!
  
#*Sum Coloring of Bipartite Graphs with Bounded Degree.
#@Michal Malafiejski,Krzysztof Giaro,Robert Janczewski,Marek Kubale
#t2004
#cAlgorithmica
#index750417
#% 
#!
  
#*A Generic Algorithm for One-Dimensional Homotopic Compaction.
#@F. Miller Maley
#t1991
#cAlgorithmica
#index750418
#% 
#!
  
#*Testing Homotopic Routability Under Polygonal Wiring Rules.
#@F. Miller Maley
#t1996
#cAlgorithmica
#index750419
#% 
#!
  
#*A Lower Bound on the Period Length of a Distributed Scheduler.
#@Yossi Malka,Shlomo Moran,Shmuel Zaks
#t1993
#cAlgorithmica
#index750420
#% 
#!
  
#*On "An Improved Algorithm for Finding the Median Distributively".
#@S. L. Mantzaris
#t1993
#cAlgorithmica
#index750421
#% 
#!
  
#*Engineering a Lightweight Suffix Array Construction Algorithm.
#@Giovanni Manzini,Paolo Ferragina
#t2004
#cAlgorithmica
#index750422
#% 
#!
  
#*Sorting in Constant Number of Row and Column Phases on a Mesh.
#@John M. Marberg,Eli Gafni
#t1988
#cAlgorithmica
#index750423
#% 
#!
  
#*Planning Motions of Polyhedral Parts by Rolling.
#@Alessia Marigo,Marco Ceccarelli,S. Piccinocchi,Antonio Bicchi
#t2000
#cAlgorithmica
#index750424
#% 
#!
  
#*A General Model for Authenticated Data Structures.
#@Charles U. Martel,Glen Nuckolls,Premkumar T. Devanbu,Michael Gertz,April Kwong,Stuart G. Stubblebine
#t2004
#cAlgorithmica
#index750425
#% 
#!
  
#*Partial Match Queries in Relaxed Multidimensional Search Trees.
#@Conrado Martinez,Alois Panholzer,Helmut Prodinger
#t2001
#cAlgorithmica
#index750426
#% 
#!
  
#*Chain Packing in Graphs.
#@Shigeru Masuyama,Toshihide Ibaraki
#t1991
#cAlgorithmica
#index750427
#% 
#!
  
#*Some Problems in Computational Geometry.
#@Claire Mathieu
#t1987
#cAlgorithmica
#index750428
#% 
#!
  
#*Efficient Randomized Algorithms for the Repeated Median Line Estimator.
#@Jirí Matousek,David M. Mount,Nathan S. Netanyahu
#t1998
#cAlgorithmica
#index750429
#% 
#!
  
#*A Subexponential Bound for Linear Programming.
#@Jirí Matousek,Micha Sharir,Emo Welzl
#t1996
#cAlgorithmica
#index750430
#% 
#!
  
#*A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs.
#@T. Matsui
#t1997
#cAlgorithmica
#index750431
#% 
#!
  
#*Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo Algorithms.
#@Friedemann Mattern
#t1990
#cAlgorithmica
#index750432
#% 
#!
  
#*Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks.
#@Ernst W. Mayr,Ralph Werchner
#t1997
#cAlgorithmica
#index750433
#% 
#!
  
#*Memory-Efficient Matrix Multiplication in the BSP Model.
#@William F. McColl,Alexandre Tiskin
#t1999
#cAlgorithmica
#index750434
#% 
#!
  
#*Linear-Time Recognition of Circular-Arc Graphs.
#@Ross M. McConnell
#t2003
#cAlgorithmica
#index750435
#% 
#!
  
#*An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures.
#@Ross M. McConnell
#t1995
#cAlgorithmica
#index750436
#% 
#!
  
#*All-Pairs Shortest Paths and the Essential Subgraph.
#@Catherine C. McGeoch
#t1995
#cAlgorithmica
#index750437
#% 
#!
  
#*A Strongly Competitive Randomized Paging Algorithm.
#@Lyle A. McGeoch,Daniel Dominic Sleator
#t1991
#cAlgorithmica
#index750438
#% 
#!
  
#*Understanding the Implications of View Update Policies.
#@Claudia Bauzer Medeiros,Frank Wm. Tompa
#t1986
#cAlgorithmica
#index750439
#%1118227
#%1118305
#%545014
#%545145
#%545206
#%951504
#%545485
#%599744
#%599766
#%545456
#%643930
#!
  
#*Introduction: New Approaches to Linear Programming.
#@Nimrod Megiddo
#t1986
#cAlgorithmica
#index750440
#% 
#!
  
#*Extending NC and RNC Algorithms.
#@Nimrod Megiddo
#t1989
#cAlgorithmica
#index750441
#% 
#!
  
#*On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm.
#@Kurt Mehlhorn,Petra Mutzel
#t1996
#cAlgorithmica
#index750442
#% 
#!
  
#*Dynamic Fractional Cascading.
#@Kurt Mehlhorn,Stefan Näher
#t1990
#cAlgorithmica
#index750443
#% 
#!
  
#*Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs.
#@Kurt Mehlhorn,Franco P. Preparata,Majid Sarrafzadeh
#t1986
#cAlgorithmica
#index750444
#% 
#!
  
#*Scanning Multiple Sequences Via Cache Memory.
#@Kurt Mehlhorn,Peter Sanders
#t2003
#cAlgorithmica
#index750445
#% 
#!
  
#*Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time.
#@Kurt Mehlhorn,R. Sundar,Christian Uhrig
#t1997
#cAlgorithmica
#index750446
#% 
#!
  
#*Average-Case Analysis for a Simple Compression Algorithm.
#@Donatella Merlini,Renzo Sprugnoli,M. Cecilia Verri
#t1998
#cAlgorithmica
#index750447
#% 
#!
  
#*Seven Fingers Allow Force-Torque Closure Grasps on Any Convex Polyhedron.
#@Walter Meyer
#t1993
#cAlgorithmica
#index750448
#% 
#!
  
#*An O(ND) Difference Algorithm and Its Variations.
#@Eugene W. Myers
#t1986
#cAlgorithmica
#index750449
#% 
#!
  
#*On the Number of Eulerian Orientations of a Graph.
#@Milena Mihail,Peter Winkler
#t1996
#cAlgorithmica
#index750450
#% 
#!
  
#*Shortest Path Geometric Rounding.
#@Victor Milenkovic
#t2000
#cAlgorithmica
#index750451
#% 
#!
  
#*Multiple Translational Containment. Part II: Exact Algorithms.
#@Victor Milenkovic
#t1997
#cAlgorithmica
#index750452
#% 
#!
  
#*Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs.
#@Olgica Milenkovic,Kevin J. Compton
#t2005
#cAlgorithmica
#index750453
#% 
#!
  
#*Bounding the Inefficiency of Length-Restricted Prefix Codes.
#@Ruy Luiz Milidiú,Eduardo Sany Laber
#t2001
#cAlgorithmica
#index750454
#% 
#!
  
#*Computing Convexity Properties of Images on a Pyramid Computer.
#@Russ Miller,Quentin F. Stout
#t1991
#cAlgorithmica
#index750455
#% 
#!
  
#*Tree-Based Parallel Algorithm Design.
#@Gary L. Miller,Shang-Hua Teng
#t1997
#cAlgorithmica
#index750456
#% 
#!
  
#*Bidirectional Edges Problem: Part I-A Simple Algorithm.
#@Bhubaneswar Mishra
#t1996
#cAlgorithmica
#index750457
#% 
#!
  
#*On the Existence and Synthesis of Multifinger Positive Grips.
#@Bhubaneswar Mishra,Jacob T. Schwartz,Micha Sharir
#t1987
#cAlgorithmica
#index750458
#% 
#!
  
#*A Linear-Time Algorithm for Finding an Ambitus.
#@Bhubaneswar Mishra,Robert Endre Tarjan
#t1992
#cAlgorithmica
#index750459
#% 
#!
  
#*L_1 Shortest Paths Among Polygonal Obstacles in the Plane.
#@Joseph S. B. Mitchell
#t1992
#cAlgorithmica
#index750460
#% 
#!
  
#*Minimum-Link Paths Among Obstacles in the Plan.
#@Joseph S. B. Mitchell,Günter Rote,Gerhard J. Woeginger
#t1992
#cAlgorithmica
#index750461
#% 
#!
  
#*An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.
#@Flávio Keidi Miyazawa,Yoshiko Wakabayashi
#t1997
#cAlgorithmica
#index750462
#% 
#!
  
#*Complexity and Modeling Aspects of Mesh Refinement into Quadrilater.
#@Rolf H. Möhring,Matthias Müller-Hannemann
#t2000
#cAlgorithmica
#index750463
#% 
#!
  
#*Preface.
#@Rolf H. Möhring,Rajeev Raman
#t2005
#cAlgorithmica
#index750464
#% 
#!
  
#*Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm.
#@Dipen Moitra
#t1991
#cAlgorithmica
#index750465
#% 
#!
  
#*Computing Euclidean Maximum Spanning Trees.
#@Clyde L. Monma,Mike Paterson,Subhash Suri,F. Frances Yao
#t1990
#cAlgorithmica
#index750466
#% 
#!
  
#*Counting Distinct Strings.
#@Dennis Moore,William F. Smyth,D. Miller
#t1999
#cAlgorithmica
#index750467
#% 
#!
  
#*Heuristics for Rapidly Four-Coloring Large Planar Graphs.
#@Craig A. Morgenstern,Henry D. Shapiro
#t1991
#cAlgorithmica
#index750468
#% 
#!
  
#*Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes.
#@Michela Mortara,Giuseppe Patanè,Michela Spagnuolo,Bianca Falcidieno,Jarek Rossignac
#t2003
#cAlgorithmica
#index750469
#% 
#!
  
#*Introduction.
#@Michele Mosca,Alain Tapp
#t2002
#cAlgorithmica
#index750470
#% 
#!
  
#*Programming Simultaneous Actions Using Common Knowledge.
#@Yoram Moses,Mark R. Tuttle
#t1988
#cAlgorithmica
#index750471
#% 
#!
  
#*Guest Editors' Foreword.
#@Rajeev Motwani,Prabhakar Raghavan
#t2000
#cAlgorithmica
#index750472
#% 
#!
  
#*Maximum Matchings in Planar Graphs via Gaussian Elimination.
#@Marcin Mucha,Piotr Sankowski
#t2006
#cAlgorithmica
#index750473
#% 
#!
  
#*Distributed Match-Making.
#@Sape J. Mullender,Paul M. B. Vitányi
#t1988
#cAlgorithmica
#index750474
#% 
#!
  
#*Randomized Geometric Algorithms and Pseudorandom Generators.
#@Ketan Mulmuley
#t1996
#cAlgorithmica
#index750475
#% 
#!
  
#*Fast Stable In-Place Sorting with Data Moves.
#@J. Ian Munro,Venkatesh Raman
#t1996
#cAlgorithmica
#index750476
#% 
#!
  
#*Detecting False Matches in String-Matching Algorithms.
#@S. Muthukrishnan
#t1997
#cAlgorithmica
#index750477
#% 
#!
  
#*A Sublinear Algorithm for Approximate Keyword Searching.
#@Eugene W. Myers
#t1994
#cAlgorithmica
#index750478
#% 
#!
  
#*Guest Editor's Foreword: Special Issue on Computational Molecular Biology.
#@Eugene W. Myers
#t1995
#cAlgorithmica
#index750479
#% 
#!
  
#*Point Placement Algorithms for Delaunay Triangulation of Polygonal Domains.
#@Lee R. Nackman,Vijay Srinivasan
#t1994
#cAlgorithmica
#index750480
#% 
#!
  
#*A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
#@Hiroshi Nagamochi,Toshihide Ibaraki
#t1992
#cAlgorithmica
#index750481
#% 
#!
  
#*A Simplified () Time Edge-Splitting Algorithm in Undirected Graphs.
#@Hiroshi Nagamochi,S. Nakamura,Toshihide Ibaraki
#t2000
#cAlgorithmica
#index750482
#% 
#!
  
#*Compact Routing on Chordal Rings of Degree 4.
#@Lata Narayanan,Jaroslav Opatrny
#t1999
#cAlgorithmica
#index750483
#% 
#!
  
#*All-to-All Optical Routing in Chordal Rings of Degree 4.
#@Lata Narayanan,Jaroslav Opatrny,Dominique Sotteau
#t2001
#cAlgorithmica
#index750484
#% 
#!
  
#*Static Frequency Assignment in Cellular Networks.
#@Lata Narayanan,Sunil M. Shende
#t2001
#cAlgorithmica
#index750485
#% 
#!
  
#*Corrigendum: Static Frequency Assignment in Cellular Networks.
#@Lata Narayanan,Sunil M. Shende
#t2002
#cAlgorithmica
#index750486
#% 
#!
  
#*Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.
#@Enrico Nardelli,Guido Proietti,Peter Widmayer
#t2003
#cAlgorithmica
#index750487
#% 
#!
  
#*Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.
#@Enrico Nardelli,Guido Proietti,Peter Widmayer
#t2004
#cAlgorithmica
#index750488
#% 
#!
  
#*Improving an Algorithm for Approximate Pattern Matching.
#@Gonzalo Navarro,Ricardo A. Baeza-Yates
#t2001
#cAlgorithmica
#index750489
#% 
#!
  
#*Binary Searching with Nonuniform Costs and Its Application to Text Retrieval.
#@Gonzalo Navarro,Ricardo A. Baeza-Yates,Eduardo F. Barbosa,Nivio Ziviani,Walter Cunto
#t2000
#cAlgorithmica
#index750490
#% 
#!
  
#*New Techniques for Regular Expression Searching.
#@Gonzalo Navarro,Mathieu Raffinot
#t2004
#cAlgorithmica
#index750491
#% 
#!
  
#*Homotopy Techniques in Linear Programming.
#@J. L. Nazareth
#t1986
#cAlgorithmica
#index750492
#% 
#!
  
#*The Implementation of Linear Programming Algorithms Bases on Homotopies.
#@J. L. Nazareth
#t1996
#cAlgorithmica
#index750493
#% 
#!
  
#*String Layouts for a Redundant Array of Inexpensive Disks.
#@Lee Aaron Newberg,D. Wolfe
#t1994
#cAlgorithmica
#index750494
#% 
#!
  
#*On the Sum Coloring Problem on Interval Graphs.
#@S. Nicoloso,Majid Sarrafzadeh,X. Song
#t1999
#cAlgorithmica
#index750495
#% 
#!
  
#*Algorithms for P-Comparability Graph Recognition and Acyclic P-Transitive Orientation.
#@Stavros D. Nikolopoulos,Leonidas Palios
#t2004
#cAlgorithmica
#index750496
#% 
#!
  
#*An Experimental Study of Compression Methods for Dynamic Tries.
#@Stefan Nilsson,Matti Tikkanen
#t2002
#cAlgorithmica
#index750497
#% 
#!
  
#*Foreword.
#@Takao Nishizeki,Roberto Tamassia,Dorothea Wagner
#t2000
#cAlgorithmica
#index750498
#% 
#!
  
#*Blocking for External Graph Searching.
#@Mark H. Nodine,Michael T. Goodrich,Jeffrey Scott Vitter
#t1996
#cAlgorithmica
#index750499
#% 
#!
  
#*Splitting a Configuration in a Simplex.
#@Kazumiti Numata,Takeshi Tokuyama
#t1993
#cAlgorithmica
#index750500
#% 
#!
  
#*Approximating Rooted Connectivity Augmentation Problems.
#@Zeev Nutov
#t2006
#cAlgorithmica
#index750501
#% 
#!
  
#*Motion Planning with Inertial Constraints.
#@Colm Ó'Dúnlaing
#t1987
#cAlgorithmica
#index750502
#% 
#!
  
#*Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.
#@Colm Ó'Dúnlaing,Micha Sharir,Chee-Keng Yap
#t1987
#cAlgorithmica
#index750503
#% 
#!
  
#*Simulating Boolean Circuits on a DNA Computer.
#@Mitsunori Ogihara,Animesh Ray
#t1999
#cAlgorithmica
#index750504
#% 
#!
  
#*A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options.
#@Kenichiro Ohta,Kunihiko Sadakane,Akiyoshi Shioura,Takeshi Tokuyama
#t2005
#cAlgorithmica
#index750505
#% 
#!
  
#*A New Algorithm for the Largest Empty Rectangle Problem.
#@M. Orlowski
#t1990
#cAlgorithmica
#index750506
#% 
#!
  
#*An Improved Technique for Output-Sensitive Hidden Surface Removal.
#@Mark H. Overmars,Micha Sharir
#t1994
#cAlgorithmica
#index750507
#% 
#!
  
#*Improved Bounds for Electing a Leader in a Synchronous Ring.
#@Mark H. Overmars,Nicola Santoro
#t1997
#cAlgorithmica
#index750508
#% 
#!
  
#*Weaving Patterns of Lines and Line Segments in Space.
#@János Pach,Richard Pollack,Emo Welzl
#t1993
#cAlgorithmica
#index750509
#% 
#!
  
#*Applications of the Crossing Number.
#@János Pach,Farhad Shahrokhi,Mario Szegedy
#t1996
#cAlgorithmica
#index750510
#% 
#!
  
#*Optimal Graph Constraint Reduction for Symbolic Layout Compaction.
#@Peichen Pan,Sai-keung Dong,C. L. Liu
#t1997
#cAlgorithmica
#index750511
#% 
#!
  
#*Area Minimization for Hierarchical Floorplans.
#@Peichen Pan,Weiping Shi,C. L. Liu
#t1996
#cAlgorithmica
#index750512
#% 
#!
  
#*Certification of Numerical Computation of the Sign of the Determinant of a Matrix.
#@Victor Y. Pan,Yanqiang Yu
#t2001
#cAlgorithmica
#index750513
#% 
#!
  
#*Smallest Components in Decomposable Structures: Exp-Log Class.
#@Daniel Panario,L. Bruce Richmond
#t2001
#cAlgorithmica
#index750514
#% 
#!
  
#*Exact Largest and Smallest Size of Components.
#@Daniel Panario,L. Bruce Richmond
#t2001
#cAlgorithmica
#index750515
#% 
#!
  
#*Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.
#@Alois Panholzer,Helmut Prodinger
#t1998
#cAlgorithmica
#index750516
#% 
#!
  
#*Bottom-Up Mergesort - a Detailed Analysis.
#@Wolfgang Panny,Helmut Prodinger
#t1995
#cAlgorithmica
#index750517
#% 
#!
  
#*Constraint-Based Processing of Multiway Spatial Joins.
#@Dimitris Papadias,Nikos Mamoulis,Yannis Theodoridis
#t2001
#cAlgorithmica
#index750518
#% 
#!
  
#*Designing Secure Communication Protocols from Trust Specification.
#@Christos H. Papadimitriou,P. Venkat Rangan,Martha Sideri
#t1994
#cAlgorithmica
#index750519
#% 
#!
  
#*Optimal Piecewise Linear Motion of an Object Among Obstacles.
#@Christos H. Papadimitriou,Ellen B. Silverberg
#t1987
#cAlgorithmica
#index750520
#% 
#!
  
#*The Hausdorff Voronoi Diagram of Point Clusters in the Plane.
#@Evanthia Papadopoulou
#t2004
#cAlgorithmica
#index750521
#% 
#!
  
#*A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains.
#@Evanthia Papadopoulou,D. T. Lee
#t1998
#cAlgorithmica
#index750522
#% 
#!
  
#*Efficient Orthogonal Drawings of High Degree Graphs.
#@Achilleas Papakostas,Ioannis G. Tollis
#t2000
#cAlgorithmica
#index750523
#% 
#!
  
#*An Optimal Time Bound for Oblivious Routing.
#@Ian Parberry
#t1990
#cAlgorithmica
#index750524
#% 
#!
  
#*Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map.
#@Chee-Keng Yap
#t1988
#cAlgorithmica
#index750525
#% 
#!
  
#*Algorithms for a Class of Isotonic Regression Problems.
#@Panos M. Pardalos,Guoliang Xue
#t1999
#cAlgorithmica
#index750526
#% 
#!
  
#*Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery.
#@Laxmi Parida,Dan Geiger
#t1999
#cAlgorithmica
#index750527
#% 
#!
  
#*Parallel Computation of the Topology of Level Sets.
#@Valerio Pascucci,Kree Cole-McLaughlin
#t2003
#cAlgorithmica
#index750528
#% 
#!
  
#*A Full Sensing Window Random-Access Algorithm for Messages with Strict Delay Constraints.
#@Michael Paterakis,Leonidas Georgiadis,Panayota Papantoni-Kazakos
#t1989
#cAlgorithmica
#index750529
#% 
#!
  
#*Improved Sorting Networks with O(log N) Depth.
#@Mike Paterson
#t1990
#cAlgorithmica
#index750530
#% 
#!
  
#*Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees.
#@Shaunak Pawagi,Owen Kaser
#t1993
#cAlgorithmica
#index750531
#% 
#!
  
#*New Results in Minimum-Comparison Sorting.
#@Marcin Peczarski
#t2004
#cAlgorithmica
#index750532
#% 
#!
  
#*Randomized Approximation of Bounded Multicovering Problems.
#@David Peleg,Gideon Schechtman,Avishai Wool
#t1997
#cAlgorithmica
#index750533
#% 
#!
  
#*Ray Shooting on Triangles in 3-Space.
#@Marco Pellegrini
#t1993
#cAlgorithmica
#index750534
#% 
#!
  
#*On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching.
#@Marco Pellegrini
#t1997
#cAlgorithmica
#index750535
#% 
#!
  
#*Graph Searching on Some Subclasses of Chordal Graphs.
#@Sheng-Lung Peng,Chuan Yi Tang,Ming-Tat Ko,Chin-Wen Ho,Tsan-sheng Hsu
#t2000
#cAlgorithmica
#index750536
#% 
#!
  
#*The General Maximum Matching Algorithm of Micali and Vazirani.
#@Paul A. Peterson,Michael C. Loui
#t1988
#cAlgorithmica
#index750537
#% 
#!
  
#*DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs.
#@Pavel A. Pevzner
#t1995
#cAlgorithmica
#index750538
#% 
#!
  
#*Multiple Filtration and Approximate Pattern Matching.
#@Pavel A. Pevzner,Michael S. Waterman
#t1995
#cAlgorithmica
#index750539
#% 
#!
  
#*Optimal Time-Critical Scheduling via Resource Augmentation.
#@Cynthia A. Phillips,Clifford Stein,Eric Torng,Joel Wein
#t2002
#cAlgorithmica
#index750540
#% 
#!
  
#*On-Line Load Balancing and Network Flow.
#@Steven J. Phillips,Jeffery Westbrook
#t1998
#cAlgorithmica
#index750541
#% 
#!
  
#*Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs.
#@Yaron Pinto,Ron Shamir
#t1994
#cAlgorithmica
#index750542
#% 
#!
  
#*Further Thoughts on the Syntenic Distance between Genomes.
#@Nadia Pisanti,Marie-France Sagot
#t2002
#cAlgorithmica
#index750543
#% 
#!
  
#*Dynamic Programming on the Word RAM.
#@David Pisinger
#t2003
#cAlgorithmica
#index750544
#% 
#!
  
#*Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors.
#@Patricio V. Poblete
#t2001
#cAlgorithmica
#index750545
#% 
#!
  
#*Labeling Points with Weights.
#@Sheung-Hung Poon,Chan-Su Shin,Tycho Strijk,Takeaki Uno,Alexander Wolff
#t2003
#cAlgorithmica
#index750546
#% 
#!
  
#*Minimizing Makespan in Batch Machine Scheduling.
#@Chung Keung Poon,Pixing Zhang
#t2004
#cAlgorithmica
#index750547
#% 
#!
  
#*Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts.
#@M. J. Post,Aaron Kershenbaum,P. E. Sarachik
#t1989
#cAlgorithmica
#index750548
#% 
#!
  
#*The Optimal Control Approach to Generalized Multiprocessor Scheduling.
#@G. N. Srinivasa Prasanna,Bruce R. Musicus
#t1996
#cAlgorithmica
#index750549
#% 
#!
  
#*Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
#@Franco P. Preparata,Jeffrey Scott Vitter,Mariette Yvinec
#t1992
#cAlgorithmica
#index750550
#% 
#!
  
#*A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order.
#@Paul Pritchard
#t1999
#cAlgorithmica
#index750551
#% 
#!
  
#*A q-Analogue of the Path Length of Binary Search Trees.
#@Helmut Prodinger
#t2001
#cAlgorithmica
#index750552
#% 
#!
  
#*Average-Case Analysis of Algorithms - Preface.
#@Helmut Prodinger,Wojciech Szpankowski
#t2001
#cAlgorithmica
#index750553
#% 
#!
  
#*Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.
#@Helmut Prodinger,Wojciech Szpankowski
#t1998
#cAlgorithmica
#index750554
#% 
#!
  
#*Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems.
#@J. Scott Provan
#t1992
#cAlgorithmica
#index750555
#% 
#!
  
#*A Paradigm for Listing (s, t)-Cuts in Graphs.
#@J. Scott Provan,Douglas R. Shier
#t1996
#cAlgorithmica
#index750556
#% 
#!
  
#*A Comparison of Multicast Pull Models.
#@Kirk Pruhs,Patchrawat Uthaisombut
#t2005
#cAlgorithmica
#index750557
#% 
#!
  
#*Effective Routing and Scheduling in Adversarial Queueing Networks.
#@Jay Sethuraman,Chung-Piaw Teo
#t2005
#cAlgorithmica
#index750558
#% 
#!
  
#*A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons.
#@Jianbo Qian,Cao An Wang
#t2004
#cAlgorithmica
#index750559
#% 
#!
  
#*Staircase Visibility and Computation of Kernels.
#@Sven Schuierer,Derick Wood
#t1995
#cAlgorithmica
#index750560
#% 
#!
  
#*Editor's Foreword: Special Issue on Computational Geometry.
#@Chee-Keng Yap
#t1989
#cAlgorithmica
#index750561
#% 
#!
  
#*The Quantum Complexity of Set Membership.
#@Jaikumar Radhakrishnan,Pranab Sen,Srinivasan Venkatesh
#t2002
#cAlgorithmica
#index750562
#% 
#!
  
#*New Bounds for Multidimensional Packing.
#@Steven S. Seiden,Rob van Stee
#t2003
#cAlgorithmica
#index750563
#% 
#!
  
#*Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results.
#@Tomasz Radzik,Andrew V. Goldberg
#t1994
#cAlgorithmica
#index750564
#% 
#!
  
#*The List Update Problem: Improved Bounds for the Counter Scheme.
#@Hadas Shachnai,Micha Hofri
#t1998
#cAlgorithmica
#index750565
#% 
#!
  
#*Guest Editor's Foreword: Special Issue on On-Line Algorithms.
#@Prabhakar Raghavan
#t1994
#cAlgorithmica
#index750566
#% 
#!
  
#*On Two Class-Constrained Versions of the Multiple Knapsack Problem.
#@Hadas Shachnai,Tami Tamir
#t2001
#cAlgorithmica
#index750567
#% 
#!
  
#*Multiterminal Global Routing: A Deterministic Approximation Scheme.
#@Prabhakar Raghavan,Clark D. Thompson
#t1991
#cAlgorithmica
#index750568
#% 
#!
  
#*Finding Effective ``Force Targets'' for Two-Dimensional Multifinger Frictional Grips.
#@Jacob T. Schwartz,Micha Sharir
#t1992
#cAlgorithmica
#index750569
#% 
#!
  
#*Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane.
#@Sanguthevar Rajasekaran,Suneeta Ramaswami
#t2002
#cAlgorithmica
#index750570
#% 
#!
  
#*An Optimal Algorithm for the On-Line Closest-Pair Problem.
#@Christian Schwarz,Michiel H. M. Smid,Jack Snoeyink
#t1994
#cAlgorithmica
#index750571
#% 
#!
  
#*An ( (log log /log )) Time Algorithm for All Pairs Shortest Path.
#@Yijie Han
#t2008
#cAlgorithmica
#index750572
#% 
#!
  
#*Optimal Routing Algorithms for Mesh-Connected Processor Arrays.
#@Sanguthevar Rajasekaran,Thanasis Tsantilas
#t1992
#cAlgorithmica
#index750573
#% 
#!
  
#*Parallel Computation of Disease Transforms.
#@Otfried Schwarzkopf
#t1991
#cAlgorithmica
#index750574
#% 
#!
  
#*Finding the Closed Partition of a Planar Graph.
#@Vijaya Ramachandran,Honghua Yang
#t1994
#cAlgorithmica
#index750575
#% 
#!
  
#*Parallel Computation of Distance Transforms - Erratum.
#@Otfried Schwarzkopf
#t1992
#cAlgorithmica
#index750576
#% 
#!
  
#*An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.
#@Vijaya Ramachandran,Honghua Yang
#t1997
#cAlgorithmica
#index750577
#% 
#!
  
#*Assembly Sequences for Polyhedra.
#@Achim Schweikard,Randall H. Wilson
#t1995
#cAlgorithmica
#index750578
#% 
#!
  
#*Solving Systems of Difference Constraints Incrementally.
#@G. Ramalingam,Junehwa Song,Leo Joskowicz,Raymond E. Miller
#t1999
#cAlgorithmica
#index750579
#% 
#!
  
#*Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints.
#@Hadas Shachnai,Tami Tamir
#t2002
#cAlgorithmica
#index750580
#% 
#!
  
#*Average-Case Analysis of the Modified Harmonic Algorithm.
#@Prakash V. Ramanan,Kazuhiro Tsuga
#t1989
#cAlgorithmica
#index750581
#% 
#!
  
#*Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
#@Hadas Shachnai,Tami Tamir,Gerhard J. Woeginger
#t2005
#cAlgorithmica
#index750582
#% 
#!
  
#*A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs.
#@P. B. Ramprasad,C. Pandu Rangan
#t1993
#cAlgorithmica
#index750583
#% 
#!
  
#*An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations.
#@Gary M. Shute,Linda L. Deneen,Clark D. Thomborson
#t1991
#cAlgorithmica
#index750584
#% 
#!
  
#*The Temporal Precedence Problem.
#@Desh Ranjan,Enrico Pontelli,Gopal Gupta,Luc Longpré
#t2000
#cAlgorithmica
#index750585
#% 
#!
  
#*Drawings of Graphs on Surfaces with Few Crossings.
#@Farhad Shahrokhi,László A. Székely,Ondrej Sýkora,Imrich Vrto
#t1996
#cAlgorithmica
#index750586
#% 
#!
  
#*The Rectilinear Steiner Arborescence Problem.
#@Sailesh K. Rao,P. Sadayappan,Frank K. Hwang,Peter W. Shor
#t1992
#cAlgorithmica
#index750587
#% 
#!
  
#*Algorithms for Corner Stitched Data-Structures.
#@Mark Shand
#t1987
#cAlgorithmica
#index750588
#% 
#!
  
#*Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
#@R. Ravi,Madhav V. Marathe,S. S. Ravi,Daniel J. Rosenkrantz,Harry B. Hunt III
#t2001
#cAlgorithmica
#index750589
#% 
#!
  
#*Classification Accuracy Based on Observed Margin.
#@John Shawe-Taylor
#t1998
#cAlgorithmica
#index750590
#% 
#!
  
#*Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
#@R. Ravi,David P. Williamson
#t2002
#cAlgorithmica
#index750591
#% 
#!
  
#*Generalization of a Suffix Tree for RNA Structural Pattern Matching.
#@Tetsuo Shibuya
#t2004
#cAlgorithmica
#index750592
#% 
#!
  
#*An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
#@R. Ravi,David P. Williamson
#t1997
#cAlgorithmica
#index750593
#% 
#!
  
#*One-by-One Cleaning for Practical Parallel List Ranking.
#@Jop F. Sibeyn
#t2002
#cAlgorithmica
#index750594
#% 
#!
  
#*Contextual Building Typification in Automated Map Generalization.
#@N. Regnauld
#t2001
#cAlgorithmica
#index750595
#% 
#!
  
#*A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space.
#@Shmuel Sifrony,Micha Sharir
#t1987
#cAlgorithmica
#index750596
#% 
#!
  
#*On Pattern Frequency Occurrences in a Markovian Sequence.
#@Mireille Régnier,Wojciech Szpankowski
#t1998
#cAlgorithmica
#index750597
#% 
#!
  
#*Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces.
#@Isabelle Sivignon,Florent Dupont,Jean-Marc Chassery
#t2003
#cAlgorithmica
#index750598
#% 
#!
  
#*Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input.
#@John H. Reif
#t2000
#cAlgorithmica
#index750599
#% 
#!
  
#*Problems in Geometric Probing.
#@Steven Skiena
#t1989
#cAlgorithmica
#index750600
#% 
#!
  
#*Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix.
#@John H. Reif
#t2001
#cAlgorithmica
#index750601
#% 
#!
  
#*How To Find Steiner Minimal Trees in Euclidean d-Space.
#@Warren D. Smith
#t1992
#cAlgorithmica
#index750602
#% 
#!
  
#*Parallel Biomolecular Computation: Models and Simulations.
#@John H. Reif
#t1999
#cAlgorithmica
#index750603
#% 
#!
  
#*Steiner Tree Problems.
#@Warren D. Smith,Peter W. Shor
#t1992
#cAlgorithmica
#index750604
#% 
#!
  
#*Movement Planning in the Presence of Flows.
#@John H. Reif,Zheng Sun
#t2004
#cAlgorithmica
#index750605
#% 
#!
  
#*On a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion.
#@Alex J. Smola,Bernhard Schölkopf
#t1998
#cAlgorithmica
#index750606
#% 
#!
  
#*Optimal Randomized Parallel Algorithms for Computational Geometry.
#@John H. Reif,Sandeep Sen
#t1992
#cAlgorithmica
#index750607
#% 
#!
  
#*Stochastic Analysis of Shell Sort.
#@Robert T. Smythe,J. Wellner
#t2001
#cAlgorithmica
#index750608
#% 
#!
  
#*Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems.
#@John H. Reif,Paul G. Spirakis
#t1992
#cAlgorithmica
#index750609
#% 
#!
  
#*Efficient Simulated Annealing on Fractal Energy Landscapes.
#@Gregory B. Sorkin
#t1991
#cAlgorithmica
#index750610
#% 
#!
  
#*Continuous Alternation: The Complexity of Pursuit in Continuous Domains.
#@John H. Reif,Stephen R. Tate
#t1993
#cAlgorithmica
#index750611
#% 
#!
  
#*Provably Good Pattern Generators for a Random Pattern Test.
#@Thomas H. Spencer
#t1994
#cAlgorithmica
#index750612
#% 
#!
  
#*Randomized Competitive Algorithms for the List Update Problem.
#@Nick Reingold,Jeffery Westbrook,Daniel Dominic Sleator
#t1994
#cAlgorithmica
#index750613
#% 
#!
  
#*Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
#@Michael J. Spriggs,J. Mark Keil,Sergei Bespamyatnikh,Michael Segal,Jack Snoeyink
#t2004
#cAlgorithmica
#index750614
#% 
#!
  
#*Point Set Pattern Matching in d-Dimensions.
#@Pedro Jussieu de Rezende,D. T. Lee
#t1995
#cAlgorithmica
#index750615
#% 
#!
  
#*Refinements to Nearest-Neighbor Searching in k-Dimensional Trees.
#@Robert F. Sproull
#t1991
#cAlgorithmica
#index750616
#% 
#!
  
#*Classes of Cost Functions for String Edit Distance.
#@Stephen V. Rice,Horst Bunke,Thomas A. Nartker
#t1997
#cAlgorithmica
#index750617
#% 
#!
  
#*Recurrence Relations on Heaps.
#@Renzo Sprugnoli
#t1996
#cAlgorithmica
#index750618
#% 
#!
  
#*Fast Heuristic Algorithms for Rectilinear Steiner Trees.
#@Dana S. Richards
#t1989
#cAlgorithmica
#index750619
#% 
#!
  
#*Geometric Eccentricity and the Complexity of Manipulation Plans.
#@A. Frank van der Stappen,Kenneth Y. Goldberg
#t2000
#cAlgorithmica
#index750620
#% 
#!
  
#*A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.
#@Dana S. Richards,Jeffrey S. Salowe
#t1992
#cAlgorithmica
#index750621
#% 
#!
  
#*Analysis of Finite Length Annealing Schedules.
#@Philip N. Strenski,Scott Kirkpatrick
#t1991
#cAlgorithmica
#index750622
#% 
#!
  
#*Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For?
#@Elon Rimon
#t1997
#cAlgorithmica
#index750623
#% 
#!
  
#*Grasping and In-Hand Manipulation: Geometry and Algorithms.
#@Attawith Sudsang
#t2000
#cAlgorithmica
#index750624
#% 
#!
  
#*A Projective Method for Linear Programming with Box-Type Constraints.
#@G. Rinaldi
#t1986
#cAlgorithmica
#index750625
#% 
#!
  
#*An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.
#@Sairam Subramanian,Roberto Tamassia,Jeffrey Scott Vitter
#t1995
#cAlgorithmica
#index750626
#% 
#!
  
#*Moving a Disc Between Polygons.
#@Hans Rohnert
#t1991
#cAlgorithmica
#index750627
#% 
#!
  
#*A Fast Algorithm for Computing Sparse Visibility Graphs.
#@S. Sudarshan,C. Pandu Rangan
#t1990
#cAlgorithmica
#index750628
#% 
#!
  
#*A Theoretical Framework for Simulated Annealing.
#@Fabio Romeo,Alberto L. Sangiovanni-Vincentelli
#t1991
#cAlgorithmica
#index750629
#% 
#!
  
#*Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms.
#@Kokichi Sugihara,Masao Iri,Hiroshi Inagaki,T. Imai
#t2000
#cAlgorithmica
#index750630
#% 
#!
  
#*An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling.
#@Theodore H. Romer,Louis E. Rosier
#t1997
#cAlgorithmica
#index750631
#% 
#!
  
#*An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs.
#@Sivaprakasam Sunder,Xin He
#t1996
#cAlgorithmica
#index750632
#% 
#!
  
#*Order-k Voronoi Diagrams of Sites with Additive Weights in the Plane.
#@Harald Rosenberger
#t1991
#cAlgorithmica
#index750633
#% 
#!
  
#*Floorplanning by Graph Dualization: L-shaped Modules.
#@Yachyang Sun,Majid Sarrafzadeh
#t1993
#cAlgorithmica
#index750634
#% 
#!
  
#*Free-Form Pose Estimation by Using Twist Representations.
#@Bodo Rosenhahn,Christian Perwass,Gerald Sommer
#t2003
#cAlgorithmica
#index750635
#% 
#!
  
#*Shortest Paths in Euclidean Graphs.
#@Robert Sedgewick,Jeffrey Scott Vitter
#t1986
#cAlgorithmica
#index750636
#% 
#!
  
#*Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.
#@Daniel J. Rosenkrantz,Lin Yu,S. S. Ravi
#t2001
#cAlgorithmica
#index750637
#% 
#!
  
#*Compressing Two-Dimensional Routing Tables.
#@Subhash Suri,Tuomas Sandholm,Priyank Ramesh Warkhede
#t2003
#cAlgorithmica
#index750638
#% 
#!
  
#*On the Analysis of Stochastic Divide and Conquer Algorithms.
#@Uwe Rösler
#t2001
#cAlgorithmica
#index750639
#% 
#!
  
#*Algorithms for Multicommodity Flows in Planar Graphs.
#@Hitoshi Suzuki,Takao Nishizeki,Nobuji Saito
#t1989
#cAlgorithmica
#index750640
#% 
#!
  
#*The Contraction Method for Recursive Algorithms.
#@Uwe Rösler,Ludger Rüschendorf
#t2001
#cAlgorithmica
#index750641
#% 
#!
  
#*Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.
#@Maxim Sviridenko
#t2001
#cAlgorithmica
#index750642
#% 
#!
  
#*Designing Checkers for Programs that Run in Parallel.
#@Ronitt Rubinfeld
#t1996
#cAlgorithmica
#index750643
#% 
#!
  
#*On the Height of Digital Trees and Related Problems.
#@Wojciech Szpankowski
#t1991
#cAlgorithmica
#index750644
#% 
#!
  
#*Graham's Problem on Shortest Networks for Points on a Circle.
#@J. H. Rubinstein,D. A. Thomas
#t1992
#cAlgorithmica
#index750645
#% 
#!
  
#*An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs.
#@Bala Swaminathan,Kenneth J. Goldman
#t1998
#cAlgorithmica
#index750646
#% 
#!
  
#*A Class of Asymptotically Stable Algorithms for Learning-Rate Adaptation.
#@Stefan M. Rüger
#t1998
#cAlgorithmica
#index750647
#% 
#!
  
#*Primal-Dual Algorithms for Connected Facility Location Problems.
#@Chaitanya Swamy,Amit Kumar
#t2004
#cAlgorithmica
#index750648
#% 
#!
  
#*Finding the k Shortest Paths in Parallel.
#@Eric Ruppert
#t2000
#cAlgorithmica
#index750649
#% 
#!
  
#*Shortest Noncrossing Paths in Plane Graphs.
#@Jun-ya Takahashi,Hitoshi Suzuki,Takao Nishizeki
#t1996
#cAlgorithmica
#index750650
#% 
#!
  
#*Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.
#@G. Sajith,Sanjeev Saxena
#t2000
#cAlgorithmica
#index750651
#% 
#!
  
#*Finding a Region with the Minimum Total Distance from Prescribed Terminals.
#@Yoshiyuki Takao
#t2003
#cAlgorithmica
#index750652
#% 
#!
  
#*Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols.
#@Michael E. Saks,Shiyu Zhou
#t2001
#cAlgorithmica
#index750653
#% 
#!
  
#*Foreword.
#@Tadao Takaoka
#t2003
#cAlgorithmica
#index750654
#% 
#!
  
#*Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.
#@Laura A. Sanchis
#t2002
#cAlgorithmica
#index750655
#% 
#!
  
#*Subcubic Cost Algorithms for the All Pairs Shortest Path Problem.
#@Tadao Takaoka
#t1998
#cAlgorithmica
#index750656
#% 
#!
  
#*Fast Concurrent Access to Parallel Disks.
#@Peter Sanders,Sebastian Egner,Jan H. M. Korst
#t2003
#cAlgorithmica
#index750657
#% 
#!
  
#*A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart.
#@Uwe Schöning
#t2002
#cAlgorithmica
#index750658
#% 
#!
  
#*Random Sampling of Euler Tours.
#@Prasad Tetali,Santosh Vempala
#t2001
#cAlgorithmica
#index750659
#% 
#!
  
#*Editor's Foreword.
#@Alberto L. Sangiovanni-Vincentelli
#t1991
#cAlgorithmica
#index750660
#% 
#!
  
#*Dynamic Maintenance of Planar Digraphs, with Applications.
#@Roberto Tamassia,Franco P. Preparata
#t1990
#cAlgorithmica
#index750661
#% 
#!
  
#*Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers.
#@Jorge L. C. Sanz,Robert Cypher
#t1992
#cAlgorithmica
#index750662
#% 
#!
  
#*Randomized Search Trees.
#@Raimund Seidel,Cecilia R. Aragon
#t1996
#cAlgorithmica
#index750663
#% 
#!
  
#*Maximum k-Covering of Weighted Transitive Graphs with Applications.
#@Majid Sarrafzadeh,Ruey-Der Lou
#t1993
#cAlgorithmica
#index750664
#% 
#!
  
#*Optimal Cooperative Search in Fractional Cascaded Data Structures.
#@Roberto Tamassia,Jeffrey Scott Vitter
#t1996
#cAlgorithmica
#index750665
#% 
#!
  
#*A Note on Parallel Selection on Coarse-Grained Multicomputers.
#@E. L. G. Saukas,S. W. Song
#t1999
#cAlgorithmica
#index750666
#% 
#!
  
#*Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics.
#@Shouwen Tang,Kaizhong Zhang,Xiaolin Wu
#t1996
#cAlgorithmica
#index750667
#% 
#!
  
#*Solving Some Combinatorial Problems on Arrays with One-Way Dataflow.
#@Carla D. Savage,Matthias F. M. Stallmann,Jo Ellen Perry
#t1990
#cAlgorithmica
#index750668
#% 
#!
  
#*Probabilistic Algorithms for Efficient Grasping and Fixturing.
#@Marek Teichmann,Bud Mishra
#t2000
#cAlgorithmica
#index750669
#% 
#!
  
#*Smallest Enclosing Cylinders.
#@Elmar Schömer,Jürgen Sellen,Marek Teichmann,Chee-Keng Yap
#t2000
#cAlgorithmica
#index750670
#% 
#!
  
#*Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.
#@Masafumi Yamashita,Hideki Umemoto,Ichiro Suzuki,Tsunehiko Kameda
#t2001
#cAlgorithmica
#index750671
#% 
#!
  
#*Online Randomized Multiprocessor Scheduling.
#@Steven S. Seiden
#t2000
#cAlgorithmica
#index750672
#% 
#!
  
#*An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.
#@Michael J. Todd,Bruce P. Burrell
#t1986
#cAlgorithmica
#index750673
#% 
#!
  
#*On Combined Phase 1-Phase 2 Projective Methods for Linear Programming.
#@Michael J. Todd,Yufei Wang
#t1993
#cAlgorithmica
#index750674
#% 
#!
  
#*Orthogonal Queries in Segments.
#@Takeshi Tokuyama
#t1997
#cAlgorithmica
#index750675
#% 
#!
  
#*A Unified Analysis of Paging and Caching.
#@Eric Torng
#t1998
#cAlgorithmica
#index750676
#% 
#!
  
#*Optimal Edge Ranking of Trees in Polynomial Time.
#@Pilar de la Torre,Raymond Greenlaw,Alejandro A. Schäffer
#t1995
#cAlgorithmica
#index750677
#% 
#!
  
#*Erratum: A Correction to ``Parallel Approximation Algorithms by Positive Linear Programming''.
#@Luca Trevisan
#t2000
#cAlgorithmica
#index750678
#% 
#!
  
#*Approximating Satisfiable Satisfiability Problems.
#@Luca Trevisan
#t2000
#cAlgorithmica
#index750679
#% 
#!
  
#*Parallel Approximation Algorithms by Positive Linear Programming.
#@Luca Trevisan
#t1998
#cAlgorithmica
#index750680
#% 
#!
  
#*Fast Algorithms for the Dominating Set Problem on Permutation Graphs.
#@Kuo-Hui Tsai,Wen-Lian Hsu
#t1993
#cAlgorithmica
#index750681
#% 
#!
  
#*k Best Cuts for Circular-Arc Graphs.
#@Kuo-Hui Tsai,D. T. Lee
#t1997
#cAlgorithmica
#index750682
#% 
#!
  
#*A Limit Law for Outputs in Random Recursive Circuits.
#@Tatsuie Tsukiji,Hosam M. Mahmoud
#t2001
#cAlgorithmica
#index750683
#% 
#!
  
#*On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems.
#@Levent Tunçel
#t1994
#cAlgorithmica
#index750684
#% 
#!
  
#*A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings.
#@Esko Ukkonen
#t1990
#cAlgorithmica
#index750685
#% 
#!
  
#*On-Line Construction of Suffix Trees.
#@Esko Ukkonen
#t1995
#cAlgorithmica
#index750686
#% 
#!
  
#*Approximate String Matching with Suffix Automata.
#@Esko Ukkonen,Derick Wood
#t1993
#cAlgorithmica
#index750687
#% 
#!
  
#*Parallel Complexity of Logical Query Programs.
#@Jeffrey D. Ullman,Allen Van Gelder
#t1988
#cAlgorithmica
#index750688
#% 
#!
  
#*Fast Algorithms to Enumerate All Common Intervals of Two Permutations.
#@Takeaki Uno,Mutsunori Yagiura
#t2000
#cAlgorithmica
#index750689
#% 
#!
  
#*Approximate Minimum Weight Matching on Points in k-Dimensional Space.
#@Pravin M. Vaidya
#t1989
#cAlgorithmica
#index750690
#% 
#!
  
#*Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes.
#@Brigitte Vallée
#t2001
#cAlgorithmica
#index750691
#% 
#!
  
#*Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators.
#@Brigitte Vallée
#t1998
#cAlgorithmica
#index750692
#% 
#!
  
#*A Modification of Karmarkar's Linear Programming Algorithm.
#@Robert J. Vanderbei,Marc S. Meketon,Barry A. Freedman
#t1986
#cAlgorithmica
#index750693
#% 
#!
  
#*Average-Case Analysis of the Merging Algorithm of Hwang and Lin.
#@Wenceslas Fernandez de la Vega,Alan M. Frieze,Miklos Santha
#t1998
#cAlgorithmica
#index750694
#% 
#!
  
#*Shape Algorithmics.
#@Remco C. Veltkamp
#t2003
#cAlgorithmica
#index750695
#% 
#!
  
#*Computational Complexity of Optimum Multiuser Detection.
#@Sergio Verdú
#t1989
#cAlgorithmica
#index750696
#% 
#!
  
#*The Analysis of Linear Probing Hashing with Buckets.
#@Alfredo Viola,Patricio V. Poblete
#t1998
#cAlgorithmica
#index750697
#% 
#!
  
#*Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I.
#@Jeffrey Scott Vitter
#t1988
#cAlgorithmica
#index750698
#% 
#!
  
#*Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II.
#@Jeffrey Scott Vitter
#t1988
#cAlgorithmica
#index750699
#% 
#!
  
#*Guest Editor's Introduction: Special Issue on Large-Scale Memories.
#@Jeffrey Scott Vitter
#t1994
#cAlgorithmica
#index750700
#% 
#!
  
#*Algorithms for Parallel Memory I: Two-Level Memories.
#@Jeffrey Scott Vitter,Elizabeth A. M. Shriver
#t1994
#cAlgorithmica
#index750701
#% 
#!
  
#*Algorithms for Parallel Memory II: Hierarchical Multilevel Memories.
#@Jeffrey Scott Vitter,Elizabeth A. M. Shriver
#t1994
#cAlgorithmica
#index750702
#% 
#!
  
#*Problems with Generalized Steiner Problems.
#@Stefan Voß
#t1992
#cAlgorithmica
#index750703
#% 
#!
  
#*Three Rules Suffice for Good Label Placement.
#@Frank Wagner,Alexander Wolff,Vikas Kapoor,Tycho Strijk
#t2001
#cAlgorithmica
#index750704
#% 
#!
  
#*Planning for Modular and Hybrid Fixture.
#@Aaron S. Wallack,John F. Canny
#t1997
#cAlgorithmica
#index750705
#% 
#!
  
#*Approximations for a Bottleneck Steiner Tree Problem.
#@Lusheng Wang,Ding-Zhu Du
#t2002
#cAlgorithmica
#index750706
#% 
#!
  
#*Approximation Algorithms for Tree Alignment with a Given Phylogeny.
#@Lusheng Wang,Tao Jiang,Eugene L. Lawler
#t1996
#cAlgorithmica
#index750707
#% 
#!
  
#*Optimizing Responses to Broadcast Messages in Radio Networks.
#@Jonathan L. Wang,John A. Silvester
#t1989
#cAlgorithmica
#index750708
#% 
#!
  
#*Linear-Time Border-Tracing Algorithms for Quadtrees.
#@Robert E. Webber,Hanan Samet
#t1992
#cAlgorithmica
#index750709
#% 
#!
  
#*Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors.
#@Young C. Wee,Seth Chaiken,S. S. Ravi
#t1994
#cAlgorithmica
#index750710
#% 
#!
  
#*Multicommodity Flows in Even, Planar Networks.
#@Karsten Weihe
#t1997
#cAlgorithmica
#index750711
#% 
#!
  
#*Reconstructing the Topology of a CAD Model - a Discrete Approach.
#@Karsten Weihe,Thomas Willhalm
#t2000
#cAlgorithmica
#index750712
#% 
#!
  
#*Shellsort with a Constant Number of Increments.
#@Mark Allen Weiss
#t1996
#cAlgorithmica
#index750713
#% 
#!
  
#*Expansion of Linear Steiner Trees.
#@J. F. Weng
#t1997
#cAlgorithmica
#index750714
#% 
#!
  
#*Steiner Minimal Trees with One Polygonal Obstacle.
#@J. F. Weng,J. MacGregor Smith
#t2001
#cAlgorithmica
#index750715
#% 
#!
  
#*Randomized Quickhull.
#@Rephael Wenger
#t1997
#cAlgorithmica
#index750716
#% 
#!
  
#*Maintaining Bridge-Connected and Biconnected Components On-Line.
#@Jeffery Westbrook,Robert Endre Tarjan
#t1992
#cAlgorithmica
#index750717
#% 
#!
  
#*Path-Distance Heuristics for the Steiner Problem in Undirected Networks.
#@Pawel Winter,J. MacGregor Smith
#t1992
#cAlgorithmica
#index750718
#% 
#!
  
#*Introduction.
#@Gerhard J. Woeginger
#t2000
#cAlgorithmica
#index750719
#% 
#!
  
#*Stochastic Neural Networks.
#@Eugene Wong
#t1991
#cAlgorithmica
#index750720
#% 
#!
  
#*Floorplan Design of VLSI Circuits.
#@D. F. Wong,C. L. Liu
#t1989
#cAlgorithmica
#index750721
#% 
#!
  
#*Bit Transposition for Very Large Scientific and Statistical Databases.
#@Harry K. T. Wong,Jianzhong Li,Frank Olken,Doron Rotem,Linda Wong
#t1986
#cAlgorithmica
#index750722
#% 
#!
  
#*Probabilistic Analysis of a Grouping Algorithm.
#@D. F. Wong,Edward M. Reingold
#t1991
#cAlgorithmica
#index750723
#% 
#!
  
#*Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout.
#@David R. Wood
#t2004
#cAlgorithmica
#index750724
#% 
#!
  
#*Experimental Performance of Shared RSA Modulus Generation.
#@Rebecca N. Wright,Sara Spalding
#t2002
#cAlgorithmica
#index750725
#% 
#!
  
#*A Subquadratic Algorithm for Approximate Limited Expression Matching.
#@Sun Wu,Udi Manber,Eugene W. Myers
#t1996
#cAlgorithmica
#index750726
#% 
#!
  
#*The Complexity of Hashing with Lazy Deletion.
#@Christopher J. Van Wyk,Jeffrey Scott Vitter
#t1986
#cAlgorithmica
#index750727
#% 
#!
  
#*An ( log ) Average Time Algorithm for Computing the Shortest Network under a Given Topology.
#@Guoliang Xue,Ding-Zhu Du
#t1999
#cAlgorithmica
#index750728
#% 
#!
  
#*Grade of Service Steiner Minimum Trees in the Euclidean Plane.
#@Guoliang Xue,Guo-Hui Lin,Ding-Zhu Du
#t2001
#cAlgorithmica
#index750729
#% 
#!
  
#*A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology.
#@Guoliang Xue,Wei Xiao
#t2004
#cAlgorithmica
#index750730
#% 
#!
  
#*Reconfiguring Triangulations with Edge Flips and Point Moves.
#@Greg Aloupis,Prosenjit Bose,Pat Morin
#t2007
#cAlgorithmica
#index750731
#% 
#!
  
#*Isomorphism for Graphs of Bounded Distance Width.
#@Koichi Yamazaki,Hans L. Bodlaender,Babette de Fluiter,Dimitrios M. Thilikos
#t1999
#cAlgorithmica
#index750732
#% 
#!
  
#*Drawing Power Law Graphs Using a Local/Global Decomposition.
#@Reid Andersen,Fan R. K. Chung,Linyuan Lu
#t2007
#cAlgorithmica
#index750733
#% 
#!
  
#*Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns.
#@Petko Yanev,Paolo Foschi,Erricos John Kontoghiorghes
#t2004
#cAlgorithmica
#index750734
#% 
#!
  
#*An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
#@Alexander Hall,Katharina Langkau,Martin Skutella
#t2007
#cAlgorithmica
#index750735
#% 
#!
  
#*A Distributed Ant Algorithm for Efficiently Patrolling a Network.
#@Vladimir Yanovski,Israel A. Wagner,Alfred M. Bruckstein
#t2003
#cAlgorithmica
#index750736
#% 
#!
  
#*Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching.
#@Nir Avrahami,Yossi Azar
#t2007
#cAlgorithmica
#index750737
#% 
#!
  
#*Distributed and On-Line Routing on Tori.
#@Tzuoo-Hawn Yeh,Cheng-Ming Kuo,Chin-Laung Lei,Hsu-Chun Yen
#t2002
#cAlgorithmica
#index750738
#% 
#!
  
#*Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
#@Andreas Brandstädt,Feodor F. Dragan,Hoàng-Oanh Le,Van Bang Le,Ryuhei Uehara
#t2007
#cAlgorithmica
#index750739
#% 
#!
  
#*Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source.
#@Kwan-Hee Yoo,Dae Seoung Kim,Sung Yong Shin,Kyung-Yong Chwa
#t1998
#cAlgorithmica
#index750740
#% 
#!
  
#*Selfish Load Balancing and Atomic Congestion Games.
#@Subhash Suri,Csaba D. Tóth,Yunhong Zhou
#t2007
#cAlgorithmica
#index750741
#% 
#!
  
#*On-Line File Caching.
#@Neal E. Young
#t2002
#cAlgorithmica
#index750742
#% 
#!
  
#*No-Three-in-Line-in-3D.
#@Attila Pór,David R. Wood
#t2007
#cAlgorithmica
#index750743
#% 
#!
  
#*The k-Server Dual and Loose Competitiveness for Paging.
#@Neal E. Young
#t1994
#cAlgorithmica
#index750744
#% 
#!
  
#*Train Tracks and Confluent Drawings.
#@Peter Hui,Michael J. Pelsmajer,Marcus Schaefer,Daniel Stefankovic
#t2007
#cAlgorithmica
#index750745
#% 
#!
  
#*Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem.
#@Martin Zachariasen,Pawel Winter
#t1999
#cAlgorithmica
#index750746
#% 
#!
  
#*Guest Editors' Foreword.
#@János Pach,Farhad Shahrokhi
#t2007
#cAlgorithmica
#index750747
#% 
#!
  
#*An 11/6-Approximation Algorithm for the Network Steiner Problem.
#@Alexander Zelikovsky
#t1993
#cAlgorithmica
#index750748
#% 
#!
  
#*Foreword.
#@Alessandro Panconesi
#t2007
#cAlgorithmica
#index750749
#% 
#!
  
#*A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem.
#@Alexander Zelikovsky
#t1997
#cAlgorithmica
#index750750
#% 
#!
  
#*Convex Drawings of 3-Connected Plane Graphs.
#@Nicolas Bonichon,Stefan Felsner,Mohamed Mosbah
#t2007
#cAlgorithmica
#index750751
#% 
#!
  
#*A Linear Time Randomizing Algorithm for Searching Ranked Functions.
#@Eitan Zemel
#t1987
#cAlgorithmica
#index750752
#% 
#!
  
#*No-Three-in-Line-in-3D.
#@Reid Andersen,Fan R. K. Chung,Linyuan Lu
#t2007
#cAlgorithmica
#index750753
#% 
#!
  
#*Guest Editor's Introduction.
#@Lisa Zhang
#t2005
#cAlgorithmica
#index750754
#% 
#!
  
#*A Study of Integrated Document and Connection Caching in the WWW.
#@Susanne Albers,Rob van Stee
#t2007
#cAlgorithmica
#index750755
#% 
#!
  
#*A Constrained Edit Distance Between Unordered Labeled Trees.
#@Kaizhong Zhang
#t1996
#cAlgorithmica
#index750756
#% 
#!
  
#*Confluent Layered Drawings.
#@David Eppstein,Michael T. Goodrich,Jeremy Yu Meng
#t2007
#cAlgorithmica
#index750757
#% 
#!
  
#*Efficiency of Randomized Parallel Backtrack Search
#@Yanjun Zhang,A. Ortynski
#t1999
#cAlgorithmica
#index750758
#% 
#!
  
#*Detecting Holes and Antiholes in Graphs.
#@Stavros D. Nikolopoulos,Leonidas Palios
#t2007
#cAlgorithmica
#index750759
#% 
#!
  
#*A Linear Algorithm for Finding [{, }]-Colorings of Partial {}-Trees.
#@Xiao Zhou,K. Fuse,Takao Nishizeki
#t2000
#cAlgorithmica
#index750760
#% 
#!
  
#*External-Memory Algorithms for Processing Line Segments in Geographic Information Systems.
#@Lars Arge,Darren Erik Vengroff,Jeffrey Scott Vitter
#t2007
#cAlgorithmica
#index750761
#% 
#!
  
#*Solving Systems of Difference Constraints Incrementally with Bidirectional Search.
#@Jianjun Zhou,Martin Müller
#t2004
#cAlgorithmica
#index750762
#% 
#!
  
#*R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks.
#@Paolo D'Alberto,Alexandru Nicolau
#t2007
#cAlgorithmica
#index750763
#% 
#!
  
#*Multicolorings of Series-Parallel Graphs.
#@Xiao Zhou,Takao Nishizeki
#t2003
#cAlgorithmica
#index750764
#% 
#!
  
#*Real-Time Scheduling with a Budget.
#@Joseph Naor,Hadas Shachnai,Tami Tamir
#t2007
#cAlgorithmica
#index750765
#% 
#!
  
#*Finding Edge-Disjoint Paths in Partial -Trees.
#@Xiao Zhou,Syurei Tamura,Takao Nishizeki
#t2000
#cAlgorithmica
#index750766
#% 
#!
  
#*Approximation Algorithms for the Unsplittable Flow Problem.
#@Amit Chakrabarti,Chandra Chekuri,Anupam Gupta,Amit Kumar
#t2007
#cAlgorithmica
#index750767
#% 
#!
  
#*Simulating BPP Using a General Weak Random Source.
#@David Zuckerman
#t1996
#cAlgorithmica
#index750768
#% 
#!
  
#*Representations by Contact and Intersection of Segments.
#@Hubert de Fraysseix,Patrice Ossona de Mendez
#t2007
#cAlgorithmica
#index750769
#% 
#!
  
#*A Risk-Reward Framework for the Competitive Analysis of Financial Games.
#@Sabah al-Binali
#t1999
#cAlgorithmica
#index750770
#% 
#!
  
#*A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.
#@Carlos E. R. Alves,Edson Cáceres,Siang Wun Song
#t2006
#cAlgorithmica
#index750771
#% 
#!
  
#*I/O-Efficient Well-Separated Pair Decomposition and Applications.
#@Sathish Govindarajan,Tamás Lukovszki,Anil Maheshwari,Norbert Zeh
#t2006
#cAlgorithmica
#index750772
#% 
#!
  
#*FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment.
#@Adrian Driga,Paul Lu,Jonathan Schaeffer,Duane Szafron,Kevin Charter,Ian Parsons
#t2006
#cAlgorithmica
#index750773
#% 
#!
  
#*Parallelizing Feature Selection.
#@Jerffeson Teixeira de Souza,Stan Matwin,Nathalie Japkowicz
#t2006
#cAlgorithmica
#index750774
#% 
#!
  
#*Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines.
#@Thomas M. Keane,Andrew J. Page,Thomas J. Naughton,Simon A. A. Travers,James O. McInerney
#t2006
#cAlgorithmica
#index750775
#% 
#!
  
#*Scalable Parallel Algorithms for FPT Problems.
#@Faisal N. Abu-Khzam,Michael A. Langston,Pushkar Shanbhag,Christopher T. Symons
#t2006
#cAlgorithmica
#index750776
#% 
#!
  
#*CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets.
#@Jie Chi,Mehmet Koyutürk,Ananth Grama
#t2006
#cAlgorithmica
#index750777
#% 
#!
  
#*A Fixed-Parameter Approach to 2-Layer Planarization.
#@Vida Dujmovic,Michael R. Fellows,Michael T. Hallett,Matthew Kitching,Giuseppe Liotta,Catherine McCartin,Naomi Nishimura,Prabhakar Ragde,Frances A. Rosamond,Matthew Suderman,Sue Whitesides,David R. Wood
#t2006
#cAlgorithmica
#index750778
#% 
#!
  
#*Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.
#@Victor Chepoi,Bertrand Estellon,Karim Nouioua,Yann Vaxès
#t2006
#cAlgorithmica
#index750779
#% 
#!
  
#*General Perfectly Periodic Scheduling.
#@Zvika Brakerski,Aviv Nisgav,Boaz Patt-Shamir
#t2006
#cAlgorithmica
#index750780
#% 
#!
  
#*Power Assignment in Radio Networks with Two Power Levels.
#@Paz Carmi,Matthew J. Katz
#t2007
#cAlgorithmica
#index750781
#% 
#!
  
#*Design and Performance of a Heterogeneous Grid Partitioner.
#@Daniel J. Harvey,Sajal K. Das,Rupak Biswas
#t2006
#cAlgorithmica
#index750782
#% 
#!
  
#*Book Embeddability of Series-Parallel Digraphs.
#@Emilio Di Giacomo,Walter Didimo,Giuseppe Liotta,Stephen K. Wismath
#t2006
#cAlgorithmica
#index750783
#% 
#!
  
#*MOVE: A Distributed Framework for Materialized Ontology View Extraction.
#@Mehul Bhatt,Andrew Flahive,Carlo Wouters,J. Wenny Rahayu,David Taniar
#t2006
#cAlgorithmica
#index750784
#% 
#!
  
#*Online Maintenance of k-Medians and k-Covers on a Line.
#@Rudolf Fleischer,Mordecai J. Golin,Yan Zhang
#t2006
#cAlgorithmica
#index750785
#% 
#!
  
#*Recognizing Hole-Free 4-Map Graphs in Cubic Time.
#@Zhi-Zhong Chen,Michelangelo Grigni,Christos H. Papadimitriou
#t2006
#cAlgorithmica
#index750786
#% 
#!
  
#*An Approximation Algorithm for the Directed Telephone Multicast Problem.
#@Michael Elkin,Guy Kortsarz
#t2006
#cAlgorithmica
#index750787
#% 
#!
  
#*A Fast and Simple Algorithm for the Money Changing Problem.
#@Sebastian Böcker,Zsuzsanna Lipták
#t2007
#cAlgorithmica
#index750788
#% 
#!
  
#*Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters.
#@Geeta Chaudhry,Thomas H. Cormen
#t2006
#cAlgorithmica
#index750789
#% 
#!
  
#*GCD of Random Linear Combinations.
#@Joachim von zur Gathen,Igor Shparlinski
#t2006
#cAlgorithmica
#index750790
#% 
#!
  
#*Multicriteria Global Minimum Cuts.
#@Amitai Armon,Uri Zwick
#t2006
#cAlgorithmica
#index750791
#% 
#!
  
#*A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment.
#@Jesper Jansson,See-Kiong Ng,Wing-Kin Sung,Hugo Willy
#t2006
#cAlgorithmica
#index750792
#% 
#!
  
#*Exact Computation of Polynomial Zeros Expressible by Square Roots.
#@Timo von Oertzen
#t2006
#cAlgorithmica
#index750793
#% 
#!
  
#*Adaptive Spatial Partitioning for Multidimensional Data Streams.
#@John Hershberger,Nisheeth Shrivastava,Subhash Suri,Csaba D. Tóth
#t2006
#cAlgorithmica
#index750794
#% 
#!
  
#*Efficient Algorithms for k Maximum Sums.
#@Fredrik Bengtsson,Jingsen Chen
#t2006
#cAlgorithmica
#index750795
#% 
#!
  
#*Deterministic Rendezvous in Graphs.
#@Anders Dessmark,Pierre Fraigniaud,Dariusz R. Kowalski,Andrzej Pelc
#t2006
#cAlgorithmica
#index750796
#% 
#!
  
#*Motorcycle Graphs and Straight Skeletons.
#@Siu-Wing Cheng,Antoine Vigneron
#t2007
#cAlgorithmica
#index750797
#% 
#!
  
#*The Monotone Circuit Complexity of Quadratic Boolean Functions.
#@Kazuyuki Amano,Akira Maruoka
#t2006
#cAlgorithmica
#index750798
#% 
#!
  
#*A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem.
#@Paola Bonizzoni
#t2007
#cAlgorithmica
#index750799
#% 
#!
  
#*Random Access to Advice Strings and Collapsing Results.
#@Jin-yi Cai,Osamu Watanabe
#t2006
#cAlgorithmica
#index750800
#% 
#!
  
#*A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths.
#@Uri Zwick
#t2006
#cAlgorithmica
#index750801
#% 
#!
  
#*The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
#@Esther M. Arkin,Michael A. Bender,Sándor P. Fekete,Joseph S. B. Mitchell,Martin Skutella
#t2006
#cAlgorithmica
#index750802
#% 
#!
  
#*Foreword.
#@Rudolf Fleischer
#t2006
#cAlgorithmica
#index750803
#% 
#!
  
#*Optimal Coding and Sampling of Triangulations.
#@Dominique Poulalhon,Gilles Schaeffer
#t2006
#cAlgorithmica
#index750804
#% 
#!
  
#*Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis.
#@Roberto Maria Avanzi,Clemens Heuberger,Helmut Prodinger
#t2006
#cAlgorithmica
#index750805
#% 
#!
  
#*On the Number of t-Ary Trees with a Given Path Length.
#@Gadiel Seroussi
#t2006
#cAlgorithmica
#index750806
#% 
#!
  
#*Asymptotics of Largest Components in Combinatorial Structures.
#@Mohamed Omar,Daniel Panario,L. Bruce Richmond,Jacki Whitely
#t2006
#cAlgorithmica
#index750807
#% 
#!
  
#*Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.
#@Michael Fuchs,Hsien-Kuei Hwang,Ralph Neininger
#t2006
#cAlgorithmica
#index750808
#% 
#!
  
#*Random Geometric Graph Diameter in the Unit Ball.
#@Robert B. Ellis,Jeremy L. Martin,Catherine H. Yan
#t2007
#cAlgorithmica
#index750809
#% 
#!
  
#*Algorithms for the Homogeneous Set Sandwich Problem.
#@Celina M. Herrera de Figueiredo,Guilherme Dias da Fonseca,Vinícius G. P. de Sá,Jeremy Spinrad
#t2006
#cAlgorithmica
#index750810
#% 
#!
  
#*Maximizing the Total Profit of Rectangles Packed into a Rectangle.
#@Klaus Jansen,Guochuan Zhang
#t2007
#cAlgorithmica
#index750811
#% 
#!
  
#*A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
#@Wing-Kai Hon,Tak Wah Lam,Kunihiko Sadakane,Wing-Kin Sung,Siu-Ming Yiu
#t2007
#cAlgorithmica
#index750812
#% 
#!
  
#*Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
#@Qi Cheng,Ming-Deh A. Huang
#t2006
#cAlgorithmica
#index750813
#% 
#!
  
#*Call Control in Rings.
#@Udo Adamy,Christoph Ambühl,R. Sai Anand,Thomas Erlebach
#t2007
#cAlgorithmica
#index750814
#% 
#!
  
#*Quantum Complexity of Testing Group Commutativity.
#@Frédéric Magniez,Ashwin Nayak
#t2007
#cAlgorithmica
#index750815
#% 
#!
  
#*Guest Editor's Introduction.
#@Frank K. H. A. Dehne
#t2006
#cAlgorithmica
#index750816
#% 
#!
  
#*An Algorithmic View on OVSF Code Assignment.
#@Thomas Erlebach,Riko Jacob,Matús Mihalák,Marc Nunkesser,Gábor Szabó,Peter Widmayer
#t2007
#cAlgorithmica
#index750817
#% 
#!
  
#*Mobile Search for a Black Hole in an Anonymous Ring.
#@Stefan Dobrev,Paola Flocchini,Giuseppe Prencipe,Nicola Santoro
#t2007
#cAlgorithmica
#index750818
#% 
#!
  
#*Parallel Computation of High-Dimensional Robust Correlation and Covariance Matrices.
#@James Chilson,Raymond T. Ng,Alan Wagner,Ruben H. Zamar
#t2006
#cAlgorithmica
#index750819
#% 
#!
  
#*The Average Size of Giant Components between the Double-Jump.
#@Vlady Ravelomanana
#t2006
#cAlgorithmica
#index750820
#% 
#!
  
#*Left and Right Pathlengths in Random Binary Trees.
#@Svante Janson
#t2006
#cAlgorithmica
#index750821
#% 
#!
  
#*Average-Case Analysis of Approximate Trie Search.
#@Moritz G. Maaß
#t2006
#cAlgorithmica
#index750822
#% 
#!
  
#*The Expected Size of the Rule k Dominating Set.
#@Jennie C. Hansen,Eric Schmutz,Li Sheng
#t2006
#cAlgorithmica
#index750823
#% 
#!
  
#*Destruction of Very Simple Trees.
#@James Allen Fill,Nevin Kapur,Alois Panholzer
#t2006
#cAlgorithmica
#index750824
#% 
#!
  
#*A Local Limit Theorem in the Theory of Overpartitions.
#@Sylvie Corteel,William M. Y. Goh,Pawel Hitczenko
#t2006
#cAlgorithmica
#index750825
#% 
#!
  
#*Preface.
#@Philippe Jacquet,Daniel Panario,Wojciech Szpankowski
#t2006
#cAlgorithmica
#index750826
#% 
#!
  
#*The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees.
#@Brigitte Chauvin,Michael Drmota
#t2006
#cAlgorithmica
#index750827
#% 
#!
  
#*Asymptotics of the Moments of Extreme-Value Related Distribution Functions.
#@Guy Louchard,Helmut Prodinger
#t2006
#cAlgorithmica
#index750828
#% 
#!
  
#*Large Deviations for the Weighted Height of an Extended Class of Trees.
#@Nicolas Broutin,Luc Devroye
#t2006
#cAlgorithmica
#index750829
#% 
#!
  
#*Safe Reduction Rules for Weighted Treewidth.
#@Frank van den Eijkhof,Hans L. Bodlaender,Arie M. C. A. Koster
#t2007
#cAlgorithmica
#index750830
#% 
#!
  
#*Deterministic Communication in Radio Networks with Large Labels.
#@Leszek Gasieniec,Aris Pagourtzis,Igor Potapov,Tomasz Radzik
#t2007
#cAlgorithmica
#index750831
#% 
#!
  
#*Rigid Components in Molecular Graphs.
#@Bill Jackson,Tibor Jordán
#t2007
#cAlgorithmica
#index750832
#% 
#!
  
#*Protein Communication System: Evolution and Genomic Structure.
#@Nidhal Bouaynaya,Dan Schonfeld
#t2007
#cAlgorithmica
#index750833
#% 
#!
  
#*Server Allocation Algorithms for Tiered Systems.
#@Kamalika Chaudhuri,Anshul Kothari,Rudi Pendavingh,Ram Swaminathan,Robert Endre Tarjan,Yunhong Zhou
#t2007
#cAlgorithmica
#index750834
#% 
#!
  
#*Finding Pathway Structures in Protein Interaction Networks.
#@Songjian Lu,Fenghui Zhang,Jianer Chen,Sing-Hoi Sze
#t2007
#cAlgorithmica
#index750835
#% 
#!
  
#*The Price of Selfish Routing.
#@Marios Mavronicolas,Paul G. Spirakis
#t2007
#cAlgorithmica
#index750836
#% 
#!
  
#*The Consecutive Ones Submatrix Problem for Sparse Matrices.
#@Jinsong Tan,Louxin Zhang
#t2007
#cAlgorithmica
#index750837
#% 
#!
  
#*Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
#@Jinsong Tan,Kok Seng Chua,Louxin Zhang,Song Zhu
#t2007
#cAlgorithmica
#index750838
#% 
#!
  
#*Sampling Conformation Space to Model Equilibrium Fluctuations in Proteins.
#@Amarda Shehu,Cecilia Clementi,Lydia E. Kavraki
#t2007
#cAlgorithmica
#index750839
#% 
#!
  
#*Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions.
#@Sven Verdoolaege,Rachid Seghir,Kristof Beyls,Vincent Loechner,Maurice Bruynooghe
#t2007
#cAlgorithmica
#index750840
#% 
#!
  
#*Rapid Homology Search with Neighbor Seeds.
#@Miklós Csürös,Bin Ma
#t2007
#cAlgorithmica
#index750841
#% 
#!
  
#*Foreword.
#@Lusheng Wang
#t2007
#cAlgorithmica
#index750842
#% 
#!
  
#*An Algorithmic Approach to the Identification of Rigid Domains in Proteins.
#@Vicky Choi,Navin Goyal
#t2007
#cAlgorithmica
#index750843
#% 
#!
  
#*On-Line Construction of Two-Dimensional Suffix Trees in O(n log n) Time.
#@Joong Chae Na,Raffaele Giancarlo,Kunsoo Park
#t2007
#cAlgorithmica
#index750844
#% 
#!
  
#*An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing.
#@Guojun Li,Zhijie Liu,Jun-tao Guo,Ying Xu
#t2007
#cAlgorithmica
#index750845
#% 
#!
  
#*Foreword.
#@Piotr Berman,Bhaskar DasGupta,Jie Liang
#t2007
#cAlgorithmica
#index750846
#% 
#!
  
#*Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
#@Anders Dessmark,Jesper Jansson,Andrzej Lingas,Eva-Marta Lundell
#t2007
#cAlgorithmica
#index750847
#% 
#!
  
#*Toward Unsupervised Segmentation of Semi-Rigid Low-Resolution Molecular Surfaces.
#@Leonidas J. Guibas,Yusu Wang
#t2007
#cAlgorithmica
#index750848
#% 
#!
  
#*Broadcasting in Heterogeneous Networks.
#@Samir Khuller,Yoo Ah Kim
#t2007
#cAlgorithmica
#index750849
#% 
#!
  
#*On Walrasian Price of CPU Time.
#@Xiaotie Deng,Li-Sha Huang,Minming Li
#t2007
#cAlgorithmica
#index750850
#% 
#!
  
#*Approximability of Minimum AND-Circuits.
#@Jan Arpe,Bodo Manthey
#t2009
#cAlgorithmica
#index750851
#% 
#!
  
#*Random 2-SAT with Prescribed Literal Degrees.
#@Colin Cooper,Alan M. Frieze,Gregory B. Sorkin
#t2007
#cAlgorithmica
#index750852
#% 
#!
  
#*Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
#@George Karakostas,Stavros G. Kolliopoulos
#t2009
#cAlgorithmica
#index750853
#% 
#!
  
#*On the Fundamental Limits of Topology Control in Ad Hoc Networks.
#@András Faragó
#t2007
#cAlgorithmica
#index750854
#% 
#!
  
#*SONET ADMs Minimization with Divisible Paths.
#@Leah Epstein,Asaf Levin
#t2007
#cAlgorithmica
#index750855
#% 
#!
  
#*Algorithms for Graphs Embeddable with Few Crossings per Edge.
#@Alexander Grigoriev,Hans L. Bodlaender
#t2007
#cAlgorithmica
#index750856
#% 
#!
  
#*On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks.
#@Daniela Tulone
#t2007
#cAlgorithmica
#index750857
#% 
#!
  
#*The Number of Tree Stars Is (1.357).
#@Bernhard Fuchs,Walter Kern,Xinhui Wang
#t2007
#cAlgorithmica
#index750858
#% 
#!
  
#*The Complexity of the Single Individual SNP Haplotyping Problem.
#@Rudi Cilibrasi,Leo van Iersel,Steven Kelk,John Tromp
#t2007
#cAlgorithmica
#index750859
#% 
#!
  
#*Localized Techniques for Broadcasting in Wireless Sensor Networks.
#@Devdatt P. Dubhashi,Olle Häggström,Lorenzo Orecchia,Alessandro Panconesi,Chiara Petrioli,Andrea Vitaletti
#t2007
#cAlgorithmica
#index750860
#% 
#!
  
#*Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks.
#@Vasundhara Puttagunta,Konstantinos Kalpakis
#t2007
#cAlgorithmica
#index750861
#% 
#!
  
#*Space Efficient Dynamic Orthogonal Range Reporting.
#@Yakov Nekrich
#t2007
#cAlgorithmica
#index750862
#% 
#!
  
#*A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.
#@Hervé Fournier,Antoine Vigneron
#t2007
#cAlgorithmica
#index750863
#% 
#!
  
#*Improved Approximation Results for the Minimum Energy Broadcasting Problem.
#@Michele Flammini,Ralf Klasing,Alfredo Navarra,Stephane Perennes
#t2007
#cAlgorithmica
#index750864
#% 
#!
  
#*Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem.
#@Luciano Gualà,Guido Proietti
#t2007
#cAlgorithmica
#index750865
#% 
#!
  
#*A Class of Algorithms for Collision Resolution with Multiplicity Estimation.
#@Petar Popovski,Frank H. P. Fitzek,Ramjee Prasad
#t2007
#cAlgorithmica
#index750866
#% 
#!
  
#*Property Testing of Regular Tree Languages.
#@Frédéric Magniez,Michel de Rougemont
#t2007
#cAlgorithmica
#index750867
#% 
#!
  
#*Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems.
#@Nir Halman
#t2007
#cAlgorithmica
#index750868
#% 
#!
  
#*Analysis of Randomized Protocols for Conflict-Free Distributed Access.
#@Gopal Pandurangan,GaHyun Park
#t2007
#cAlgorithmica
#index750869
#% 
#!
  
#*Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry.
#@Eitan Bachmat
#t2007
#cAlgorithmica
#index750870
#% 
#!
  
#*Fast Recognition of Fibonacci Cubes.
#@Andrej Taranenko,Aleksander Vesel
#t2007
#cAlgorithmica
#index750871
#% 
#!
  
#*Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing.
#@Stefano Basagni,Cynthia A. Phillips
#t2007
#cAlgorithmica
#index750872
#% 
#!
  
#*OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks.
#@Peng-Jun Wan,Xiang-Yang Li,Ophir Frieder
#t2007
#cAlgorithmica
#index750873
#% 
#!
  
#*Sample Complexity for Computational Classification Problems.
#@Daniil Ryabko
#t2007
#cAlgorithmica
#index750874
#% 
#!
  
#*Choosing a Random Peer in Chord.
#@Valerie King,Scott Lewis,Jared Saia,Maxwell Young
#t2007
#cAlgorithmica
#index750875
#% 
#!
  
#*-Nearest-Neighbor Clustering and Percolation Theory.
#@Shang-Hua Teng,Frances F. Yao
#t2007
#cAlgorithmica
#index750876
#% 
#!
  
#*From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time.
#@V. Berry,Z. S. Peng,H. F. Ting
#t2008
#cAlgorithmica
#index750877
#% 
#!
  
#*All-Pairs Shortest Paths with Real Weights in ( /log ) Time.
#@Timothy M. Chan
#t2008
#cAlgorithmica
#index750878
#% 
#!
  
#*Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
#@Raffaella Gentilini,Carla Piazza,Alberto Policriti
#t2008
#cAlgorithmica
#index750879
#% 
#!
  
#*Max-Stretch Reduction for Tree Spanners.
#@Kazuo Iwama,Andrzej Lingas,Masaki Okita
#t2008
#cAlgorithmica
#index750880
#% 
#!
  
#*New Linear-Time Algorithms for Edge-Coloring Planar Graphs.
#@Richard Cole,Lukasz Kowalik
#t2008
#cAlgorithmica
#index750881
#% 
#!
  
#*The Swap Edges of a Multiple-Sources Routing Tree.
#@Bang Ye Wu,Chih-Yuan Hsiao,Kun-Mao Chao
#t2008
#cAlgorithmica
#index750882
#% 
#!
  
#*Dynamic Hotlinks.
#@Karim Douïeb,Stefan Langerman
#t2008
#cAlgorithmica
#index750883
#% 
#!
  
#*Linear Time Algorithms for Generalized Edge Dominating Set Problems.
#@André Berger,Ojas Parekh
#t2008
#cAlgorithmica
#index750884
#% 
#!
  
#*Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness.
#@Patchrawat Uthaisombut
#t2008
#cAlgorithmica
#index750885
#% 
#!
  
#*Average Case Analysis of Bounded Space Bin Packing Algorithms.
#@Nir Naaman,Raphael Rom
#t2008
#cAlgorithmica
#index750886
#% 
#!
  
#*Optimally Adaptive Integration of Univariate Lipschitz Functions.
#@Ilya Baran,Erik D. Demaine,Dmitriy A. Katz
#t2008
#cAlgorithmica
#index750887
#% 
#!
  
#*On the Competitive Ratio for Online Facility Location.
#@Dimitris Fotakis
#t2008
#cAlgorithmica
#index750888
#% 
#!
  
#*Introduction to Special Issue.
#@Frank K. H. A. Dehne,Jörg-Rüdiger Sack
#t2008
#cAlgorithmica
#index750889
#% 
#!
  
#*Cost-Sharing Mechanisms for Network Design.
#@Anupam Gupta,Aravind Srinivasan,Éva Tardos
#t2008
#cAlgorithmica
#index750890
#% 
#!
  
#*Delineating Boundaries for Imprecise Regions.
#@Iris Reinbacher,Marc Benkert,Marc J. van Kreveld,Joseph S. B. Mitchell,Jack Snoeyink,Alexander Wolff
#t2008
#cAlgorithmica
#index750891
#% 
#!
  
#*Improved Approximation Bounds for Planar Point Pattern Matching.
#@Minkyoung Cho,David M. Mount
#t2008
#cAlgorithmica
#index750892
#% 
#!
  
#*Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
#@Michael A. Bender,David P. Bunde,Erik D. Demaine,Sándor P. Fekete,Vitus J. Leung,Henk Meijer,Cynthia A. Phillips
#t2008
#cAlgorithmica
#index750893
#% 
#!
  
#*An Optimal Algorithm for the Minimum Disc Cover Problem.
#@Min-Te Sun,Chih-Wei Yi,Chuan-Kai Yang,Ten-Hwang Lai
#t2008
#cAlgorithmica
#index750894
#% 
#!
  
#*Nondeterministic Graph Searching: From Pathwidth to Treewidth.
#@Fedor V. Fomin,Pierre Fraigniaud,Nicolas Nisse
#t2009
#cAlgorithmica
#index750895
#% 
#!
  
#*Consistent Sets of Secondary Structures in Proteins.
#@Piotr Berman,Jieun K. Jeong
#t2009
#cAlgorithmica
#index750896
#% 
#!
  
#*On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.
#@Leonid Khachiyan,Endre Boros,Khaled M. Elbassioni,Vladimir Gurvich
#t2008
#cAlgorithmica
#index750897
#% 
#!
  
#*Real Two Dimensional Scaled Matching.
#@Amihood Amir,Ayelet Butman,Moshe Lewenstein,Ely Porat
#t2009
#cAlgorithmica
#index750898
#% 
#!
  
#*On the Stability of Dynamic Diffusion Load Balancing.
#@Petra Berenbrink,Tom Friedetzky,Russell A. Martin
#t2008
#cAlgorithmica
#index750899
#% 
#!
  
#*Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.
#@Xujin Chen,Bo Chen
#t2009
#cAlgorithmica
#index750900
#% 
#!
  
#*Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
#@Fan R. K. Chung,Ronald L. Graham,Jia Mao,Andrew Chi-Chih Yao
#t2007
#cAlgorithmica
#index750901
#% 
#!
  
#*Incremental Medians via Online Bidding.
#@Marek Chrobak,Claire Kenyon,John Noga,Neal E. Young
#t2008
#cAlgorithmica
#index750902
#% 
#!
  
#*Foreword.
#@José R. Correa,Marcos A. Kiwi
#t2008
#cAlgorithmica
#index750903
#% 
#!
  
#*Eliminating Cycles in the Discrete Torus.
#@Béla Bollobás,Guy Kindler,Imre Leader,Ryan O'Donnell
#t2008
#cAlgorithmica
#index750904
#% 
#!
  
#*Subquadratic Algorithms for 3SUM.
#@Ilya Baran,Erik D. Demaine,Mihai Patrascu
#t2008
#cAlgorithmica
#index750905
#% 
#!
  
#*Algorithms for Modular Counting of Roots of Multivariate Polynomials.
#@Parikshit Gopalan,Venkatesan Guruswami,Richard J. Lipton
#t2008
#cAlgorithmica
#index750906
#% 
#!
  
#*Random Bichromatic Matchings.
#@Nayantara Bhatnagar,Dana Randall,Vijay V. Vazirani,Eric Vigoda
#t2008
#cAlgorithmica
#index750907
#% 
#!
  
#*Gaussian Laws for the Main Parameters of the Euclid Algorithms.
#@Loïck Lhote,Brigitte Vallée
#t2008
#cAlgorithmica
#index750908
#% 
#!
  
#*Minimum Cost Source Location Problems with Flow Requirements.
#@Mariko Sakashita,Kazuhisa Makino,Satoru Fujishige
#t2008
#cAlgorithmica
#index750909
#% 
#!
  
#*Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure.
#@Camil Demetrescu,Giuseppe F. Italiano
#t2008
#cAlgorithmica
#index750910
#% 
#!
  
#*Space Efficient Algorithms for Ordered Tree Comparison.
#@Lusheng Wang,Kaizhong Zhang
#t2008
#cAlgorithmica
#index750911
#% 
#!
  
#*Treewidth Lower Bounds with Brambles.
#@Hans L. Bodlaender,Alexander Grigoriev,Arie M. C. A. Koster
#t2008
#cAlgorithmica
#index750912
#% 
#!
  
#*A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions.
#@Li-Sha Huang
#t2008
#cAlgorithmica
#index750913
#% 
#!
  
#*The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms.
#@Iyad A. Kanj,Luay Nakhleh,Ge Xia
#t2008
#cAlgorithmica
#index750914
#% 
#!
  
#*Competitive Analysis of Scheduling Algorithms for Aggregated Links.
#@Wojciech Jawor,Marek Chrobak,Christoph Dürr
#t2008
#cAlgorithmica
#index750915
#% 
#!
  
#*Distribution-Free Connectivity Testing for Sparse Graphs.
#@Shirley Halevy,Eyal Kushilevitz
#t2008
#cAlgorithmica
#index750916
#% 
#!
  
#*Improved Approximate String Matching Using Compressed Suffix Data Structures.
#@Tak Wah Lam,Wing-Kin Sung,Swee-Seong Wong
#t2008
#cAlgorithmica
#index750917
#% 
#!
  
#*Property-Preserving Data Reconstruction.
#@Nir Ailon,Bernard Chazelle,Seshadhri Comandur,Ding Liu
#t2008
#cAlgorithmica
#index750918
#% 
#!
  
#*Approximation Algorithms for Bounded Degree Phylogenetic Roots.
#@Zhi-Zhong Chen
#t2008
#cAlgorithmica
#index750919
#% 
#!
  
#*Embedding of Cycles in Twisted Cubes with Edge-Pancyclic.
#@Jianxi Fan,Xiaohua Jia,Xiaola Lin
#t2008
#cAlgorithmica
#index750920
#% 
#!
  
#*Tight Results on Minimum Entropy Set Cover.
#@Jean Cardinal,Samuel Fiorini,Gwenaël Joret
#t2008
#cAlgorithmica
#index750921
#% 
#!
  
#*A (2-(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
#@Kazuo Iwama,Shuichi Miyazaki,Naoya Yamauchi
#t2008
#cAlgorithmica
#index750922
#% 
#!
  
#*Grouping Techniques for Scheduling Problems: Simpler and Faster.
#@Aleksei V. Fishkin,Klaus Jansen,Monaldo Mastrolilli
#t2008
#cAlgorithmica
#index750923
#% 
#!
  
#*Generating Cut Conjunctions in Graphs and Related Problems.
#@Leonid Khachiyan,Endre Boros,Konrad Borys,Khaled M. Elbassioni,Vladimir Gurvich,Kazuhisa Makino
#t2008
#cAlgorithmica
#index750924
#% 
#!
  
#*An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing.
#@Guojun Li,Zhijie Liu,Jun-tao Guo,Ying Xu
#t2008
#cAlgorithmica
#index750925
#% 
#!
  
#*A Network Game with Attackers and a Defender.
#@Marios Mavronicolas,Vicky Papadopoulou,Anna Philippou,Paul G. Spirakis
#t2008
#cAlgorithmica
#index750926
#% 
#!
  
#*Unique Sink Orientations of Grids.
#@Bernd Gärtner,Walter D. Morris Jr.,Leo Rüst
#t2008
#cAlgorithmica
#index750927
#% 
#!
  
#*Synchronous vs. Asynchronous Unison.
#@Christian Boulinier,Franck Petit,Vincent Villain
#t2008
#cAlgorithmica
#index750928
#% 
#!
  
#*Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.
#@Natalia V. Shakhlevich,Vitaly A. Strusevich
#t2008
#cAlgorithmica
#index750929
#% 
#!
  
#*Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs.
#@Réka Albert,Bhaskar DasGupta,Riccardo Dondi,Eduardo D. Sontag
#t2008
#cAlgorithmica
#index750930
#% 
#!
  
#*Preface.
#@Xiaotie Deng,Ding-Zhu Du
#t2008
#cAlgorithmica
#index750931
#% 
#!
  
#*Club Formation by Rational Sharing: Content, Viability and Community Structure.
#@W.-Y. Ng,D. M. Chiu,W. K. Lin
#t2008
#cAlgorithmica
#index750932
#% 
#!
  
#*Truth-Telling Reservations.
#@Fang Wu,Li Zhang,Bernardo A. Huberman
#t2008
#cAlgorithmica
#index750933
#% 
#!
  
#*Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
#@Marios Mavronicolas,Panagiota N. Panagopoulou,Paul G. Spirakis
#t2008
#cAlgorithmica
#index750934
#% 
#!
  
#*New Algorithms for Mining the Reputation of Participants of Online Auctions.
#@Mikolaj Morzy
#t2008
#cAlgorithmica
#index750935
#% 
#!
  
#*Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.
#@Ning Chen,Atri Rudra
#t2008
#cAlgorithmica
#index750936
#% 
#!
  
#*Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
#@Subhash Khot,Richard J. Lipton,Evangelos Markakis,Aranyak Mehta
#t2008
#cAlgorithmica
#index750937
#% 
#!
  
#*Preface.
#@Xiaotie Deng,Yinyu Ye
#t2008
#cAlgorithmica
#index750938
#% 
#!
  
#*Maximum Induced Matchings for Chordal Graphs in Linear Time.
#@Andreas Brandstädt,Chính T. Hoàng
#t2008
#cAlgorithmica
#index750939
#% 
#!
  
#*Sorting and Searching in Faulty Memories.
#@Irene Finocchi,Giuseppe F. Italiano
#t2008
#cAlgorithmica
#index750940
#% 
#!
  
#*An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs.
#@Minzhu Xie,Jianxin Wang
#t2008
#cAlgorithmica
#index750941
#% 
#!
  
#*Fixed-Parameter Complexity of Minimum Profile Problems.
#@Gregory Gutin,Stefan Szeider,Anders Yeo
#t2008
#cAlgorithmica
#index750942
#% 
#!
  
#*Solving Connected Dominating Set Faster than 2.
#@Fedor V. Fomin,Fabrizio Grandoni,Dieter Kratsch
#t2008
#cAlgorithmica
#index750943
#% 
#!
  
#*Optimality in External Memory Hashing.
#@Morten Skaarup Jensen,Rasmus Pagh
#t2008
#cAlgorithmica
#index750944
#% 
#!
  
#*On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
#@Fedor V. Fomin,Serge Gaspers,Artem V. Pyatkin,Igor Razgon
#t2008
#cAlgorithmica
#index750945
#% 
#!
  
#*Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection.
#@Falk Hüffner,Sebastian Wernicke,Thomas Zichner
#t2008
#cAlgorithmica
#index750946
#% 
#!
  
#*Testing Planarity of Geometric Automorphisms in Linear Time.
#@Christoph Buchheim,Seok-Hee Hong
#t2008
#cAlgorithmica
#index750947
#% 
#!
  
#*Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays.
#@Dong Kyue Kim,Minhwan Kim,Heejin Park
#t2008
#cAlgorithmica
#index750948
#% 
#!
  
#*Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
#@Andreas Björklund,Thore Husfeldt
#t2008
#cAlgorithmica
#index750949
#% 
#!
  
#*Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets.
#@Hai Yu,Pankaj K. Agarwal,Raghunath Poreddy,Kasturi R. Varadarajan
#t2008
#cAlgorithmica
#index750950
#% 
#!
  
#*Bandwidth-Constrained Allocation in Grid Computing.
#@Anshul Kothari,Subhash Suri,Yunhong Zhou
#t2008
#cAlgorithmica
#index750951
#% 
#!
  
#*Path Hitting in Acyclic Graphs.
#@Ojas Parekh,Danny Segev
#t2008
#cAlgorithmica
#index750952
#% 
#!
  
#*Scheduling Techniques for Media-on-Demand.
#@Amotz Bar-Noy,Richard E. Ladner,Tami Tamir
#t2008
#cAlgorithmica
#index750953
#% 
#!
  
#*Foreword from the Guest Editors.
#@Jianer Chen,Iyad A. Kanj
#t2008
#cAlgorithmica
#index750954
#% 
#!
  
#*Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
#@Michael R. Fellows,Christian Knauer,Naomi Nishimura,Prabhakar Ragde,Frances A. Rosamond,Ulrike Stege,Dimitrios M. Thilikos,Sue Whitesides
#t2008
#cAlgorithmica
#index750955
#% 
#!
  
#*Improved Algorithms and Complexity Results for Power Domination in Graphs.
#@Jiong Guo,Rolf Niedermeier,Daniel Raible
#t2008
#cAlgorithmica
#index750956
#% 
#!
  
#*An [()\tilde]()\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
#@Telikepalli Kavitha,Kurt Mehlhorn,Dimitrios Michail,Katarzyna E. Paluch
#t2008
#cAlgorithmica
#index750957
#% 
#!
  
#*Short Cycles Make -hard Problems Hard: FPT Algorithms for -hard Problems in Graphs with no Short Cycles.
#@Venkatesh Raman,Saket Saurabh
#t2008
#cAlgorithmica
#index750958
#% 
#!
  
#*On the Parameterized Complexity of Layered Graph Drawing.
#@Vida Dujmovic,Michael R. Fellows,Matthew Kitching,Giuseppe Liotta,Catherine McCartin,Naomi Nishimura,Prabhakar Ragde,Frances A. Rosamond,Sue Whitesides,David R. Wood
#t2008
#cAlgorithmica
#index750959
#% 
#!
  
#*Cache-Oblivious R-Trees.
#@Lars Arge,Mark de Berg,Herman J. Haverkort
#t2009
#cAlgorithmica
#index750960
#% 
#!
  
#*Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.
#@George Karakostas,Stavros G. Kolliopoulos
#t2009
#cAlgorithmica
#index750961
#% 
#!
  
#*Approximating Buy-at-Bulk and Shallow-Light -Steiner Trees.
#@Mohammad Taghi Hajiaghayi,Guy Kortsarz,Mohammad R. Salavatipour
#t2009
#cAlgorithmica
#index750962
#% 
#!
  
#*Algorithms for Maximum Independent Set in Convex Bipartite Graphs.
#@José Soares,Marco A. Stefanes
#t2009
#cAlgorithmica
#index750963
#% 
#!
  
#*Labeling Schemes for Tree Representation.
#@Reuven Cohen,Pierre Fraigniaud,David Ilcinkas,Amos Korman,David Peleg
#t2009
#cAlgorithmica
#index750964
#% 
#!
  
#*Non-Cooperative Tree Creation.
#@Martin Hoefer
#t2009
#cAlgorithmica
#index750965
#% 
#!
  
#*Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.
#@Bodo Manthey,L. Shankar Ram
#t2009
#cAlgorithmica
#index750966
#% 
#!
  
#*Sorting Networks of Logarithmic Depth, Further Simplified.
#@Joel I. Seiferas
#t2009
#cAlgorithmica
#index750967
#% 
#!
  
#*A PTAS for Cutting Out Polygons with Lines.
#@Sergey Bereg,Ovidiu Daescu,Minghui Jiang
#t2009
#cAlgorithmica
#index750968
#% 
#!
  
#*An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments.
#@Pangfeng Liu,May-Chen Kuo,Da-Wei Wang
#t2009
#cAlgorithmica
#index750969
#% 
#!
  
#*Fast Algorithms for the Density Finding Problem.
#@D. T. Lee,Tien-Ching Lin,Hsueh-I Lu
#t2009
#cAlgorithmica
#index750970
#% 
#!
  
#*Minimum Weakly Fundamental Cycle Bases Are Hard To Find.
#@Romeo Rizzi
#t2009
#cAlgorithmica
#index750971
#% 
#!
  
#*Guest Editors' Forward.
#@Danny Z. Chen,D. T. Lee
#t2009
#cAlgorithmica
#index750972
#% 
#!
  
#*On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.
#@Joseph Wun-Tat Chan,Prudence W. H. Wong,Fencol C. C. Yung
#t2009
#cAlgorithmica
#index750973
#% 
#!
  
#*A Simplicial Approach for Discrete Fixed Point Theorems.
#@Xi Chen,Xiaotie Deng
#t2009
#cAlgorithmica
#index750974
#% 
#!
  
#*Variable Sized Online Interval Coloring with Bandwidth.
#@Leah Epstein,Thomas Erlebach,Asaf Levin
#t2009
#cAlgorithmica
#index750975
#% 
#!
  
#*A Detachment Algorithm for Inferring a Graph from Path Frequency.
#@Hiroshi Nagamochi
#t2009
#cAlgorithmica
#index750976
#% 
#!
  
#*Quantum Information and the PCP Theorem.
#@Ran Raz
#t2009
#cAlgorithmica
#index1219431
#% 
#!
  
#*Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
#@Tomás Ebenlendr,Wojciech Jawor,Jiri Sgall
#t2009
#cAlgorithmica
#index1219432
#% 
#!
  
#*Small Area Drawings of Outerplanar Graphs.
#@Giuseppe Di Battista,Fabrizio Frati
#t2009
#cAlgorithmica
#index1219433
#% 
#!
  
#*The Price of Resiliency: a Case Study on Sorting with Memory Faults.
#@Umberto Ferraro Petrillo,Irene Finocchi,Giuseppe F. Italiano
#t2009
#cAlgorithmica
#index1219434
#% 
#!
  
#*Hierarchical Sampling from Sketches: Estimating Functions over Data Streams.
#@Sumit Ganguly,Lakshminath Bhuvanagiri
#t2009
#cAlgorithmica
#index1219435
#% 
#!
  
#*Negation-Limited Complexity of Parity and Inverters.
#@Kazuo Iwama,Hiroki Morizumi,Jun Tarui
#t2009
#cAlgorithmica
#index1219436
#% 
#!
  
#*Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.
#@Noga Alon,Shai Gutner
#t2009
#cAlgorithmica
#index1219437
#% 
#!
  
#*Kinetic Collision Detection for Convex Fat Objects.
#@Mohammad Ali Abam,Mark de Berg,Sheung-Hung Poon,Bettina Speckmann
#t2009
#cAlgorithmica
#index1219438
#% 
#!
  
#*Foreword.
#@Yossi Azar,Thomas Erlebach
#t2009
#cAlgorithmica
#index1219439
#% 
#!
  
#*Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.
#@Matthias Englert,Matthias Westermann
#t2009
#cAlgorithmica
#index1219440
#% 
#!
  
#*Dynamic Connectivity for Axis-Parallel Rectangles.
#@Peyman Afshani,Timothy M. Chan
#t2009
#cAlgorithmica
#index1219441
#% 
#!
  
#*Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.
#@Zhi-Zhong Chen,Lusheng Wang,Zhanyong Wang
#t2009
#cAlgorithmica
#index1219442
#% 
#!
  
#*Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
#@Christoph Ambühl,Monaldo Mastrolilli
#t2009
#cAlgorithmica
#index1219443
#% 
#!
  
#*On Two Techniques of Combining Branching and Treewidth.
#@Fedor V. Fomin,Serge Gaspers,Saket Saurabh,Alexey A. Stepanov
#t2009
#cAlgorithmica
#index1219444
#% 
#!
  
#*A Note on Multiflows and Treewidth.
#@Chandra Chekuri,Sanjeev Khanna,F. Bruce Shepherd
#t2009
#cAlgorithmica
#index1219445
#% 
#!
  
#*Multiline Addressing by Network Flow.
#@Friedrich Eisenbrand,Andreas Karrenbauer,Martin Skutella,Chihao Xu
#t2009
#cAlgorithmica
#index1219446
#% 
#!
  
#*An Improved Algorithm for Online Unit Clustering.
#@Hamid Zarrabi-Zadeh,Timothy M. Chan
#t2009
#cAlgorithmica
#index1219447
#% 
#!
  
#*Smallest Bipartite Bridge-Connectivity Augmentation.
#@Pei-Chi Huang,Hsin-Wen Wei,Wan-Chen Lu,Wei Kuan Shih,Tsan-sheng Hsu
#t2009
#cAlgorithmica
#index1219448
#% 
#!
  
#*Efficient Prüfer-Like Coding and Counting Labelled Hypertrees.
#@Saswata Shannigrahi,Sudebkumar Prasant Pal
#t2009
#cAlgorithmica
#index1219449
#% 
#!
  
#*Casting an Object with a Core.
#@Hee-Kap Ahn,Sang Won Bae,Siu-Wing Cheng,Kyung-Yong Chwa
#t2009
#cAlgorithmica
#index1219450
#% 
#!
  
#*Optimal External Memory Planar Point Enclosure.
#@Lars Arge,Vasilis Samoladas,Ke Yi
#t2009
#cAlgorithmica
#index1219451
#% 
#!
  
#*I/O-Efficient Algorithms for Graphs of Bounded Treewidth.
#@Anil Maheshwari,Norbert Zeh
#t2009
#cAlgorithmica
#index1219452
#% 
#!
  
#*Editorial.
#@Tetsuo Asano
#t2009
#cAlgorithmica
#index1219453
#% 
#!
  
#*A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.
#@Yong Zhang,Francis Y. L. Chin,Hong Zhu
#t2009
#cAlgorithmica
#index1219454
#% 
#!
  
#*Editorial, COCOON 2007 Special Issue.
#@Guohui Lin,Zhipeng Cai
#t2009
#cAlgorithmica
#index1219455
#% 
#!
  
#*Many-to-Many Communication in Radio Networks.
#@Bogdan S. Chlebus,Dariusz R. Kowalski,Tomasz Radzik
#t2009
#cAlgorithmica
#index1219456
#% 
#!
  
#*Models of Greedy Algorithms for Graph Problems.
#@Sashka Davis,Russell Impagliazzo
#t2009
#cAlgorithmica
#index1219457
#% 
#!
  
#*Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.
#@Erik D. Demaine,MohammadTaghi Hajiaghayi,Ken-ichi Kawarabayashi
#t2009
#cAlgorithmica
#index1219458
#% 
#!
  
#*Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach.
#@Jianer Chen,Songjian Lu
#t2009
#cAlgorithmica
#index1219459
#% 
#!
  
#*Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
#@Yury Lifshits,Shay Mozes,Oren Weimann,Michal Ziv-Ukelson
#t2009
#cAlgorithmica
#index1219460
#% 
#!
  
#*On Locating Disjoint Segments with Maximum Sum of Densities.
#@Hsiao-Fei Liu,Kun-Mao Chao
#t2009
#cAlgorithmica
#index1219461
#% 
#!
  
#*Why Neighbor-Joining Works.
#@Radu Mihaescu,Dan Levy,Lior Pachter
#t2009
#cAlgorithmica
#index1219462
#% 
#!
  
#*Resource Allocation in Bounded Degree Trees.
#@Reuven Bar-Yehuda,Michael Beder,Yuval Cohen,Dror Rawitz
#t2009
#cAlgorithmica
#index1219463
#% 
#!
  
#*Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.
#@Rajiv Gandhi,Julián Mestre
#t2009
#cAlgorithmica
#index1219464
#% 
#!
  
#*Runtime Analysis of a Simple Ant Colony Optimization Algorithm.
#@Frank Neumann,Carsten Witt
#t2009
#cAlgorithmica
#index1219465
#% 
#!
  
#*On Counting 3-D Matchings of Size .
#@Yunlong Liu,Jianer Chen,Jianxin Wang
#t2009
#cAlgorithmica
#index1219466
#% 
#!
  
#*Minimum-Cost Load-Balancing Partitions.
#@Boris Aronov,Paz Carmi,Matthew J. Katz
#t2009
#cAlgorithmica
#index1219467
#% 
#!
  
#*Faster Deterministic Communication in Radio Networks.
#@Ferdinando Cicalese,Fredrik Manne,Qin Xin
#t2009
#cAlgorithmica
#index1219468
#% 
#!
  
#*A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.
#@Julián Mestre
#t2009
#cAlgorithmica
#index1219469
#% 
#!
  
#*Approximating the Bandwidth of Caterpillars.
#@Uriel Feige,Kunal Talwar
#t2009
#cAlgorithmica
#index1219470
#% 
#!
  
#*Indexing Factors with Gaps.
#@Costas S. Iliopoulos,M. Sohel Rahman
#t2009
#cAlgorithmica
#index1219471
#% 
#!
  
#*A Separation Bound for Real Algebraic Expressions.
#@Christoph Burnikel,Stefan Funke,Kurt Mehlhorn,Stefan Schirra,Susanne Schmitt
#t2009
#cAlgorithmica
#index1219472
#% 
#!
  
#*Foreword from the Guest Editors.
#@Frédéric Magniez,Ashwin Nayak
#t2009
#cAlgorithmica
#index1219473
#% 
#!
  
#*Graph Spanners in the Streaming Model: An Experimental Study.
#@Giorgio Ausiello,Camil Demetrescu,Paolo Giulio Franciosa,Giuseppe F. Italiano,Andrea Ribichini
#t2009
#cAlgorithmica
#index1219474
#% 
#!
  
#*A Polynomial Quantum Algorithm for Approximating the Jones Polynomial.
#@Dorit Aharonov,Vaughan Jones,Zeph Landau
#t2009
#cAlgorithmica
#index1219475
#% 
#!
  
#*Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra.
#@Haim Kaplan,Natan Rubin,Micha Sharir
#t2009
#cAlgorithmica
#index1219476
#% 
#!
  
#*Optimal Algorithms for -Search with Application in Option Pricing.
#@Julian Lorenz,Konstantinos Panagiotou,Angelika Steger
#t2009
#cAlgorithmica
#index1219477
#% 
#!
  
#*The Network as a Storage Device: Dynamic Routing with Bounded Buffers.
#@Stanislav Angelov,Sanjeev Khanna,Keshav Kunal
#t2009
#cAlgorithmica
#index1219478
#% 
#!
  
#*Derandomized Constructions of -Wise (Almost) Independent Permutations.
#@Eyal Kaplan,Moni Naor,Omer Reingold
#t2009
#cAlgorithmica
#index1219479
#% 
#!
  
#*Foreword.
#@Lars Arge,Emo Welzl
#t2009
#cAlgorithmica
#index1219480
#% 
#!
  
#*A Fast Algorithm for Adaptive Prefix Coding.
#@Marek Karpinski,Yakov Nekrich
#t2009
#cAlgorithmica
#index1219481
#% 
#!
  
#*Quantum and Classical Query Complexities of Local Search Are Polynomially Related.
#@Miklos Santha,Mario Szegedy
#t2009
#cAlgorithmica
#index1219482
#% 
#!
  
#*Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons.
#@Jakub Pawlewicz,Mihai Patrascu
#t2009
#cAlgorithmica
#index1219483
#% 
#!
  
#*On the Quantum Query Complexity of Local Search in Two and Three Dimensions.
#@Xiaoming Sun,Andrew Chi-Chih Yao
#t2009
#cAlgorithmica
#index1219484
#% 
#!
  
#*Incremental Construction of Minimal Tree Automata.
#@Rafael C. Carrasco,Jan Daciuk,Mikel L. Forcada
#t2009
#cAlgorithmica
#index1219485
#% 
#!
  
#*Error-Detection-Based Quantum Fault-Tolerance Threshold.
#@Ben Reichardt
#t2009
#cAlgorithmica
#index1219486
#% 
#!
  
#*Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.
#@Jaikumar Radhakrishnan,Martin Rötteler,Pranab Sen
#t2009
#cAlgorithmica
#index1219487
#% 
#!
  
#*Reconstructive Dispersers and Hitting Set Generators.
#@Christopher Umans
#t2009
#cAlgorithmica
#index1219488
#% 
#!
  
#*What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.
#@Kamalika Chaudhuri,Satish Rao,Samantha Riesenfeld,Kunal Talwar
#t2009
#cAlgorithmica
#index1219489
#% 
#!
  
#*Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.
#@Jan Remy,Angelika Steger
#t2009
#cAlgorithmica
#index1219490
#% 
#!
  
#*Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces.
#@Peter Hachenberger
#t2009
#cAlgorithmica
#index1219491
#% 
#!
  
#*An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs.
#@Benjamin E. Birnbaum,Kenneth J. Goldman
#t2009
#cAlgorithmica
#index1219492
#% 
#!
  
#*Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.
#@Arie M. C. A. Koster,Adrian Zymolka,Manuel Kutschka
#t2009
#cAlgorithmica
#index1219493
#% 
#!
  
#*A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs.
#@Andris Ambainis,Robert Spalek,Ronald de Wolf
#t2009
#cAlgorithmica
#index1219494
#% 
#!
  
#*Foreword.
#@Chandra Chekuri,Luca Trevisan
#t2009
#cAlgorithmica
#index1219495
#% 
#!
  
#*An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.
#@Jianer Chen,Yang Liu,Songjian Lu
#t2009
#cAlgorithmica
#index1219496
#% 
#!
  
#*Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.
#@V. S. Anil Kumar,Madhav V. Marathe,Srinivasan Parthasarathy,Aravind Srinivasan
#t2009
#cAlgorithmica
#index1219497
#% 
#!
  
#*Online Search with Time-Varying Price Bounds.
#@Peter Damaschke,Phuong Hoai Ha,Philippas Tsigas
#t2009
#cAlgorithmica
#index1266526
#% 
#!
  
#*A Lower Bound for Scheduling Mechanisms.
#@George Christodoulou,Elias Koutsoupias,Angelina Vidali
#t2009
#cAlgorithmica
#index1266527
#% 
#!
  
#*Clamshell Casting.
#@Prosenjit Bose,Pat Morin,Michiel H. M. Smid,Stefanie Wuhrer
#t2009
#cAlgorithmica
#index1266528
#% 
#!
  
#*Structure and Recognition of Graphs with No 6-wheel Subdivision.
#@Rebecca Robinson,Graham Farr
#t2009
#cAlgorithmica
#index1266529
#% 
#!
  
#*Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
#@Leah Epstein,Magnús M. Halldórsson,Asaf Levin,Hadas Shachnai
#t2009
#cAlgorithmica
#index1266530
#% 
#!
  
#*Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.
#@Binay K. Bhattacharya,Qiaosheng Shi,Arie Tamir
#t2009
#cAlgorithmica
#index1266531
#% 
#!
  
#*An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem.
#@Takeaki Uno
#t2010
#cAlgorithmica
#index1331997
#% 
#!
  
#*Minimum Degree Orderings.
#@Hiroshi Nagamochi
#t2010
#cAlgorithmica
#index1332007
#% 
#!
  
#*Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.
#@Liming Cai,Xiuzhen Huang
#t2010
#cAlgorithmica
#index1332041
#% 
#!
  
#*On Independent Vertex Sets in Subclasses of Apple-Free Graphs.
#@Andreas Brandstädt,Tilo Klembt,Vadim V. Lozin,Raffaele Mosca
#t2010
#cAlgorithmica
#index1332014
#% 
#!
  
#*Faster Two Dimensional Scaled Matching.
#@Amihood Amir,Eran Chencinski
#t2010
#cAlgorithmica
#index1332022
#% 
#!
  
#*Approximate -Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.
#@Danny Segev,Gil Segev
#t2010
#cAlgorithmica
#index1332021
#% 
#!
  
#*Note on the Structure of Kruskal's Algorithm.
#@Nicolas Broutin,Luc Devroye,Erin McLeish
#t2010
#cAlgorithmica
#index1331998
#% 
#!
  
#*In-Place Algorithms for Computing (Layers of) Maxima.
#@Henrik Blunck,Jan Vahrenhold
#t2010
#cAlgorithmica
#index1332042
#% 
#!
  
#*Approximation Algorithms for Treewidth.
#@Eyal Amir
#t2010
#cAlgorithmica
#index1332027
#% 
#!
  
#*Largest and Smallest Convex Hulls for Imprecise Points.
#@Maarten Löffler,Marc J. van Kreveld
#t2010
#cAlgorithmica
#index1332008
#% 
#!
  
#*Integer Representation and Counting in the Bit Probe Model.
#@M. Ziaur Rahman,J. Ian Munro
#t2010
#cAlgorithmica
#index1332013
#% 
#!
  
#*A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI.
#@Jianxin Wang,Minzhu Xie,Jianer Chen
#t2010
#cAlgorithmica
#index1332028
#% 
#!
  
#*Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem.
#@Thomas Jansen,Dennis Weyland
#t2010
#cAlgorithmica
#index1332037
#% 
#!
  
#*On the Convergence of Multicast Games in Directed Networks.
#@Angelo Fanelli,Michele Flammini,Luca Moscardelli
#t2010
#cAlgorithmica
#index1332030
#% 
#!
  
#*Faster Combinatorial Algorithms for Determinant and Pfaffian.
#@Anna Urbanska
#t2010
#cAlgorithmica
#index1332001
#% 
#!
  
#*Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.
#@Mingen Lin,Yang Yang,Jinhui Xu
#t2010
#cAlgorithmica
#index1332047
#% 
#!
  
#*Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes.
#@L. Sunil Chandran,Mathew C. Francis,Naveen Sivadasan
#t2010
#cAlgorithmica
#index1332018
#% 
#!
  
#*On the Planar Piecewise Quadratic 1-Center Problem.
#@Justo Puerto,Antonio M. Rodríguez-Chía,Arie Tamir
#t2010
#cAlgorithmica
#index1332036
#% 
#!
  
#*Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights.
#@Li-Pu Yeh,Biing-Feng Wang,Hsin-Hao Su
#t2010
#cAlgorithmica
#index1332011
#% 
#!
  
#*Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly.
#@Sudheer Sahu,John H. Reif
#t2010
#cAlgorithmica
#index1332002
#% 
#!
  
#*A Constant-Competitive Algorithm for Online OVSF Code Assignment.
#@Francis Y. L. Chin,Hing-Fung Ting,Yong Zhang
#t2010
#cAlgorithmica
#index1332017
#% 
#!
  
#*New Approximation Bounds for Lpt Scheduling.
#@Annamária Kovács
#t2010
#cAlgorithmica
#index1332029
#% 
#!
  
#*Approximating Tree Edit Distance through String Edit Distance.
#@Tatsuya Akutsu,Daiji Fukagawa,Atsuhiro Takasu
#t2010
#cAlgorithmica
#index1332038
#% 
#!
  
#*Recent Advances in Computation and Combinatorial Optimization.
#@Xiaodong Hu,Jie Wang
#t2010
#cAlgorithmica
#index1331996
#% 
#!
  
#*Collective Tree Spanners in Graphs with Bounded Parameters.
#@Feodor F. Dragan,Chenyu Yan
#t2010
#cAlgorithmica
#index1332046
#% 
#!
  
#*Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
#@Hagit Attiya,Leah Epstein,Hadas Shachnai,Tami Tamir
#t2010
#cAlgorithmica
#index1332035
#% 
#!
  
#*Quantum Separation of Local Search and Fixed Point Computation.
#@Xi Chen,Xiaoming Sun,Shang-Hua Teng
#t2010
#cAlgorithmica
#index1332003
#% 
#!
  
#*Random Matrices and Codes for the Erasure Channel.
#@Chris Studholme,Ian F. Blake
#t2010
#cAlgorithmica
#index1332012
#% 
#!
  
#*Secure Overlay Network Design.
#@Li (Erran) Li,Mohammad Mahdian,Vahab S. Mirrokni
#t2010
#cAlgorithmica
#index1332048
#% 
#!
  
#*Design and Analysis of Online Batching Systems.
#@Regant Y. S. Hung,Hing-Fung Ting
#t2010
#cAlgorithmica
#index1332045
#% 
#!
  
#*Resource Bounded Frequency Computations with Three Errors.
#@Ulrich Hertrampf,Christoph Minnameier
#t2010
#cAlgorithmica
#index1332004
#% 
#!
  
#*A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.
#@Vladimir Kolmogorov
#t2010
#cAlgorithmica
#index1332020
#% 
#!
  
#*A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set.
#@Henning Fernau
#t2010
#cAlgorithmica
#index1332032
#% 
#!
  
#*Aggregation of Partial Rankings, -Ratings and Top- Lists.
#@Nir Ailon
#t2010
#cAlgorithmica
#index1332039
#% 
#!
  
#*Foreword.
#@Takeshi Tokuyama
#t2010
#cAlgorithmica
#index1332009
#% 
#!
  
#*On Mixing and Edge Expansion Properties in Randomized Broadcasting.
#@Thomas Sauerwald
#t2010
#cAlgorithmica
#index1332010
#% 
#!
  
#*Evolutionary Algorithms and Matroid Optimization Problems.
#@Joachim Reichel,Martin Skutella
#t2010
#cAlgorithmica
#index1332040
#% 
#!
  
#*Spreading Metrics for Vertex Ordering Problems.
#@Moses Charikar,Mohammad Taghi Hajiaghayi,Howard J. Karloff,Satish Rao
#t2010
#cAlgorithmica
#index1331999
#% 
#!
  
#*Structural Identifiability in Low-Rank Matrix Factorization.
#@Epameinondas Fritzilas,Martin Milanic,Sven Rahmann,Yasmin A. Rios-Solis
#t2010
#cAlgorithmica
#index1332006
#% 
#!
  
#*Planar Polyline Drawings via Graph Transformations.
#@Huaming Zhang
#t2010
#cAlgorithmica
#index1332031
#% 
#!
  
#*Augmenting the Connectivity of Outerplanar Graphs.
#@Alfredo García Olaverri,Ferran Hurtado,Marc Noy,Javier Tejel
#t2010
#cAlgorithmica
#index1332023
#% 
#!
  
#*On the Longest Common Rigid Subsequence Problem.
#@Nikhil Bansal,Moshe Lewenstein,Bin Ma,Kaizhong Zhang
#t2010
#cAlgorithmica
#index1332019
#% 
#!
  
#*Stability in the Self-Organized Evolution of Networks.
#@Madeleine Theile,Thomas Jansen
#t2010
#cAlgorithmica
#index1332033
#% 
#!
  
#*A Universal Online Caching Algorithm Based on Pattern Matching.
#@Gopal Pandurangan,Wojciech Szpankowski
#t2010
#cAlgorithmica
#index1332043
#% 
#!
  
#*Bin Packing with Rejection Revisited.
#@Leah Epstein
#t2010
#cAlgorithmica
#index1332016
#% 
#!
  
#*An Algorithm for Minimum Cost Arc-Connectivity Orientations.
#@Satoru Iwata,Yusuke Kobayashi
#t2010
#cAlgorithmica
#index1332000
#% 
#!
  
#*Fast Dynamic Transitive Closure with Lookahead.
#@Piotr Sankowski,Marcin Mucha
#t2010
#cAlgorithmica
#index1332026
#% 
#!
  
#*Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms.
#@Anne Auger,Olivier Teytaud
#t2010
#cAlgorithmica
#index1332050
#% 
#!
  
#*Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs.
#@Toshimasa Ishii,Yoko Akiyama,Hiroshi Nagamochi
#t2010
#cAlgorithmica
#index1332015
#% 
#!
  
#*Approximation Algorithms for Requirement Cut on Graphs.
#@Viswanath Nagarajan,R. Ravi
#t2010
#cAlgorithmica
#index1332025
#% 
#!
  
#*A Timing Assumption and Two -Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems.
#@Antonio Fernández,Ernesto Jiménez,Michel Raynal,Gilles Trédan
#t2010
#cAlgorithmica
#index1332005
#% 
#!
  
#*Computing median and antimedian sets in median graphs.
#@Kannan Balakrishnan,Bostjan Bresar,Manoj Changat,Sandi Klavzar,Matjaz Kovse,Ajitha R. Subhamathi
#t2010
#cAlgorithmica
#index1332044
#% 
#!
  
#*Editorial.
#@Benjamin Doerr,Frank Neumann,Ingo Wegener
#t2010
#cAlgorithmica
#index1332034
#% 
#!
  
#*A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree.
#@Xianyue Li,Feng Zou,Yaochun Huang,Donghyun Kim,Weili Wu
#t2010
#cAlgorithmica
#index1332024
#% 
#!
  
#*Deciding -Colorability of -Free Graphs in Polynomial Time.
#@Chính T. Hoàng,Marcin Kaminski,Vadim V. Lozin,Joe Sawada,Xiao Shu
#t2010
#cAlgorithmica
#index1332049
#% 
#!
  
#*Algorithms for Data Migration.
#@Eric Anderson,Joseph Hall,Jason D. Hartline,M. Hobbes,Anna R. Karlin,Jared Saia,Ram Swaminathan,John Wilkes
#t2010
#cAlgorithmica
#index1332051
#% 
#!
  
#*On Locally Decodable Codes, Self-Correctable Codes, and -Private PIR.
#@Omer Barkol,Yuval Ishai,Enav Weinreb
#t2010
#cAlgorithmica
#index2915529
#% 
#!
  
#*Well Supported Approximate Equilibria in Bimatrix Games.
#@Spyros C. Kontogiannis,Paul G. Spirakis
#t2010
#cAlgorithmica
#index2915547
#% 
#!
  
#*Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives.
#@Sung-woo Cho,Ashish Goel
#t2010
#cAlgorithmica
#index2915543
#% 
#!
  
#*Algorithmic Aspects of Proportional Symbol Maps.
#@Sergio Cabello,Herman J. Haverkort,Marc J. van Kreveld,Bettina Speckmann
#t2010
#cAlgorithmica
#index2915575
#% 
#!
  
#*The Complexity of Bottleneck Labeled Graph Problems.
#@Refael Hassin,Jérôme Monnot,Danny Segev
#t2010
#cAlgorithmica
#index2915562
#% 
#!
  
#*Computing the Greedy Spanner in Near-Quadratic Time.
#@Prosenjit Bose,Paz Carmi,Mohammad Farshi,Anil Maheshwari,Michiel H. M. Smid
#t2010
#cAlgorithmica
#index2915528
#% 
#!
  
#*Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.
#@Emilio Di Giacomo,Giuseppe Liotta,Francesco Trotta
#t2010
#cAlgorithmica
#index2915538
#% 
#!
  
#*Approximation Algorithms for Scheduling with Reservations.
#@Florian Diedrich,Klaus Jansen,Fanny Pascual,Denis Trystram
#t2010
#cAlgorithmica
#index2915583
#% 
#!
  
#*Broadcasting on Networks of Workstations.
#@Samir Khuller,Yoo-Ah Kim,Yung-Chun (Justin) Wan
#t2010
#cAlgorithmica
#index2915553
#% 
#!
  
#*A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs.
#@Louis Ibarra
#t2010
#cAlgorithmica
#index2915576
#% 
#!
  
#*Almost Stable Matchings by Truncating the Gale-Shapley Algorithm.
#@Patrik Floréen,Petteri Kaski,Valentin Polishchuk,Jukka Suomela
#t2010
#cAlgorithmica
#index2915567
#% 
#!
  
#*Confluently Persistent Tries for Efficient Version Control.
#@Erik D. Demaine,Stefan Langerman,Eric Price
#t2010
#cAlgorithmica
#index2915542
#% 
#!
  
#*Homogeneous String Segmentation using Trees and Weighted Independent Sets.
#@Peter Damaschke
#t2010
#cAlgorithmica
#index2915539
#% 
#!
  
#*On Metric Clustering to Minimize the Sum of Radii.
#@Matt Gibson,Gaurav Kanade,Erik Krohn,Imran A. Pirwani,Kasturi R. Varadarajan
#t2010
#cAlgorithmica
#index2915559
#% 
#!
  
#*Introduction to the Special Section on Internet and Network Economics.
#@Xiaotie Deng,Fan Chung Graham
#t2010
#cAlgorithmica
#index2915532
#% 
#!
  
#*Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows.
#@Anne Benoit,Yves Robert
#t2010
#cAlgorithmica
#index2915552
#% 
#!
  
#*Maintaining Equilibria During Exploration in Sponsored Search Auctions.
#@John Langford,Lihong Li,Yevgeniy Vorobeychik,Jennifer Wortman
#t2010
#cAlgorithmica
#index2915577
#% 
#!
  
#*Kinetic Facility Location.
#@Bastian Degener,Joachim Gehweiler,Christiane Lammersen
#t2010
#cAlgorithmica
#index2915541
#% 
#!
  
#*NBmalloc: Allocating Memory in a Lock-Free Manner.
#@Anders Gidenstam,Marina Papatriantafilou,Philippas Tsigas
#t2010
#cAlgorithmica
#index2915522
#% 
#!
  
#*Fractional Path Coloring in Bounded Degree Trees with Applications.
#@Ioannis Caragiannis,Afonso Ferreira,Christos Kaklamanis,Stéphane Pérennes,Hervé Rivano
#t2010
#cAlgorithmica
#index2915560
#% 
#!
  
#*The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs.
#@Katerina Asdre,Stavros D. Nikolopoulos
#t2010
#cAlgorithmica
#index2915588
#% 
#!
  
#*A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games.
#@Jun Wako
#t2010
#cAlgorithmica
#index2915521
#% 
#!
  
#*Near-Entropy Hotlink Assignments.
#@Karim Douïeb,Stefan Langerman
#t2010
#cAlgorithmica
#index2915531
#% 
#!
  
#*Compressed Indexes for Approximate String Matching.
#@Ho-Leung Chan,Tak Wah Lam,Wing-Kin Sung,Siu-Lung Tam,Swee-Seong Wong
#t2010
#cAlgorithmica
#index2915570
#% 
#!
  
#*Guarding a Terrain by Two Watchtowers.
#@Pankaj K. Agarwal,Sergey Bereg,Ovidiu Daescu,Haim Kaplan,Simeon C. Ntafos,Micha Sharir,Binhai Zhu
#t2010
#cAlgorithmica
#index2915569
#% 
#!
  
#*A Sequential Algorithm for Generating Random Graphs.
#@Mohsen Bayati,Jeong Han Kim,Amin Saberi
#t2010
#cAlgorithmica
#index2915526
#% 
#!
  
#*An Experimental Study of New and Known Online Packet Buffering Algorithms.
#@Susanne Albers,Tobias Jacobs
#t2010
#cAlgorithmica
#index2915540
#% 
#!
  
#*Gaming Prediction Markets: Equilibrium Strategies with a Market Maker.
#@Yiling Chen,Stanko Dimitrov,Rahul Sami,Daniel M. Reeves,David M. Pennock,Robin D. Hanson,Lance Fortnow,Rica Gonen
#t2010
#cAlgorithmica
#index2915578
#% 
#!
  
#*Slow Mixing of Markov Chains Using Fault Lines and Fat Contours.
#@Sam Greenberg,Dana Randall
#t2010
#cAlgorithmica
#index2915586
#% 
#!
  
#*Scheduling Jobs on Grid Processors.
#@Joan Boyar,Lene M. Favrholdt
#t2010
#cAlgorithmica
#index2915551
#% 
#!
  
#*Multi-Color Pebble Motion on Graphs.
#@Gilad Goraly,Refael Hassin
#t2010
#cAlgorithmica
#index2915579
#% 
#!
  
#*Housing Markets Through Graphs.
#@Katarína Cechlárová,Tamás Fleiner
#t2010
#cAlgorithmica
#index2915587
#% 
#!
  
#*An Efficient Algorithm for Batch Stability Testing.
#@John Dabney,Brian C. Dean
#t2010
#cAlgorithmica
#index2915564
#% 
#!
  
#*Space Efficient Algorithms for the Burrows-Wheeler Backtransformation.
#@Ulrich Lauther,Tamás Lukovszki
#t2010
#cAlgorithmica
#index2915534
#% 
#!
  
#*Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties.
#@Dániel Marx,Ildikó Schlotter
#t2010
#cAlgorithmica
#index2915520
#% 
#!
  
#*The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open.
#@N. Innami,B. H. Kim,Y. Mashiko,K. Shiohama
#t2010
#cAlgorithmica
#index2915557
#% 
#!
  
#*Three-Sided Stable Matchings with Cyclic Preferences.
#@Péter Biró,Eric McDermid
#t2010
#cAlgorithmica
#index2915533
#% 
#!
  
#*Approximate Boyer-Moore String Matching for Small Alphabets.
#@Leena Salmela,Jorma Tarhio,Petri Kalsi
#t2010
#cAlgorithmica
#index2915571
#% 
#!
  
#*On Sorting, Heaps, and Minimum Spanning Trees.
#@Gonzalo Navarro,Rodrigo Paredes
#t2010
#cAlgorithmica
#index2915550
#% 
#!
  
#*Assigning Papers to Referees.
#@Naveen Garg,Telikepalli Kavitha,Amit Kumar,Kurt Mehlhorn,Julián Mestre
#t2010
#cAlgorithmica
#index2915535
#% 
#!
  
#*Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.
#@Hans Kellerer,Vitaly A. Strusevich
#t2010
#cAlgorithmica
#index2915549
#% 
#!
  
#*Analysis of the Expected Number of Bit Comparisons Required by Quickselect.
#@James Allen Fill,Takéhiko Nakama
#t2010
#cAlgorithmica
#index2915585
#% 
#!
  
#*In Memoriam: Ingo Wegener.
#@Benjamin Doerr,Frank Neumann
#t2010
#cAlgorithmica
#index2915524
#% 
#!
  
#*Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists.
#@Hirotatsu Kobayashi,Tomomi Matsui
#t2010
#cAlgorithmica
#index2915527
#% 
#!
  
#*On the Fastest Vickrey Algorithm.
#@Elena Grigorieva,P. Jean-Jacques Herings,Rudolf Müller,Dries Vermeulen
#t2010
#cAlgorithmica
#index2915563
#% 
#!
  
#*Fast 3-coloring Triangle-Free Planar Graphs.
#@Lukasz Kowalik
#t2010
#cAlgorithmica
#index2915580
#% 
#!
  
#*Guest Editorial: Special Issue on Matching Under Preferences.
#@David Manlove,Robert W. Irving,Kazuo Iwama
#t2010
#cAlgorithmica
#index2915572
#% 
#!
  
#*On Covering Problems of Rado.
#@Sergey Bereg,Adrian Dumitrescu,Minghui Jiang
#t2010
#cAlgorithmica
#index2915558
#% 
#!
  
#*On Robustness of Forward-looking in Sponsored Search Auction.
#@Tian-Ming Bu,Li Liang,Qi Qi
#t2010
#cAlgorithmica
#index2915573
#% 
#!
  
#*Editorial, SWAT 2008 Special Issue.
#@Joachim Gudmundsson
#t2010
#cAlgorithmica
#index2915548
#% 
#!
  
#*Circular Stable Matching and 3-way Kidney Transplant.
#@Chien-Chung Huang
#t2010
#cAlgorithmica
#index2915536
#% 
#!
  
#*On the Benefits of Adaptivity in Property Testing of Dense Graphs.
#@Mira Gonen,Dana Ron
#t2010
#cAlgorithmica
#index2915584
#% 
#!
  
#*Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.
#@Christophe Crespelle,Christophe Paul
#t2010
#cAlgorithmica
#index2915525
#% 
#!
  
#*Constructing Labeling Schemes through Universal Matrices.
#@Amos Korman,David Peleg,Yoav Rodeh
#t2010
#cAlgorithmica
#index2915545
#% 
#!
  
#*Boundary Labeling with Octilinear Leaders.
#@Michael A. Bekos,Michael Kaufmann,Martin Nöllenburg,Antonios Symvonis
#t2010
#cAlgorithmica
#index2915555
#% 
#!
  
#*The Stable Roommates Problem with Choice Functions.
#@Tamás Fleiner
#t2010
#cAlgorithmica
#index2915566
#% 
#!
  
#*Faster Algorithms for Stable Allocation Problems.
#@Brian C. Dean,Siddharth Munshi
#t2010
#cAlgorithmica
#index2915581
#% 
#!
  
#*Stochastic Models for Budget Optimization in Search-Based Advertising.
#@S. Muthukrishnan,Martin Pál,Zoya Svitkina
#t2010
#cAlgorithmica
#index2915574
#% 
#!
  
#*Fingerprint Clustering with Bounded Number of Missing Values.
#@Paola Bonizzoni,Gianluca Della Vedova,Riccardo Dondi,Giancarlo Mauri
#t2010
#cAlgorithmica
#index2915582
#% 
#!
  
#*Understanding the Generalized Median Stable Matchings.
#@Christine T. Cheng
#t2010
#cAlgorithmica
#index2915530
#% 
#!
  
#*A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.
#@Yossi Azar,Uriel Feige,Daniel Glasner
#t2010
#cAlgorithmica
#index2915546
#% 
#!
  
#*Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings.
#@Seok-Hee Hong,Hiroshi Nagamochi
#t2010
#cAlgorithmica
#index2915537
#% 
#!
  
#*Chordal Deletion is Fixed-Parameter Tractable.
#@Dániel Marx
#t2010
#cAlgorithmica
#index2915556
#% 
#!
  
#*Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks.
#@Joseph Wun-Tat Chan,Francis Y. L. Chin,Deshi Ye,Yong Zhang
#t2010
#cAlgorithmica
#index2915565
#% 
#!
  
#*New Results on Web Caching with Request Reordering.
#@Susanne Albers
#t2010
#cAlgorithmica
#index2915568
#% 
#!
  
#*Approximate Shortest Paths Guided by a Small Index.
#@Jörg Derungs,Riko Jacob,Peter Widmayer
#t2010
#cAlgorithmica
#index2915554
#% 
#!
  
#*Improved Bounds for Wireless Localization.
#@Tobias Christ,Michael Hoffmann,Yoshio Okamoto,Takeaki Uno
#t2010
#cAlgorithmica
#index2915544
#% 
#!
  
#*Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.
#@Frederic Dorn,Eelko Penninkx,Hans L. Bodlaender,Fedor V. Fomin
#t2010
#cAlgorithmica
#index2915561
#% 
#!
  
#*A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs.
#@Seok-Hee Hong,Hiroshi Nagamochi
#t2010
#cAlgorithmica
#index2915523
#% 
#!
  
#*Improved Algorithms for Maximum Agreement and Compatible Supertrees.
#@Viet Tung Hoang,Wing-Kin Sung
#t2011
#cAlgorithmica
#index2963640
#% 
#!
  
#*Making Doubling Metrics Geodesic.
#@Anupam Gupta,Kunal Talwar
#t2011
#cAlgorithmica
#index2963631
#% 
#!
  
#*Random 2 XORSAT Phase Transition.
#@Hervé Daudé,Vlady Ravelomanana
#t2011
#cAlgorithmica
#index2963643
#% 
#!
  
#*Linear-Time Construction of Two-Dimensional Suffix Trees.
#@Dong Kyue Kim,Joong Chae Na,Jeong Seop Sim,Kunsoo Park
#t2011
#cAlgorithmica
#index2963639
#% 
#!
  
#*Precision, Local Search and Unimodal Functions.
#@Martin Dietzfelbinger,Jonathan E. Rowe,Ingo Wegener,Philipp Woelfel
#t2011
#cAlgorithmica
#index2963625
#% 
#!
  
#*Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded.
#@Jens Jägersküpper
#t2011
#cAlgorithmica
#index2963632
#% 
#!
  
#*Origami Embedding of Piecewise-Linear Two-Manifolds.
#@Marshall W. Bern,Barry Hayes
#t2011
#cAlgorithmica
#index2963642
#% 
#!
  
#*35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality.
#@Lukasz Kowalik,Marcin Mucha
#t2011
#cAlgorithmica
#index2963633
#% 
#!
  
#*The Stackelberg Minimum Spanning Tree Game.
#@Jean Cardinal,Erik D. Demaine,Samuel Fiorini,Gwenaël Joret,Stefan Langerman,Ilan Newman,Oren Weimann
#t2011
#cAlgorithmica
#index2963646
#% 
#!
  
#*Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments.
#@Mohamed Jebalia,Anne Auger,Nikolaus Hansen
#t2011
#cAlgorithmica
#index2963634
#% 
#!
  
#*Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation.
#@Pietro Simone Oliveto,Carsten Witt
#t2011
#cAlgorithmica
#index2963645
#% 
#!
  
#*Finding Total Unimodularity in Optimization Problems Solved by Linear Programs.
#@Christoph Dürr,Mathilde Hurand
#t2011
#cAlgorithmica
#index2963641
#% 
#!
  
#*Exact Algorithms for (2, 1)-Labeling of Graphs.
#@Frédéric Havet,Martin Klazar,Jan Kratochvíl,Dieter Kratsch,Mathieu Liedloff
#t2011
#cAlgorithmica
#index2963648
#% 
#!
  
#*Theory of Evolutionary Computation.
#@Benjamin Doerr,Thomas Jansen
#t2011
#cAlgorithmica
#index2963626
#% 
#!
  
#*Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima.
#@Dirk Sudholt
#t2011
#cAlgorithmica
#index2963630
#% 
#!
  
#*Approximation Algorithms for -hurdle Problems.
#@Brian C. Dean,Adam Griffis,Ojas Parekh,Adam A. Whitley
#t2011
#cAlgorithmica
#index2963635
#% 
#!
  
#*Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
#@Eduardo Sany Laber,Claudson F. Bornstein,Cristina Fernandes
#t2011
#cAlgorithmica
#index2963636
#% 
#!
  
#*Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns.
#@Hervé Fournier,Olivier Teytaud
#t2011
#cAlgorithmica
#index2963647
#% 
#!
  
#*Quantum Property Testing of Group Solvability.
#@Yoshifumi Inui,François Le Gall
#t2011
#cAlgorithmica
#index2963629
#% 
#!
  
#*On Dissemination Thresholds in Regular and Irregular Graph Classes.
#@Ivan Rapaport,Karol Suchan,Ioan Todinca,Jacques Verstraëte
#t2011
#cAlgorithmica
#index2963628
#% 
#!
  
#*Augmenting the Rigidity of a Graph in .
#@Alfredo García Olaverri,Javier Tejel
#t2011
#cAlgorithmica
#index2963637
#% 
#!
  
#*Linear-Time Recognition of Helly Circular-Arc Models and Graphs.
#@Benson L. Joeris,Min Chih Lin,Ross M. McConnell,Jeremy Spinrad,Jayme Luiz Szwarcfiter
#t2011
#cAlgorithmica
#index2963627
#% 
#!
  
#*Energy Efficient Monitoring in Sensor Networks.
#@Amol Deshpande,Samir Khuller,Azarakhsh Malekian,Mohammed Toossi
#t2011
#cAlgorithmica
#index2963649
#% 
#!
  
#*Approximate Range Searching in External Memory.
#@Micha Streppel,Ke Yi
#t2011
#cAlgorithmica
#index2963644
#% 
#!
  
#*Computing Minimum Cuts by Randomized Search Heuristics.
#@Frank Neumann,Joachim Reichel,Martin Skutella
#t2011
#cAlgorithmica
#index2963638
#% 
#!
  
#*Minimum Weight Convex Steiner Partitions.
#@Adrian Dumitrescu,Csaba D. Tóth
#t2011
#cAlgorithmica
#index3060809
#% 
#!
  
#*Approximability of Packing Disjoint Cycles.
#@Zachary Friggstad,Mohammad R. Salavatipour
#t2011
#cAlgorithmica
#index3060820
#% 
#!
  
#*Fitting a Step Function to a Point Set.
#@Hervé Fournier,Antoine Vigneron
#t2011
#cAlgorithmica
#index3060795
#% 
#!
  
#*Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
#@Zoltán Király
#t2011
#cAlgorithmica
#index3060798
#% 
#!
  
#*An Approximation Algorithm for Binary Searching in Trees.
#@Eduardo Sany Laber,Marco Molinaro
#t2011
#cAlgorithmica
#index3060782
#% 
#!
  
#*Maximum Flow in Directed Planar Graphs with Vertex Capacities.
#@Haim Kaplan,Yahav Nussbaum
#t2011
#cAlgorithmica
#index3060841
#% 
#!
  
#*New Approximation Algorithms for Minimum Cycle Bases of Graphs.
#@Telikepalli Kavitha,Kurt Mehlhorn,Dimitrios Michail
#t2011
#cAlgorithmica
#index3060783
#% 
#!
  
#*Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy.
#@Danny Z. Chen,Shuang Luan,Chao Wang
#t2011
#cAlgorithmica
#index3060791
#% 
#!
  
#*Selfish Bin Packing.
#@Leah Epstein,Elena Kleiman
#t2011
#cAlgorithmica
#index3060819
#% 
#!
  
#*Out-of-Order Event Processing in Kinetic Data Structures.
#@Mohammad Ali Abam,Pankaj K. Agarwal,Mark de Berg,Hai Yu
#t2011
#cAlgorithmica
#index3060806
#% 
#!
  
#*Geometric Spanners for Weighted Point Sets.
#@Mohammad Ali Abam,Mark de Berg,Mohammad Farshi,Joachim Gudmundsson,Michiel H. M. Smid
#t2011
#cAlgorithmica
#index3060840
#% 
#!
  
#*Constant-Degree Graph Expansions that Preserve Treewidth.
#@Igor L. Markov,Yaoyun Shi
#t2011
#cAlgorithmica
#index3060790
#% 
#!
  
#*Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for -Fitting Robinson Structures to Distances.
#@Victor Chepoi,Morgan Seston
#t2011
#cAlgorithmica
#index3060788
#% 
#!
  
#*An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times.
#@Srikrishnan Divakaran,Michael E. Saks
#t2011
#cAlgorithmica
#index3060800
#% 
#!
  
#*Time-Dependent SHARC-Routing.
#@Daniel Delling
#t2011
#cAlgorithmica
#index3060797
#% 
#!
  
#*Improved Approximations for Guarding 1.5-Dimensional Terrains.
#@Khaled M. Elbassioni,Erik Krohn,Domagoj Matijevic,Julián Mestre,Domagoj Severdija
#t2011
#cAlgorithmica
#index3060818
#% 
#!
  
#*Exact Algorithms for Cluster Editing: Evaluation and Experiments.
#@Sebastian Böcker,Sebastian Briesemeister,Gunnar W. Klau
#t2011
#cAlgorithmica
#index3060807
#% 
#!
  
#*Crossing Number and Weighted Crossing Number of Near-Planar Graphs.
#@Sergio Cabello,Bojan Mohar
#t2011
#cAlgorithmica
#index3060801
#% 
#!
  
#*Testing Convexity Properties of Tree Colorings.
#@Eldar Fischer,Orly Yahalom
#t2011
#cAlgorithmica
#index3060832
#% 
#!
  
#*Approximating Minimum-Power Degree and Connectivity Problems.
#@Guy Kortsarz,Vahab S. Mirrokni,Zeev Nutov,Elena Tsanko
#t2011
#cAlgorithmica
#index3060826
#% 
#!
  
#*Testing Periodicity.
#@Oded Lachish,Ilan Newman
#t2011
#cAlgorithmica
#index3060803
#% 
#!
  
#*Deterministic Sampling Algorithms for Network Design.
#@Anke van Zuylen
#t2011
#cAlgorithmica
#index3060796
#% 
#!
  
#*A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication.
#@Andrzej Lingas
#t2011
#cAlgorithmica
#index3060842
#% 
#!
  
#*Detecting Regular Visit Patterns.
#@Bojan Djordjevic,Joachim Gudmundsson,Anh Pham,Thomas Wolle
#t2011
#cAlgorithmica
#index3060835
#% 
#!
  
#*Special Issue: European Symposium on Algorithms, Design and Analysis.
#@Amos Fiat
#t2011
#cAlgorithmica
#index3060846
#% 
#!
  
#*Crossing Numbers of Graphs with Rotation Systems.
#@Michael J. Pelsmajer,Marcus Schaefer,Daniel Stefankovic
#t2011
#cAlgorithmica
#index3060816
#% 
#!
  
#*Algorithms for Marketing-Mix Optimization.
#@Joachim Gudmundsson,Pat Morin,Michiel H. M. Smid
#t2011
#cAlgorithmica
#index3060833
#% 
#!
  
#*Linear Time Algorithms for Generalizations of the Longest Common Substring Problem.
#@Michael Arnold,Enno Ohlebusch
#t2011
#cAlgorithmica
#index3060825
#% 
#!
  
#*Competitive Algorithms for Due Date Scheduling.
#@Nikhil Bansal,Ho-Leung Chan,Kirk Pruhs
#t2011
#cAlgorithmica
#index3060789
#% 
#!
  
#*Peeling Meshed Potatoes.
#@Boris Aronov,Marc J. van Kreveld,Maarten Löffler,Rodrigo I. Silveira
#t2011
#cAlgorithmica
#index3060812
#% 
#!
  
#*Approximate Pattern Matching with the , and Metrics.
#@Ohad Lipsky,Ely Porat
#t2011
#cAlgorithmica
#index3060817
#% 
#!
  
#*The Directed Orienteering Problem.
#@Viswanath Nagarajan,R. Ravi
#t2011
#cAlgorithmica
#index3060827
#% 
#!
  
#*Approximability of Sparse Integer Programs.
#@David Pritchard,Deeparnab Chakrabarty
#t2011
#cAlgorithmica
#index3060843
#% 
#!
  
#*Trade-offs Between the Size of Advice and Broadcasting Time in Trees.
#@Emanuele G. Fusco,Andrzej Pelc
#t2011
#cAlgorithmica
#index3060834
#% 
#!
  
#*-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.
#@Yuval Emek
#t2011
#cAlgorithmica
#index3060847
#% 
#!
  
#*Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum -Way Cut Problem.
#@Mingyu Xiao,Leizhen Cai,Andrew Chi-Chih Yao
#t2011
#cAlgorithmica
#index3060786
#% 
#!
  
#*Finding a Minimum-depth Embedding of a Planar Graph in () Time.
#@Patrizio Angelini,Giuseppe Di Battista,Maurizio Patrignani
#t2011
#cAlgorithmica
#index3060830
#% 
#!
  
#*Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy.
#@Nikhil Bansal,Danny Z. Chen,Don Coppersmith,Xiaobo Sharon Hu,Shuang Luan,Ewa Misiolek,Baruch Schieber,Chao Wang
#t2011
#cAlgorithmica
#index3060824
#% 
#!
  
#*Common Intervals of Multiple Permutations.
#@Steffen Heber,Richard Mayr,Jens Stoye
#t2011
#cAlgorithmica
#index3060802
#% 
#!
  
#*Sweeping Points.
#@Adrian Dumitrescu,Minghui Jiang
#t2011
#cAlgorithmica
#index3060813
#% 
#!
  
#*On the Performance of Approximate Equilibria in Congestion Games.
#@George Christodoulou,Elias Koutsoupias,Paul G. Spirakis
#t2011
#cAlgorithmica
#index3060844
#% 
#!
  
#*An Approximation Algorithm for the Minimum Co-Path Set Problem.
#@Zhi-Zhong Chen,Guohui Lin,Lusheng Wang
#t2011
#cAlgorithmica
#index3060828
#% 
#!
  
#*Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.
#@Markus Bläser,Christian Hoffmann
#t2011
#cAlgorithmica
#index3060848
#% 
#!
  
#*On Bounded Leg Shortest Paths Problems.
#@Liam Roditty,Michael Segal
#t2011
#cAlgorithmica
#index3060787
#% 
#!
  
#*Capacitated Domination Problem.
#@Mong-Jen Kao,Chung-Shou Liao,D. T. Lee
#t2011
#cAlgorithmica
#index3060805
#% 
#!
  
#*Piercing Translates and Homothets of a Convex Body.
#@Adrian Dumitrescu,Minghui Jiang
#t2011
#cAlgorithmica
#index3060849
#% 
#!
  
#*Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.
#@Athanassios Koutsonas,Dimitrios M. Thilikos
#t2011
#cAlgorithmica
#index3060831
#% 
#!
  
#*Spiraling and Folding: The Word View.
#@Marcus Schaefer,Eric Sedgwick,Daniel Stefankovic
#t2011
#cAlgorithmica
#index3060810
#% 
#!
  
#*Guest Editorial: Selected Papers from European Symposium on Algorithms.
#@Dan Halperin,Kurt Mehlhorn
#t2011
#cAlgorithmica
#index3060793
#% 
#!
  
#*Colored Simultaneous Geometric Embeddings and Universal Pointsets.
#@Ulrik Brandes,Cesim Erten,Alejandro Estrella-Balderrama,J. Joseph Fowler,Fabrizio Frati,Markus Geyer,Carsten Gutwenger,Seok-Hee Hong,Michael Kaufmann,Stephen G. Kobourov,et al.
#t2011
#cAlgorithmica
#index3060814
#% 
#!
  
#*A Unified Approach to Approximating Partial Covering Problems.
#@Jochen Könemann,Ojas Parekh,Danny Segev
#t2011
#cAlgorithmica
#index3060784
#% 
#!
  
#*On Optimally Partitioning a Text to Improve Its Compression.
#@Paolo Ferragina,Igor Nitto,Rossano Venturini
#t2011
#cAlgorithmica
#index3060845
#% 
#!
  
#*Improved Approximation Algorithms for Label Cover Problems.
#@Moses Charikar,MohammadTaghi Hajiaghayi,Howard J. Karloff
#t2011
#cAlgorithmica
#index3060850
#% 
#!
  
#*A Stronger Model of Dynamic Programming Algorithms.
#@Joshua Buresh-Oppenheim,Sashka Davis,Russell Impagliazzo
#t2011
#cAlgorithmica
#index3060829
#% 
#!
  
#*Average Rate Speed Scaling.
#@Nikhil Bansal,David P. Bunde,Ho-Leung Chan,Kirk Pruhs
#t2011
#cAlgorithmica
#index3060836
#% 
#!
  
#*Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems.
#@Michael T. Goodrich,Roberto Tamassia,Nikos Triandopoulos
#t2011
#cAlgorithmica
#index3060804
#% 
#!
  
#*Injective Colorings of Graphs with Low Average Degree.
#@Daniel W. Cranston,Seog-Jin Kim,Gexin Yu
#t2011
#cAlgorithmica
#index3060811
#% 
#!
  
#*Knowledge State Algorithms.
#@Wolfgang W. Bein,Lawrence L. Larmore,John Noga,Rüdiger Reischuk
#t2011
#cAlgorithmica
#index3060821
#% 
#!
  
#*Permutation Betting Markets: Singleton Betting with Extra Information.
#@Mohammad Ghodsi,Hamid Mahini,Vahab S. Mirrokni,Morteza Zadimoghaddam
#t2011
#cAlgorithmica
#index3060839
#% 
#!
  
#*An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions.
#@Hamid Zarrabi-Zadeh
#t2011
#cAlgorithmica
#index3060792
#% 
#!
  
#*Constructing the Simplest Possible Phylogenetic Network from Triplets.
#@Leo van Iersel,Steven Kelk
#t2011
#cAlgorithmica
#index3060799
#% 
#!
  
#*On Centralized Smooth Scheduling.
#@Ami Litman,Shiri Moran-Schein
#t2011
#cAlgorithmica
#index3060815
#% 
#!
  
#*Guest Editor's Foreword: Algorithms, Combinatorics, & Geometry.
#@Farhad Shahrokhi
#t2011
#cAlgorithmica
#index3060808
#% 
#!
  
#*All-Pairs Bottleneck Paths in Vertex Weighted Graphs.
#@Asaf Shapira,Raphael Yuster,Uri Zwick
#t2011
#cAlgorithmica
#index3060785
#% 
#!
  
#*Location-Oblivious Distributed Unit Disk Graph Coloring.
#@Michel Barbeau,Prosenjit Bose,Paz Carmi,Mathieu Couture,Evangelos Kranakis
#t2011
#cAlgorithmica
#index3060822
#% 
#!
  
#*Competitive Cost Sharing with Economies of Scale.
#@Martin Hoefer
#t2011
#cAlgorithmica
#index3060837
#% 
#!
  
#*An Integer Programming Algorithm for Routing Optimization in IP Networks.
#@Andreas Bley
#t2011
#cAlgorithmica
#index3060794
#% 
#!
  
#*Dynamic vs. Oblivious Routing in Network Design.
#@Navin Goyal,Neil Olver,F. Bruce Shepherd
#t2011
#cAlgorithmica
#index3060851
#% 
#!
  
#*On the Planarization of Wireless Sensor Networks.
#@Fenghui Zhang,Anxiao Jiang,Jianer Chen
#t2011
#cAlgorithmica
#index3060823
#% 
#!
  
#*On Word Equations in One Variable.
#@Robert Dabrowski,Wojciech Plandowski
#t2011
#cAlgorithmica
#index3060838
#% 
#!
  
#*Approximation Algorithms for the Interval Constrained Coloring Problem.
#@Ernst Althaus,Stefan Canzar,Khaled M. Elbassioni,Andreas Karrenbauer,Julián Mestre
#t2011
#cAlgorithmica
#index3134182
#% 
#!
  
#*Subgraphs of 4-Regular Planar Graphs.
#@Chris Dowden,Louigi Addario-Berry
#t2011
#cAlgorithmica
#index3134201
#% 
#!
  
#*Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density.
#@Benjamin A. Burton
#t2011
#cAlgorithmica
#index3134192
#% 
#!
  
#*An Improved Approximation Algorithm for the Traveling Tournament Problem.
#@Daisuke Yamaguchi,Shinji Imahori,Ryuhei Miyashiro,Tomomi Matsui
#t2011
#cAlgorithmica
#index3134190
#% 
#!
  
#*Faster Parameterized Algorithms for Minimum Fill-in.
#@Hans L. Bodlaender,Pinar Heggernes,Yngve Villanger
#t2011
#cAlgorithmica
#index3134172
#% 
#!
  
#*Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs.
#@Minming Li,Peng-Jun Wan,F. Frances Yao
#t2011
#cAlgorithmica
#index3134187
#% 
#!
  
#*The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.
#@Sounaka Mishra,Venkatesh Raman,Saket Saurabh,Somnath Sikdar,C. R. Subramanian
#t2011
#cAlgorithmica
#index3134202
#% 
#!
  
#*Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three.
#@Marwan Al-Jubeh,Mashhood Ishaque,Kristóf Rédei,Diane L. Souvaine,Csaba D. Tóth,Pavel Valtr
#t2011
#cAlgorithmica
#index3134173
#% 
#!
  
#*Signature Theory in Holographic Algorithms.
#@Jin-yi Cai,Pinyan Lu
#t2011
#cAlgorithmica
#index3134195
#% 
#!
  
#*Another Sub-exponential Algorithm for the Simple Stochastic Game.
#@Decheng Dai,Rong Ge
#t2011
#cAlgorithmica
#index3134179
#% 
#!
  
#*Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks.
#@Thomas Moscibroda,Stefan Schmid,Roger Wattenhofer
#t2011
#cAlgorithmica
#index3134194
#% 
#!
  
#*Editorial: ISAAC 2008 Special Issue.
#@Seok-Hee Hong,Hiroshi Nagamochi
#t2011
#cAlgorithmica
#index3134189
#% 
#!
  
#*A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.
#@Kuo-Hua Kao,Jou-Ming Chang,Yue-Li Wang,Justie Su-Tzu Juan
#t2011
#cAlgorithmica
#index3134188
#% 
#!
  
#*Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.
#@Kevin Buchin,Maarten Löffler,Pat Morin,Wolfgang Mulzer
#t2011
#cAlgorithmica
#index3134174
#% 
#!
  
#*Efficiently Testing Sparse (2) Polynomials.
#@Ilias Diakonikolas,Homin K. Lee,Kevin Matulef,Rocco A. Servedio,Andrew Wan
#t2011
#cAlgorithmica
#index3134203
#% 
#!
  
#*Tight Bounds for Selfish and Greedy Load Balancing.
#@Ioannis Caragiannis,Michele Flammini,Christos Kaklamanis,Panagiotis Kanellopoulos,Luca Moscardelli
#t2011
#cAlgorithmica
#index3134175
#% 
#!
  
#*Reoptimization of the Shortest Common Superstring Problem.
#@Davide Bilò,Hans-Joachim Böckenhauer,Dennis Komm,Richard Královic,Tobias Mömke,Sebastian Seibert,Anna Zych
#t2011
#cAlgorithmica
#index3134178
#% 
#!
  
#*On Incentive Compatible Competitive Selection Protocols.
#@Xi Chen,Xiaotie Deng,Becky Jie Liu
#t2011
#cAlgorithmica
#index3134185
#% 
#!
  
#*Exact Algorithms for the Bottleneck Steiner Tree Problem.
#@Sang Won Bae,Sunghee Choi,Chunseok Lee,Shin-ichi Tanigawa
#t2011
#cAlgorithmica
#index3134198
#% 
#!
  
#*An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem.
#@Maxim A. Babenko
#t2011
#cAlgorithmica
#index3134186
#% 
#!
  
#*Solving MAX--SAT Above a Tight Lower Bound.
#@Noga Alon,Gregory Gutin,Eun Jung Kim,Stefan Szeider,Anders Yeo
#t2011
#cAlgorithmica
#index3134168
#% 
#!
  
#*How to Guard a Graph?
#@Fedor V. Fomin,Petr A. Golovach,Alexander Hall,Matús Mihalák,Elias Vicari,Peter Widmayer
#t2011
#cAlgorithmica
#index3134180
#% 
#!
  
#*A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy.
#@Danny Z. Chen,Konrad Engel,Chao Wang
#t2011
#cAlgorithmica
#index3134167
#% 
#!
  
#*A Simpler Linear-Time Recognition of Circular-Arc Graphs.
#@Haim Kaplan,Yahav Nussbaum
#t2011
#cAlgorithmica
#index3134177
#% 
#!
  
#*On Dynamic Shortest Paths Problems.
#@Liam Roditty,Uri Zwick
#t2011
#cAlgorithmica
#index3134204
#% 
#!
  
#*Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra.
#@Seok-Hee Hong,Hiroshi Nagamochi
#t2011
#cAlgorithmica
#index3134199
#% 
#!
  
#*A New Algorithm for Finding Trees with Many Leaves.
#@Joachim Kneis,Alexander Langer,Peter Rossmanith
#t2011
#cAlgorithmica
#index3134169
#% 
#!
  
#*Nonclairvoyant Speed Scaling for Flow and Energy.
#@Ho-Leung Chan,Jeff Edmonds,Tak Wah Lam,Lap-Kei Lee,Alberto Marchetti-Spaccamela,Kirk Pruhs
#t2011
#cAlgorithmica
#index3134181
#% 
#!
  
#*The Cost of Cache-Oblivious Searching.
#@Michael A. Bender,Gerth Stølting Brodal,Rolf Fagerberg,Dongdong Ge,Simai He,Haodong Hu,John Iacono,Alejandro López-Ortiz
#t2011
#cAlgorithmica
#index3134176
#% 
#!
  
#*Graphical Congestion Games.
#@Vittorio Bilò,Angelo Fanelli,Michele Flammini,Luca Moscardelli
#t2011
#cAlgorithmica
#index3134191
#% 
#!
  
#*Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks.
#@Valerie King,Cynthia A. Phillips,Jared Saia,Maxwell Young
#t2011
#cAlgorithmica
#index3134196
#% 
#!
  
#*Quadratic Kernelization for Convex Recoloring of Trees.
#@Hans L. Bodlaender,Michael R. Fellows,Michael A. Langston,Mark A. Ragan,Frances A. Rosamond,Mark Weyer
#t2011
#cAlgorithmica
#index3134170
#% 
#!
  
#*Editing Graphs into Disjoint Unions of Dense Clusters.
#@Jiong Guo,Iyad A. Kanj,Christian Komusiewicz,Johannes Uhlmann
#t2011
#cAlgorithmica
#index3134197
#% 
#!
  
#*Energy-Efficient Paths in Radio Networks.
#@René Beier,Stefan Funke,Domagoj Matijevic,Peter Sanders
#t2011
#cAlgorithmica
#index3134183
#% 
#!
  
#*The Longest Path Problem has a Polynomial Solution on Interval Graphs.
#@Kyriaki Ioannidou,George B. Mertzios,Stavros D. Nikolopoulos
#t2011
#cAlgorithmica
#index3134184
#% 
#!
  
#*Branch and Recharge: Exact Algorithms for Generalized Domination.
#@Fedor V. Fomin,Petr A. Golovach,Jan Kratochvíl,Dieter Kratsch,Mathieu Liedloff
#t2011
#cAlgorithmica
#index3134171
#% 
#!
  
#*Bounded Unpopularity Matchings.
#@Chien-Chung Huang,Telikepalli Kavitha,Dimitrios Michail,Meghana Nasre
#t2011
#cAlgorithmica
#index3134193
#% 
#!
  
#*Editors' Note: ISAAC 2009 Special Section.
#@
#t2011
#cAlgorithmica
#index3134200
#% 
#!
  
#*Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.
#@Nicolas Catusse,Victor Chepoi,Karim Nouioua,Yann Vaxès
#t2012
#cAlgorithmica
#index3249565
#% 
#!
  
#*A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.
#@Victor Chepoi,Tristan Fevat,Emmanuel Godard,Yann Vaxès
#t2012
#cAlgorithmica
#index3249530
#% 
#!
  
#*A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.
#@Imran A. Pirwani,Mohammad R. Salavatipour
#t2012
#cAlgorithmica
#index3249576
#% 
#!
  
#*Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees.
#@Michael L. Fredman
#t2012
#cAlgorithmica
#index3249558
#% 
#!
  
#*Succinct and I/O Efficient Data Structures for Traversal in Trees.
#@Craig Dillabaugh,Meng He,Anil Maheshwari
#t2012
#cAlgorithmica
#index3249591
#% 
#!
  
#*Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.
#@Takehiro Ito,Takao Nishizeki,Michael Schröder,Takeaki Uno,Xiao Zhou
#t2012
#cAlgorithmica
#index3249537
#% 
#!
  
#*An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.
#@Gábor Ivanyos,Luc Sanselme,Miklos Santha
#t2012
#cAlgorithmica
#index3249540
#% 
#!
  
#*Aligning Two Convex Figures to Minimize Area or Perimeter.
#@Hee-Kap Ahn,Otfried Cheong
#t2012
#cAlgorithmica
#index3249573
#% 
#!
  
#*Fast Algorithms for max independent set.
#@Nicolas Bourgeois,Bruno Escoffier,Vangelis Th. Paschos,Johan M. M. van Rooij
#t2012
#cAlgorithmica
#index3249532
#% 
#!
  
#*On Independent Sets and Bicliques in Graphs.
#@Serge Gaspers,Dieter Kratsch,Mathieu Liedloff
#t2012
#cAlgorithmica
#index3249562
#% 
#!
  
#*Fast Arc-Annotated Subsequence Matching in Linear Space.
#@Philip Bille,Inge Li Gørtz
#t2012
#cAlgorithmica
#index3249553
#% 
#!
  
#*Euclidean Prize-Collecting Steiner Forest.
#@MohammadHossein Bateni,MohammadTaghi Hajiaghayi
#t2012
#cAlgorithmica
#index3249567
#% 
#!
  
#*Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems.
#@André Berger,Ojas Parekh
#t2012
#cAlgorithmica
#index3249589
#% 
#!
  
#*Near-Linear Approximation Algorithms for Geometric Hitting Sets.
#@Pankaj K. Agarwal,Esther Ezra,Micha Sharir
#t2012
#cAlgorithmica
#index3249592
#% 
#!
  
#*Stackelberg Network Pricing Games.
#@Patrick Briest,Martin Hoefer,Piotr Krysta
#t2012
#cAlgorithmica
#index3249584
#% 
#!
  
#*An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
#@Amr Elmasry,Kurt Mehlhorn,Jens M. Schmidt
#t2012
#cAlgorithmica
#index3249598
#% 
#!
  
#*Complexity of Finding Graph Roots with Girth Conditions.
#@Babak Farzad,Lap Chi Lau,Van Bang Le,Nguyen Ngoc Tuy
#t2012
#cAlgorithmica
#index3249531
#% 
#!
  
#*Bipartite Matching in the Semi-streaming Model.
#@Sebastian Eggert,Lasse Kliemann,Peter Munstermann,Anand Srivastav
#t2012
#cAlgorithmica
#index3249539
#% 
#!
  
#*Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
#@Kevin Buchin,Maike Buchin,Jaroslaw Byrka,Martin Nöllenburg,Yoshio Okamoto,Rodrigo I. Silveira,Alexander Wolff
#t2012
#cAlgorithmica
#index3249561
#% 
#!
  
#*Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
#@Dan Alistarh,Seth Gilbert,Rachid Guerraoui,Corentin Travers
#t2012
#cAlgorithmica
#index3249600
#% 
#!
  
#*Pruning 2-Connected Graphs.
#@Chandra Chekuri,Nitish Korula
#t2012
#cAlgorithmica
#index3249595
#% 
#!
  
#*Construction Sequences and Certifying 3-connectivity.
#@Jens M. Schmidt
#t2012
#cAlgorithmica
#index3249554
#% 
#!
  
#*The Parameterized Complexity of Stabbing Rectangles.
#@Michael Dom,Michael R. Fellows,Frances A. Rosamond,Somnath Sikdar
#t2012
#cAlgorithmica
#index3249568
#% 
#!
  
#*Efficient Observer-Dependent Simplification in Polygonal Domains.
#@Alireza Zarei,Mohammad Ghodsi
#t2012
#cAlgorithmica
#index3249578
#% 
#!
  
#*Average Case Analysis of Moore's State Minimization Algorithm.
#@Frédérique Bassino,Julien David,Cyril Nicaud
#t2012
#cAlgorithmica
#index3249606
#% 
#!
  
#*Succinct Representation of Labeled Graphs.
#@Jérémy Barbay,Luca Castelli Aleardi,Meng He,J. Ian Munro
#t2012
#cAlgorithmica
#index3249542
#% 
#!
  
#*Contribution Games in Networks.
#@Elliot Anshelevich,Martin Hoefer
#t2012
#cAlgorithmica
#index3249583
#% 
#!
  
#*Polynomial Kernelizations for MIN F+Π1 and MAX NP.
#@Stefan Kratsch
#t2012
#cAlgorithmica
#index3249581
#% 
#!
  
#*A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners.
#@Seok-Hee Hong,Hiroshi Nagamochi
#t2012
#cAlgorithmica
#index3249534
#% 
#!
  
#*Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems.
#@Greg N. Frederickson,Barry Wittman
#t2012
#cAlgorithmica
#index3249603
#% 
#!
  
#*Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
#@Leah Epstein,Asaf Levin,Rob van Stee
#t2012
#cAlgorithmica
#index3249569
#% 
#!
  
#*Approximability of the Firefighter Problem - Computing Cuts over Time.
#@Elliot Anshelevich,Deeparnab Chakrabarty,Ameya Hate,Chaitanya Swamy
#t2012
#cAlgorithmica
#index3249551
#% 
#!
  
#*Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems.
#@Kazumasa Okumoto,Takuro Fukunaga,Hiroshi Nagamochi
#t2012
#cAlgorithmica
#index3249582
#% 
#!
  
#*A Competitive Analysis for Balanced Transactional Memory Workloads.
#@Gokarna Sharma,Costas Busch
#t2012
#cAlgorithmica
#index3249560
#% 
#!
  
#*Approximating Optimal Binary Decision Trees.
#@Micah Adler,Brent Heeringa
#t2012
#cAlgorithmica
#index3249544
#% 
#!
  
#*Improved Competitive Performance Bounds for CIOQ Switches.
#@Alexander Kesselman,Kirill Kogan,Michael Segal
#t2012
#cAlgorithmica
#index3249587
#% 
#!
  
#*Shortest Paths in Time-Dependent FIFO Networks.
#@Frank Dehne,Masoud T. Omran,Jörg-Rüdiger Sack
#t2012
#cAlgorithmica
#index3249586
#% 
#!
  
#*Obtaining a Planar Graph by Vertex Deletion.
#@Dániel Marx,Ildikó Schlotter
#t2012
#cAlgorithmica
#index3249575
#% 
#!
  
#*Finding Induced Paths of Given Parity in Claw-Free Graphs.
#@Pim van 't Hof,Marcin Kaminski,Daniël Paulusma
#t2012
#cAlgorithmica
#index3249579
#% 
#!
  
#*A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
#@Vincenzo Bonifaci,Alberto Marchetti-Spaccamela,Sebastian Stiller
#t2012
#cAlgorithmica
#index3249570
#% 
#!
  
#*A Scheme for Computing Minimum Covers within Simple Regions.
#@Matthew J. Katz,Gila Morgenstern
#t2012
#cAlgorithmica
#index3249533
#% 
#!
  
#*On Equilibria for ADM Minimization Games.
#@Leah Epstein,Asaf Levin
#t2012
#cAlgorithmica
#index3249590
#% 
#!
  
#*An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants.
#@Jing Xiao,Tiancheng Lou,Tao Jiang
#t2012
#cAlgorithmica
#index3249580
#% 
#!
  
#*Graph Decomposition for Memoryless Periodic Exploration.
#@Adrian Kosowski,Alfredo Navarra
#t2012
#cAlgorithmica
#index3249608
#% 
#!
  
#*Approximating Node-Connectivity Augmentation Problems.
#@Zeev Nutov
#t2012
#cAlgorithmica
#index3249605
#% 
#!
  
#*Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks.
#@Petra Berenbrink,Tom Friedetzky,Iman Hajirasouliha,Zengjian Hu
#t2012
#cAlgorithmica
#index3249593
#% 
#!
  
#*Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.
#@Victor Chepoi,Feodor F. Dragan,Bertrand Estellon,Michel Habib,Yann Vaxès,Yang Xiang
#t2012
#cAlgorithmica
#index3249559
#% 
#!
  
#*The k-in-a-Path Problem for Claw-free Graphs.
#@Jirí Fiala,Marcin Kaminski,Bernard Lidický,Daniël Paulusma
#t2012
#cAlgorithmica
#index3249597
#% 
#!
  
#*Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.
#@Telikepalli Kavitha
#t2012
#cAlgorithmica
#index3249552
#% 
#!
  
#*Minimize the Maximum Duty in Multi-interface Networks.
#@Gianlorenzo D'Angelo,Gabriele Di Stefano,Alfredo Navarra
#t2012
#cAlgorithmica
#index3249602
#% 
#!
  
#*Stronger Lempel-Ziv Based Compressed Text Indexing.
#@Diego Arroyuelo,Gonzalo Navarro,Kunihiko Sadakane
#t2012
#cAlgorithmica
#index3249543
#% 
#!
  
#*Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion.
#@René van Bevern,Hannes Moser,Rolf Niedermeier
#t2012
#cAlgorithmica
#index3249572
#% 
#!
  
#*Schnyder Decompositions for Regular Plane Graphs and Application to Drawing.
#@Olivier Bernardi,Éric Fusy
#t2012
#cAlgorithmica
#index3249577
#% 
#!
  
#*Property Testing on k-Vertex-Connectivity of Graphs.
#@Yuichi Yoshida,Hiro Ito
#t2012
#cAlgorithmica
#index3249599
#% 
#!
  
#*Biased Range Trees.
#@Vida Dujmovic,John Howat,Pat Morin
#t2012
#cAlgorithmica
#index3249550
#% 
#!
  
#*Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming.
#@Scott M. Summers
#t2012
#cAlgorithmica
#index3249564
#% 
#!
  
#*Maximum Series-Parallel Subgraph.
#@Gruia Calinescu,Cristina G. Fernandes,Hemanshu Kaul,Alexander Zelikovsky
#t2012
#cAlgorithmica
#index3249555
#% 
#!
  
#*The Steiner Ratio Gilbert-Pollak Conjecture Is Still Open - Clarification Statement.
#@Alexandr O. Ivanov,Alexey A. Tuzhilin
#t2012
#cAlgorithmica
#index3249571
#% 
#!
  
#*A Distributed Algorithm for Computing the Node Search Number in Trees.
#@David Coudert,Florian Huc,Dorian Mazauric
#t2012
#cAlgorithmica
#index3249546
#% 
#!
  
#*Improved Approximation Algorithms for Data Migration.
#@Samir Khuller,Yoo-Ah Kim,Azarakhsh Malekian
#t2012
#cAlgorithmica
#index3249541
#% 
#!
  
#*On the Complexity of Optimal Hotlink Assignment.
#@Tobias Jacobs
#t2012
#cAlgorithmica
#index3249585
#% 
#!
  
#*On the Hitting Times of Quantum Versus Random Walks.
#@Frédéric Magniez,Ashwin Nayak,Peter C. Richter,Miklos Santha
#t2012
#cAlgorithmica
#index3249588
#% 
#!
  
#*Weighted Matching in the Semi-Streaming Model.
#@Mariano Zelke
#t2012
#cAlgorithmica
#index3249536
#% 
#!
  
#*Many Distances in Planar Graphs.
#@Sergio Cabello
#t2012
#cAlgorithmica
#index3249549
#% 
#!
  
#*Layered Working-Set Trees.
#@Prosenjit Bose,Karim Douïeb,Vida Dujmovic,John Howat
#t2012
#cAlgorithmica
#index3249535
#% 
#!
  
#*A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties.
#@Donglei Du,Ruixing Lu,Dachuan Xu
#t2012
#cAlgorithmica
#index3249563
#% 
#!
  
#*Fully Dynamic Geometric Spanners.
#@Liam Roditty
#t2012
#cAlgorithmica
#index3249547
#% 
#!
  
#*Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window.
#@Ho-Leung Chan,Tak Wah Lam,Lap-Kei Lee,Hing-Fung Ting
#t2012
#cAlgorithmica
#index3249528
#% 
#!
  
#*Faster Swap Edge Computation in Minimum Diameter Spanning Trees.
#@Beat Gfeller
#t2012
#cAlgorithmica
#index3249545
#% 
#!
  
#*A Linear Algorithm for the Random Sampling from Regular Languages.
#@Olivier Bernardi,Omer Giménez
#t2012
#cAlgorithmica
#index3249596
#% 
#!
  
#*An Exact Exponential Time Algorithm for Power Dominating Set.
#@Daniel Binkele-Raible,Henning Fernau
#t2012
#cAlgorithmica
#index3249556
#% 
#!
  
#*Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles.
#@Paola Flocchini,David Ilcinkas,Nicola Santoro
#t2012
#cAlgorithmica
#index3249574
#% 
#!
  
#*Philippe Flajolet, the Father of Analytic Combinatorics.
#@
#t2012
#cAlgorithmica
#index3249538
#% 
#!
  
#*Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems.
#@Agustín Bompadre
#t2012
#cAlgorithmica
#index3249607
#% 
#!
  
#*Almost Exact Matchings.
#@Raphael Yuster
#t2012
#cAlgorithmica
#index3249566
#% 
#!
  
#*On Smoothed Analysis of Quicksort and Hoare's Find.
#@Mahmoud Fouz,Manfred Kufleitner,Bodo Manthey,Nima Zeini Jahromi
#t2012
#cAlgorithmica
#index3249557
#% 
#!
  
#*Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.
#@Ashkan Aazami,Joseph Cheriyan,Krishnam Raju Jampani
#t2012
#cAlgorithmica
#index3249529
#% 
#!
  
#*Interval Partitions and Polynomial Factorization.
#@Joachim von zur Gathen,Daniel Panario,L. Bruce Richmond
#t2012
#cAlgorithmica
#index3249548
#% 
#!
  
#*Competitive Weighted Matching in Transversal Matroids.
#@Nedialko B. Dimitrov,C. Greg Plaxton
#t2012
#cAlgorithmica
#index3249604
#% 
#!
  
#*Mapping Filtering Streaming Applications.
#@Kunal Agrawal,Anne Benoit,Fanny Dufossé,Yves Robert
#t2012
#cAlgorithmica
#index3249601
#% 
#!
  
#*External Memory Planar Point Location with Logarithmic Updates.
#@Lars Arge,Gerth Stølting Brodal,S. Srinivasa Rao
#t2012
#cAlgorithmica
#index3249594
#% 
#!
  
#*Counting Hexagonal Patches and Independent Sets in Circle Graphs.
#@Paul Bonsma,Felix Breuer
#t2012
#cAlgorithmica
#index3309998
#% 
#!
  
#*Lightweight Data Indexing and Compression in External Memory.
#@Paolo Ferragina,Travis Gagie,Giovanni Manzini
#t2012
#cAlgorithmica
#index3309997
#% 
#!
  
#*Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata.
#@Viliam Geffert,Giovanni Pighizzini
#t2012
#cAlgorithmica
#index3310004
#% 
#!
  
#*Optimal Polygonal Representation of Planar Graphs.
#@Christian A. Duncan,Emden R. Gansner,Y. F. Hu,Michael Kaufmann,Stephen G. Kobourov
#t2012
#cAlgorithmica
#index3310005
#% 
#!
  
#*Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials.
#@Mark van Hoeij,Andrew Novocin
#t2012
#cAlgorithmica
#index3310002
#% 
#!
  
#*Minimum-Perimeter Intersecting Polygons.
#@Adrian Dumitrescu,Minghui Jiang
#t2012
#cAlgorithmica
#index3310003
#% 
#!
  
#*Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
#@Alejandro López-Ortiz
#t2012
#cAlgorithmica
#index3310000
#% 
#!
  
#*The Power of Fair Pricing Mechanisms.
#@Christine Chung,Katrina Ligett,Kirk Pruhs,Aaron Roth
#t2012
#cAlgorithmica
#index3310001
#% 
#!
  
#*The Complexity of Counting Eulerian Tours in 4-regular Graphs.
#@Qi Ge,Daniel Stefankovic
#t2012
#cAlgorithmica
#index3310006
#% 
#!
  
#*Sharp Separation and Applications to Exact and Parameterized Algorithms.
#@Fedor V. Fomin,Fabrizio Grandoni,Daniel Lokshtanov,Saket Saurabh
#t2012
#cAlgorithmica
#index3309999
#% 
#!
  
#*An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion.
#@Marek Cygan,Marcin Pilipczuk,Michal Pilipczuk,Jakub Onufry Wojtaszczyk
#t2012
#cAlgorithmica
#index3360517
#% 
#!
  
#*Parameterized Complexity of the Spanning Tree Congestion Problem.
#@Hans L. Bodlaender,Fedor V. Fomin,Petr A. Golovach,Yota Otachi,Erik Jan van Leeuwen
#t2012
#cAlgorithmica
#index3360512
#% 
#!
  
#*Algorithmic Meta-theorems for Restrictions of Treewidth.
#@Michael Lampis
#t2012
#cAlgorithmica
#index3360508
#% 
#!
  
#*Finding Maximum Edge Bicliques in Convex Bipartite Graphs.
#@Doron Nussbaum,Shuye Pu,Jörg-Rüdiger Sack,Takeaki Uno,Hamid Zarrabi-Zadeh
#t2012
#cAlgorithmica
#index3360509
#% 
#!
  
#*Parameterized Modal Satisfiability.
#@Antonis Achilleos,Michael Lampis,Valia Mitsou
#t2012
#cAlgorithmica
#index3360531
#% 
#!
  
#*Cluster Editing: Kernelization Based on Edge Cuts.
#@Yixin Cao,Jianer Chen
#t2012
#cAlgorithmica
#index3360507
#% 
#!
  
#*Zero-Knowledge Argument for Simultaneous Discrete Logarithms.
#@Sherman S. M. Chow,Changshe Ma,Jian Weng
#t2012
#cAlgorithmica
#index3360524
#% 
#!
  
#*A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing.
#@Emmanouil Pountourakis,Angelina Vidali
#t2012
#cAlgorithmica
#index3360530
#% 
#!
  
#*A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.
#@Robert Crowston,Gregory Gutin,Mark Jones,Anders Yeo
#t2012
#cAlgorithmica
#index3360521
#% 
#!
  
#*Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.
#@Michael R. Fellows,Danny Hermelin,Frances A. Rosamond
#t2012
#cAlgorithmica
#index3360506
#% 
#!
  
#*Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.
#@Piotr Berman,Marek Karpinski,Andrzej Lingas
#t2012
#cAlgorithmica
#index3360522
#% 
#!
  
#*Multivariate Complexity Analysis of Swap Bribery.
#@Britta Dorn,Ildikó Schlotter
#t2012
#cAlgorithmica
#index3360529
#% 
#!
  
#*Fast Minor Testing in Planar Graphs.
#@Isolde Adler,Frederic Dorn,Fedor V. Fomin,Ignasi Sau,Dimitrios M. Thilikos
#t2012
#cAlgorithmica
#index3360511
#% 
#!
  
#*Guest Editorial: Computing and Combinatorics.
#@My T. Thai
#t2012
#cAlgorithmica
#index3360527
#% 
#!
  
#*Parameterized Measure & Conquer for Problems with No Small Kernels.
#@Daniel Binkele-Raible,Henning Fernau
#t2012
#cAlgorithmica
#index3360516
#% 
#!
  
#*Guest Editorial.
#@Mark de Berg
#t2012
#cAlgorithmica
#index3360528
#% 
#!
  
#*Tile-Packing Tomography Is NP-hard.
#@Marek Chrobak,Christoph Dürr,Flavio Guiñez,Antoni Lozano,Nguyen Kim Thang
#t2012
#cAlgorithmica
#index3360514
#% 
#!
  
#*Shorthand Universal Cycles for Permutations.
#@Alexander E. Holroyd,Frank Ruskey,Aaron Williams
#t2012
#cAlgorithmica
#index3360513
#% 
#!
  
#*Caching Is Hard - Even in the Fault Model.
#@Marek Chrobak,Gerhard J. Woeginger,Kazuhisa Makino,Haifeng Xu
#t2012
#cAlgorithmica
#index3360510
#% 
#!
  
#*f-Sensitivity Distance Oracles and Routing Schemes.
#@Shiri Chechik,Michael Langberg,David Peleg,Liam Roditty
#t2012
#cAlgorithmica
#index3360525
#% 
#!
  
#*Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.
#@Vincenzo Bonifaci,Alberto Marchetti-Spaccamela
#t2012
#cAlgorithmica
#index3360520
#% 
#!
  
#*When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.
#@Nikhil Bansal,Anupam Gupta,Jian Li,Julián Mestre,Viswanath Nagarajan,Atri Rudra
#t2012
#cAlgorithmica
#index3360515
#% 
#!
  
#*On Space Efficient Two Dimensional Range Minimum Data Structures.
#@Gerth Stølting Brodal,Pooya Davoodi,S. Srinivasa Rao
#t2012
#cAlgorithmica
#index3360519
#% 
#!
  
#*Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
#@Gregory Gutin,Eun Jung Kim,Arezou Soleimanfallah,Stefan Szeider,Anders Yeo
#t2012
#cAlgorithmica
#index3360526
#% 
#!
  
#*Local Search Algorithms for the Red-Blue Median Problem.
#@MohammadTaghi Hajiaghayi,Rohit Khandekar,Guy Kortsarz
#t2012
#cAlgorithmica
#index3360518
#% 
#!
  
#*Counting Paths in VPA Is Complete for #NC 1.
#@Andreas Krebs,Nutan Limaye,Meena Mahajan
#t2012
#cAlgorithmica
#index3360523
#% 
#!
  
#*Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I.
#@Venkatesh Raman,Saket Saurabh
#t2012
#cAlgorithmica
#index3360532
#% 
#!
  
#*Guest Editorial: Special Issue on Algorithms and Computation.
#@Kyung-Yong Chwa,Kunsoo Park
#t2012
#cAlgorithmica
#index3454784
#% 
#!
  
#*3-Colouring AT-Free Graphs in Polynomial Time.
#@Juraj Stacho
#t2012
#cAlgorithmica
#index3454783
#% 
#!
  
#*Computing Sparse Multiples of Polynomials.
#@Mark Giesbrecht,Daniel S. Roche,Hrushikesh Tilak
#t2012
#cAlgorithmica
#index3454788
#% 
#!
  
#*From Holant to #CSP and Back: Dichotomy for Holant c Problems.
#@Jin-Yi Cai,Sangxia Huang,Pinyan Lu
#t2012
#cAlgorithmica
#index3454789
#% 
#!
  
#*Minimum Cost Partitions of Trees with Supply and Demand.
#@Takehiro Ito,Takuya Hara,Xiao Zhou,Takao Nishizeki
#t2012
#cAlgorithmica
#index3454786
#% 
#!
  
#*Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.
#@Qian-Ping Gu,Hisao Tamaki
#t2012
#cAlgorithmica
#index3454787
#% 
#!
  
#*Identifying Shapes Using Self-assembly.
#@Matthew J. Patitz,Scott M. Summers
#t2012
#cAlgorithmica
#index3454785
#% 
#!
  
#*Improved Algorithms for Even Factors and Square-Free Simple b-Matchings.
#@Maxim A. Babenko
#t2012
#cAlgorithmica
#index3454791
#% 
#!
  
#*Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning.
#@Henning Meyerhenke,Thomas Sauerwald
#t2012
#cAlgorithmica
#index3454790
#% 
#!
  
#*A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.
#@Kuan-Yu Chen,Kun-Mao Chao
#t2013
#cAlgorithmica
#index3612674
#% 
#!
  
#*Route-Enabling Graph Orientation Problems.
#@Takehiro Ito,Yuichiro Miyamoto,Hirotaka Ono,Hisao Tamaki,Ryuhei Uehara
#t2013
#cAlgorithmica
#index3612679
#% 
#!
  
#*Streaming Graph Computations with a Helpful Advisor.
#@Graham Cormode,Michael Mitzenmacher,Justin Thaler
#t2013
#cAlgorithmica
#index3612673
#% 
#!
  
#*Unified Compression-Based Acceleration of Edit-Distance Computation.
#@Danny Hermelin,Gad M. Landau,Shir Landau,Oren Weimann
#t2013
#cAlgorithmica
#index3612670
#% 
#!
  
#*Online Clustering with Variable Sized Clusters.
#@János Csirik,Leah Epstein,Csanád Imreh,Asaf Levin
#t2013
#cAlgorithmica
#index3612671
#% 
#!
  
#*Two-stage Robust Network Design with Exponential Scenarios.
#@Rohit Khandekar,Guy Kortsarz,Vahab S. Mirrokni,Mohammad R. Salavatipour
#t2013
#cAlgorithmica
#index3612678
#% 
#!
  
#*Power Domination in Circular-Arc Graphs.
#@Chung-Shou Liao,D. T. Lee
#t2013
#cAlgorithmica
#index3612672
#% 
#!
  
#*I/O Efficient Dynamic Data Structures for Longest Prefix Queries.
#@Moshe Hershcovitch,Haim Kaplan
#t2013
#cAlgorithmica
#index3612677
#% 
#!
  
#*Cleaning Interval Graphs.
#@Dániel Marx,Ildikó Schlotter
#t2013
#cAlgorithmica
#index3612676
#% 
#!
  
#*A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.
#@Bang Ye Wu
#t2013
#cAlgorithmica
#index3612675
#% 
#!
  
#*Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon.
#@A. García,Pedro Jodrá,Javier Tejel
#t2013
#cAlgorithmica
#index3647604
#% 
#!
  
#*Small Vertex Cover makes Petri Net Coverability and Boundedness Easier.
#@M. Praveen
#t2013
#cAlgorithmica
#index3647610
#% 
#!
  
#*The Parameterized Complexity of Unique Coverage and Its Variants.
#@Neeldhara Misra,Hannes Moser,Venkatesh Raman,Saket Saurabh,Somnath Sikdar
#t2013
#cAlgorithmica
#index3647614
#% 
#!
  
#*On the Grundy and -Chromatic Numbers of a Graph.
#@Frédéric Havet,Leonardo Sampaio
#t2013
#cAlgorithmica
#index3647605
#% 
#!
  
#*Sublinear Algorithms for Approximating String Compressibility.
#@Sofya Raskhodnikova,Dana Ron,Ronitt Rubinfeld,Adam Smith
#t2013
#cAlgorithmica
#index3647607
#% 
#!
  
#*Fast Polynomial-Space Algorithms Using Inclusion-Exclusion.
#@Jesper Nederlof
#t2013
#cAlgorithmica
#index3647613
#% 
#!
  
#*Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
#@Paola Flocchini,David Ilcinkas,Andrzej Pelc,Nicola Santoro
#t2013
#cAlgorithmica
#index3647606
#% 
#!
  
#*Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II.
#@Venkatesh Raman,Saket Saurabh
#t2013
#cAlgorithmica
#index3647608
#% 
#!
  
#*Finding and Counting Vertex-Colored Subtrees.
#@Sylvain Guillemot,Florian Sikora
#t2013
#cAlgorithmica
#index3647600
#% 
#!
  
#*Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy.
#@Tak Wah Lam,Lap-Kei Lee,Isaac Kar-Keung To,Prudence W. H. Wong
#t2013
#cAlgorithmica
#index3647617
#% 
#!
  
#*On the (Non-)Existence of Polynomial Kernels for -Free Edge Modification Problems.
#@Sylvain Guillemot,Frédéric Havet,Christophe Paul,Anthony Perez
#t2013
#cAlgorithmica
#index3647599
#% 
#!
  
#*On the Exact Complexity of Evaluating Quantified -CNF.
#@Chris Calabro,Russell Impagliazzo,Ramamohan Paturi
#t2013
#cAlgorithmica
#index3647598
#% 
#!
  
#*Succinct 2D Dictionary Matching.
#@Shoshana Neuburger,Dina Sokol
#t2013
#cAlgorithmica
#index3647615
#% 
#!
  
#*Parameterized Two-Player Nash Equilibrium.
#@Danny Hermelin,Chien-Chung Huang,Stefan Kratsch,Magnus Wahlstr?m
#t2013
#cAlgorithmica
#index3647602
#% 
#!
  
#*Approximation Algorithms for the Directed -Tour and -Stroll Problems.
#@MohammadHossein Bateni,Julia Chuzhoy
#t2013
#cAlgorithmica
#index3647616
#% 
#!
  
#*Proper Interval Vertex Deletion.
#@Pim van 't Hof,Yngve Villanger
#t2013
#cAlgorithmica
#index3647597
#% 
#!
  
#*Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem.
#@Stefan Kratsch,Frank Neumann
#t2013
#cAlgorithmica
#index3647601
#% 
#!
  
#*Stochastic Budget Optimization in Internet Advertising.
#@Bhaskar DasGupta,S. Muthukrishnan
#t2013
#cAlgorithmica
#index3647603
#% 
#!
  
#*A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology.
#@Benjamin A. Burton,Melih Ozlen
#t2013
#cAlgorithmica
#index3647612
#% 
#!
  
#*Computing Optimal Steiner Trees in Polynomial Space.
#@Fedor V. Fomin,Fabrizio Grandoni,Dieter Kratsch,Daniel Lokshtanov,Saket Saurabh
#t2013
#cAlgorithmica
#index3647609
#% 
#!
  
#*Improved Approximation Algorithms for the Spanning Star Forest Problem.
#@Ning Chen,Roee Engelberg,C. Thach Nguyen,Prasad Raghavendra,Atri Rudra,Gyanit Singh
#t2013
#cAlgorithmica
#index3647611
#% 
#!
  
#*The complexity of tensor calculus.
#@Carsten Damm,Markus Holzer,Pierre McKenzie
#t2002
#cComputational Complexity
#index783552
#%3348
#%3670
#%104357
#%104520
#%198122
#%621621
#%622780
#%623088
#%627488
#%861109
#%861774
#%888326
#%889010
#%929954
#%951554
#%953071
#%971453
#%971486
#%971914
#%973074
#%1051998
#%1058771
#%1060547
#%1088760
#%1088817
#%1089230
#%1095035
#!
  
#*Reducing the complexity of reductions.
#@Manindra Agrawal,Eric Allender,Russell Impagliazzo,Toniann Pitassi,Steven Rudich
#t2001
#cComputational Complexity
#index783553
#% 
#!
  
#*Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting.
#@Samuel R. Buss,Russell Impagliazzo,Jan Krajícek,Pavel Pudlák,Alexander A. Razborov,Jiri Sgall
#t1997
#cComputational Complexity
#index783554
#% 
#!
  
#*Derandomizing Arthur-Merlin games under uniform assumptions.
#@Chi-Jen Lu
#t2001
#cComputational Complexity
#index783555
#%267250
#%783586
#%1058645
#%972704
#%950703
#%622334
#%210995
#%104624
#%622539
#%211457
#%951517
#%972974
#%623102
#%1060547
#%623187
#!
  
#*Complexity Theoretic Hardness Results for Query Learning.
#@Howard Aizenstein,Tibor Hegedüs,Lisa Hellerstein,Leonard Pitt
#t1998
#cComputational Complexity
#index783556
#% 
#!
  
#*Some Bounds on Multiparty Communication Complexity of Pointer Jumping.
#@Carsten Damm,Stasys Jukna,Jiri Sgall
#t1998
#cComputational Complexity
#index783557
#% 
#!
  
#*Special issue "Conference on Computational Complexity 2004" Guest Editor's foreword.
#@Eric Allender
#t2005
#cComputational Complexity
#index783558
#% 
#!
  
#*Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape.
#@Martin Dietzfelbinger,Martin Hühne
#t1999
#cComputational Complexity
#index783559
#% 
#!
  
#*Special issue, final part "Conference on 2004 " Guest Editor's foreword.
#@Eric Allender
#t2005
#cComputational Complexity
#index783560
#% 
#!
  
#*Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
#@Peter Bürgisser,Marek Karpinski,Thomas Lickteig
#t1991
#cComputational Complexity
#index783561
#% 
#!
  
#*The Computational Complexity of Recognizing Permutation Functions.
#@Keju Ma,Joachim von zur Gathen
#t1995
#cComputational Complexity
#index783562
#% 
#!
  
#*Complexity of some arithmetic problems for binary polynomials.
#@Eric Allender,Anna Bernasconi,Carsten Damm,Joachim von zur Gathen,Michael E. Saks,Igor Shparlinski
#t2003
#cComputational Complexity
#index783563
#%3670
#%622814
#%623057
#%783631
#%783748
#%887224
#%930143
#%950994
#%971288
#%1059032
#%1059893
#%1060162
#!
  
#*Decomposition of Algebras Over Finite Fields and Number Fields.
#@Wayne Eberly
#t1991
#cComputational Complexity
#index783564
#% 
#!
  
#*The Complexity of Matrix Rank and Feasible Systems of Linear Equations.
#@Eric Allender,Robert Beals,Mitsunori Ogihara
#t1999
#cComputational Complexity
#index783565
#% 
#!
  
#*Decompositions of Algebras Over R and C.
#@Wayne Eberly
#t1991
#cComputational Complexity
#index783566
#% 
#!
  
#*The Complexity of Computing Maximal Word Functions.
#@Eric Allender,Danilo Bruschi,Giovanni Pighizzini
#t1993
#cComputational Complexity
#index783567
#% 
#!
  
#*Communication complexity towards lower bounds on circuit depth.
#@Jeff Edmonds,Russell Impagliazzo,Steven Rudich,Jiri Sgall
#t2001
#cComputational Complexity
#index783568
#% 
#!
  
#*Derandomized Graph Products.
#@Noga Alon,Uriel Feige,Avi Wigderson,David Zuckerman
#t1995
#cComputational Complexity
#index783569
#% 
#!
  
#*A quantifier elimination for the theory of -adic numbers.
#@Lavinia Egidi
#t1998
#cComputational Complexity
#index783570
#% 
#!
  
#*A compendium of problems complete for symmetric logarithmic space.
#@Carme Àlvarez,Raymond Greenlaw
#t2000
#cComputational Complexity
#index783571
#% 
#!
  
#*Collecting Coupons on Trees, and the Cover Time of Random Walks.
#@Uriel Feige
#t1997
#cComputational Complexity
#index783572
#% 
#!
  
#*A Note on Logspace Optimization.
#@Carme Àlvarez,Birgit Jenner
#t1995
#cComputational Complexity
#index783573
#% 
#!
  
#*On the Hardness of Computing the Permanent of Random Matrices.
#@Uriel Feige,Carsten Lund
#t1997
#cComputational Complexity
#index783574
#% 
#!
  
#*Computationally Private Randomizing Polynomials and Their Applications.
#@Benny Applebaum,Yuval Ishai,Eyal Kushilevitz
#t2006
#cComputational Complexity
#index783575
#% 
#!
  
#*The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems.
#@Anne Condon
#t1993
#cComputational Complexity
#index783576
#% 
#!
  
#*The BNS-Chung criterion for multi-party communication complexity.
#@Ran Raz
#t2000
#cComputational Complexity
#index783577
#% 
#!
  
#*Cartesian Graph Factorization at Logarithmic Cost per Edge.
#@Franz Aurenhammer,Johann Hagauer,Wilfried Imrich
#t1992
#cComputational Complexity
#index783578
#% 
#!
  
#*On Coherence, Random-Self-Reducibility, and Self-Correction.
#@Joan Feigenbaum,Lance Fortnow,Sophie Laplante,Ashish V. Naik
#t1998
#cComputational Complexity
#index783579
#% 
#!
  
#*Arithmetization: A New Method in Structural Complexity Theory.
#@László Babai,Lance Fortnow
#t1991
#cComputational Complexity
#index783580
#% 
#!
  
#*The Power of Adaptiveness and Additional Queries in Random-Self-Reductions.
#@Joan Feigenbaum,Lance Fortnow,Carsten Lund,Daniel A. Spielman
#t1994
#cComputational Complexity
#index783581
#% 
#!
  
#*Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.
#@László Babai,Lance Fortnow,Carsten Lund
#t1991
#cComputational Complexity
#index783582
#% 
#!
  
#*Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.
#@Faith E. Fich,Miroslaw Kowaluk,Miroslaw Kutylowski,Krzysztof Lorys,Prabhakar Ragde
#t1995
#cComputational Complexity
#index783583
#% 
#!
  
#*Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.
#@László Babai,Lance Fortnow,Carsten Lund
#t1992
#cComputational Complexity
#index783584
#% 
#!
  
#*Separability and one-way functions.
#@Lance Fortnow,John D. Rogers
#t2002
#cComputational Complexity
#index783585
#%622333
#%783679
#%887824
#%887826
#%950949
#%951398
#%971914
#%972219
#%1059406
#%1059323
#%1091872
#%1093620
#!
  
#*BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs.
#@László Babai,Lance Fortnow,Noam Nisan,Avi Wigderson
#t1993
#cComputational Complexity
#index783586
#% 
#!
  
#*On the Complexity of Computing the Diameter of a Polytope.
#@Alan M. Frieze,Shang-Hua Teng
#t1994
#cComputational Complexity
#index783587
#% 
#!
  
#*Undirected s-t Connectivity in Polynomial Time and Sublinear Space.
#@Greg Barnes,Walter L. Ruzzo
#t1997
#cComputational Complexity
#index783588
#% 
#!
  
#*A Theory of Strict P-Completeness.
#@Anne Condon
#t1994
#cComputational Complexity
#index783589
#% 
#!
  
#*Fourier Analysis for Probabilistic Communication Complexity.
#@Ran Raz
#t1995
#cComputational Complexity
#index783590
#% 
#!
  
#*Representing Boolean Functions as Polynomials Modulo Composite Numbers.
#@David A. Mix Barrington,Richard Beigel,Steven Rudich
#t1994
#cComputational Complexity
#index783591
#% 
#!
  
#*A characterization of span program size and improved lower bounds for monotone span programs.
#@Anna Gál
#t2001
#cComputational Complexity
#index783592
#%210882
#%211560
#%621352
#%622654
#%622984
#%623312
#%783565
#%783619
#%797853
#%931368
#%951418
#%951617
#%971486
#%978084
#%1059475
#%1060117
#!
  
#*Complex Polynomials and Circuit Lower Bounds for Modular Counting.
#@David A. Mix Barrington,Howard Straubing
#t1994
#cComputational Complexity
#index783593
#% 
#!
  
#*Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword.
#@Anna Gál
#t2006
#cComputational Complexity
#index783594
#% 
#!
  
#*Lower bounds for modular counting by circuits with modular gates.
#@David A. Mix Barrington,Howard Straubing
#t1999
#cComputational Complexity
#index783595
#% 
#!
  
#*Efficient and Optimal Exponentiation in Finite Fields.
#@Joachim von zur Gathen
#t1991
#cComputational Complexity
#index783596
#% 
#!
  
#*Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities.
#@Saugata Basu
#t2006
#cComputational Complexity
#index783597
#% 
#!
  
#*Counting Curves and Their Projections.
#@Joachim von zur Gathen,Marek Karpinski,Igor Shparlinski
#t1997
#cComputational Complexity
#index783598
#% 
#!
  
#*Computing the euler-poincaré characteristics of sign conditions.
#@Saugata Basu,Richard Pollack,Marie-Françoise Roy
#t2005
#cComputational Complexity
#index783599
#% 
#!
  
#*Computing Frobenius Maps and Factoring Polynomials.
#@Joachim von zur Gathen,Victor Shoup
#t1992
#cComputational Complexity
#index783600
#%193334
#%740663
#%887932
#%949860
#%972004
#%993684
#%1091424
#%3641445
#!
  
#*Existence and Efficient Construction of Fast Fourier Transforms on Supersolvable Groups.
#@Ulrich Baum
#t1991
#cComputational Complexity
#index783601
#% 
#!
  
#*Fast computation of the Smith form of a sparse integer matrix.
#@Mark Giesbrecht
#t2001
#cComputational Complexity
#index783602
#% 
#!
  
#*On lower bounds for the complexity of polynomials and their multiples.
#@Walter Baur,Karin Halupczok
#t1999
#cComputational Complexity
#index783603
#% 
#!
  
#*On the Efficiency of Effective Nullstellensätze.
#@Marc Giusti,Joos Heintz,Juan Sabia
#t1993
#cComputational Complexity
#index783604
#% 
#!
  
#*Improved Depth Lower Bounds for Small Distance Connectivity.
#@Paul Beame,Russell Impagliazzo,Toniann Pitassi
#t1998
#cComputational Complexity
#index783605
#% 
#!
  
#*Automaticity III: Polynomial Automaticity and Context-Free Languages.
#@Ian Glaister,Jeffrey Shallit
#t1998
#cComputational Complexity
#index783606
#% 
#!
  
#*When do Extra Majority Gates Help? Polylog() Majority Gates Are Equivalent to One.
#@Richard Beigel
#t1994
#cComputational Complexity
#index783607
#% 
#!
  
#*Majority Gates VS. General Weighted Threshold Gates.
#@Mikael Goldmann,Johan Håstad,Alexander A. Razborov
#t1992
#cComputational Complexity
#index783608
#% 
#!
  
#*Perceptrons, PP, and the Polynomial Hierarchy.
#@Richard Beigel
#t1994
#cComputational Complexity
#index783609
#% 
#!
  
#*Lower bounds for linear locally decodable codes and private information retrieval.
#@Oded Goldreich,Howard J. Karloff,Leonard J. Schulman,Luca Trevisan
#t2006
#cComputational Complexity
#index783610
#% 
#!
  
#*On Being Incoherent Without Being Very Hard.
#@Richard Beigel,Joan Feigenbaum
#t1992
#cComputational Complexity
#index783611
#% 
#!
  
#*Quantifying Knowledge Complexity.
#@Oded Goldreich,Erez Petrank
#t1999
#cComputational Complexity
#index783612
#% 
#!
  
#*A tight lower bound for restricted pir protocols.
#@Richard Beigel,Lance Fortnow,William I. Gasarch
#t2006
#cComputational Complexity
#index783613
#%104533
#%210084
#%211219
#%267227
#%621721
#%861210
#%931221
#%950020
#%972370
#!
  
#*On interactive proofs with a laconic prover.
#@Oded Goldreich,Salil P. Vadhan,Avi Wigderson
#t2002
#cComputational Complexity
#index783614
#%211457
#%219404
#%621351
#%621346
#%622539
#%622499
#%783612
#%931374
#%949575
#%951039
#%951574
#%971364
#%971415
#%971590
#%972042
#%972724
#%1058566
#%1059370
#%1059363
#%1342032
#%3005167
#!
  
#*Upper and Lower Bounds for Some Depth-3 Circuit Classes.
#@Richard Beigel,Alexis Maciel
#t1997
#cComputational Complexity
#index783615
#% 
#!
  
#*Polynomial-Time Compression.
#@Judy Goldsmith,Lane A. Hemachandra,Kenneth Kunen
#t1992
#cComputational Complexity
#index783616
#% 
#!
  
#*On ACC.
#@Richard Beigel,Jun Tarui
#t1994
#cComputational Complexity
#index783617
#% 
#!
  
#*Relativized Isomorphisms of NP-Complete Sets.
#@Judy Goldsmith,Deborah Joseph
#t1993
#cComputational Complexity
#index783618
#% 
#!
  
#*Lower Bounds for Monotone Span Programs.
#@Amos Beimel,Anna Gál,Mike Paterson
#t1997
#cComputational Complexity
#index783619
#% 
#!
  
#*Invariance Properties of Rams and Linear Time.
#@Etienne Grandjean
#t1994
#cComputational Complexity
#index783620
#% 
#!
  
#*A New Recursion-Theoretic Characterization of the Polytime Functions.
#@Stephen Bellantoni,Stephen A. Cook
#t1992
#cComputational Complexity
#index783621
#% 
#!
  
#*Monadic Logical Definability of Nondeterministic Linear Time.
#@Etienne Grandjean,Frédéric Olive
#t1998
#cComputational Complexity
#index783622
#% 
#!
  
#*Randomness in Interactive Proofs.
#@Mihir Bellare,Oded Goldreich,Shafi Goldwasser
#t1993
#cComputational Complexity
#index783623
#% 
#!
  
#*A complex-number Fourier technique for lower bounds on the Mod-m degree.
#@Frederic Green
#t2000
#cComputational Complexity
#index783624
#% 
#!
  
#*Hard examples for the bounded depth Frege proof system.
#@Eli Ben-Sasson
#t2002
#cComputational Complexity
#index783625
#%104348
#%104437
#%210099
#%210826
#%621214
#%621778
#%621622
#%622263
#%783554
#%783754
#%861716
#%950043
#%951756
#%1058564
#!
  
#*The complexity of counting colourings and independent sets in sparse graphs and hypergraphs.
#@Catherine S. Greenhill
#t2000
#cComputational Complexity
#index783626
#% 
#!
  
#*Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers.
#@Christer Berg,Staffan Ulfberg
#t1999
#cComputational Complexity
#index783627
#% 
#!
  
#*Complexity of Positivstellensatz proofs for the knapsack.
#@Dima Grigoriev
#t2001
#cComputational Complexity
#index783628
#% 
#!
  
#*Randomized Range-Maxima in Nearly-Constant Parallel Time.
#@Omer Berkman,Yossi Matias,Uzi Vishkin
#t1992
#cComputational Complexity
#index783629
#% 
#!
  
#*Parallel Pointer Machines.
#@Stephen A. Cook,Patrick W. Dymond
#t1993
#cComputational Complexity
#index783630
#% 
#!
  
#*The average sensitivity of square-freeness.
#@Anna Bernasconi,Carsten Damm,Igor Shparlinski
#t2000
#cComputational Complexity
#index783631
#% 
#!
  
#*Complexity lower bounds for randomized computation trees over zero characteristic fields.
#@Dima Grigoriev
#t1999
#cComputational Complexity
#index783632
#% 
#!
  
#*Lower bounds for the bilinear complexity of associative algebras.
#@Markus Bläser
#t2000
#cComputational Complexity
#index783633
#% 
#!
  
#*A Lower Bound for Randomized Algebraic Decision Trees.
#@Dima Grigoriev,Marek Karpinski,Friedhelm Meyer auf der Heide,Roman Smolensky
#t1997
#cComputational Complexity
#index783634
#%210830
#%621567
#%622702
#%623328
#%950628
#%959941
#%1091878
#!
  
#*Lower bounds for the multiplicative complexity of matrix multiplication.
#@Markus Bläser
#t1999
#cComputational Complexity
#index783635
#% 
#!
  
#*Randomization and the Computational Power of Analytic and Algebraic Decision Trees.
#@Dima Grigoriev,Marek Karpinski,Roman Smolensky
#t1997
#cComputational Complexity
#index783636
#% 
#!
  
#*On the complexity of vertex-disjoint length-restricted path problems.
#@Andreas Bley
#t2003
#cComputational Complexity
#index783637
#%610559
#%622215
#%1058971
#%3003185
#!
  
#*An exponential lower bound on the size of algebraic decision trees for Max.
#@Dima Grigoriev,Marek Karpinski,Andrew Chi-Chih Yao
#t1998
#cComputational Complexity
#index783638
#% 
#!
  
#*Function-Algebraic Characterizations of Log and Polylog Parallel Time.
#@Stephen A. Bloch
#t1994
#cComputational Complexity
#index783639
#% 
#!
  
#*Polynomial-time computing over quadratic maps i: sampling in real algebraic sets.
#@Dima Grigoriev,Dmitrii V. Pasechnik
#t2005
#cComputational Complexity
#index783640
#% 
#!
  
#*On the relation between entropy and the average complexity of trajectories in dynamical systems.
#@F. Blume
#t2000
#cComputational Complexity
#index783641
#% 
#!
  
#*Counting Connected Components of a Semialgebraic Set in Subexponential Time.
#@D. Yu. Grigoryev,Nicolai Vorobjov
#t1992
#cComputational Complexity
#index783642
#% 
#!
  
#*Randomness Complexity of Private Computation.
#@Carlo Blundo,Alfredo De Santis,Giuseppe Persiano,Ugo Vaccaro
#t1999
#cComputational Complexity
#index783643
#% 
#!
  
#*Circuits and Multi-Party Protocols.
#@Vince Grolmusz
#t1998
#cComputational Complexity
#index783644
#% 
#!
  
#*Non-Automatizability of Bounded-Depth Frege Proofs.
#@Maria Luisa Bonet,Carlos Domingo,Ricard Gavaldà,Alexis Maciel,Toniann Pitassi
#t2004
#cComputational Complexity
#index783645
#%481487
#%622490
#%797853
#%972144
#%986019
#%1089828
#!
  
#*Selection Problems via M-Ary Queries.
#@Katia S. Guimarães,William I. Gasarch,James M. Purtilo
#t1992
#cComputational Complexity
#index783646
#% 
#!
  
#*Optimality of size-width tradeoffs for resolution.
#@Maria Luisa Bonet,Nicola Galesi
#t2001
#cComputational Complexity
#index783647
#%104395
#%104460
#%209800
#%210067
#%210171
#%621740
#%622970
#%741092
#%771155
#%861116
#%1058664
#%1058663
#%1094175
#!
  
#*Using Amplification to Compute Majority with Small Majority Gates.
#@Arvind Gupta,Sanjeev Mahajan
#t1997
#cComputational Complexity
#index783648
#% 
#!
  
#*Probabilistic Type-2 Operators and "Almost"-Classes.
#@Ronald V. Book,Heribert Vollmer,Klaus W. Wagner
#t1998
#cComputational Complexity
#index783649
#% 
#!
  
#*The complexity of the covering radius problem.
#@Venkatesan Guruswami,Daniele Micciancio,Oded Regev
#t2005
#cComputational Complexity
#index783650
#% 
#!
  
#*Tribute to Roman Smolensky.
#@Allan Borodin
#t1997
#cComputational Complexity
#index783651
#% 
#!
  
#*Uniform hardness versus randomness tradeoffs for Arthur-Merlin games.
#@Dan Gutfreund,Ronen Shaltiel,Amnon Ta-Shma
#t2003
#cComputational Complexity
#index783652
#%104727
#%104624
#%104844
#%104850
#%210995
#%211457
#%211715
#%219404
#%621351
#%622146
#%622334
#%622539
#%622445
#%623124
#%623126
#%623102
#%623194
#%783586
#%861055
#%861886
#%889338
#%949575
#%949797
#%951517
#%971364
#%971415
#%972272
#%972363
#%972703
#%972974
#%972704
#%1058645
#!
  
#*On Lower Bounds for Read-K-Times Branching Programs.
#@Allan Borodin,Alexander A. Razborov,Roman Smolensky
#t1993
#cComputational Complexity
#index783653
#% 
#!
  
#*Circuits on cylinders.
#@Kristoffer Arnsfelt Hansen,Peter Bro Miltersen,V. Vinay
#t2006
#cComputational Complexity
#index783654
#%104276
#%104869
#%951617
#%971453
#!
  
#*On the Decidability of Sparse Univariate Polynomial Interpolation.
#@Allan Borodin,Prasoon Tiwari
#t1991
#cComputational Complexity
#index783655
#% 
#!
  
#*Small PCPs with low query complexity.
#@Prahladh Harsha,Madhu Sudan
#t2000
#cComputational Complexity
#index783656
#%861924
#%949575
#%621298
#%1058566
#%621446
#%930677
#%621852
#%622266
#%622930
#%622980
#%269096
#!
  
#*The Alternation Hierarchy for Sublogarithmic Space is Infinite.
#@Burchard von Braunmühl,Romain Gengler,Robert Rettinger
#t1993
#cComputational Complexity
#index783657
#% 
#!
  
#*On the Power of Small-Depth Threshold Circuits.
#@Johan Håstad,Mikael Goldmann
#t1991
#cComputational Complexity
#index783658
#% 
#!
  
#*Reflections on ``Representations of Sets of Boolean Functions by Commutative Rings'' by Roman Smolensky.
#@Jehoshua Bruck
#t1997
#cComputational Complexity
#index783659
#% 
#!
  
#*Top-Down Lower Bounds for Depth-Three Circuits.
#@Johan Håstad,Stasys Jukna,Pavel Pudlák
#t1995
#cComputational Complexity
#index783660
#% 
#!
  
#*Simple Learning Algorithms Using Divide and Conquer.
#@Nader H. Bshouty
#t1997
#cComputational Complexity
#index783661
#% 
#!
  
#*On the complexity of approximating -set packing.
#@Elad Hazan,Shmuel Safra,Oded Schwartz
#t2006
#cComputational Complexity
#index783662
#% 
#!
  
#*An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models.
#@Nader H. Bshouty,Thomas R. Hancock,Lisa Hellerstein,Marek Karpinski
#t1994
#cComputational Complexity
#index783663
#% 
#!
  
#*Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions.
#@Rafi Heiman,Avi Wigderson
#t1991
#cComputational Complexity
#index783664
#% 
#!
  
#*Polynomial multiplication over finite fields: from quadratic to straight-line complexity.
#@Nader H. Bshouty,Michael Kaminski
#t2006
#cComputational Complexity
#index783665
#% 
#!
  
#*Space-Efficient Recognition of Sparse Self-Reducible Languages.
#@Lane A. Hemaspaandra,Mitsunori Ogihara,Seinosuke Toda
#t1994
#cComputational Complexity
#index783666
#% 
#!
  
#*Fast Exponentiation Using the Truncation Operation.
#@Nader H. Bshouty,Yishay Mansour,Baruch Schieber,Prasoon Tiwari
#t1992
#cComputational Complexity
#index783667
#% 
#!
  
#*PI_k Mass Production and an Optimal Circuit for the Neciporuk Slice.
#@Alain P. Hiltgen,Mike Paterson
#t1995
#cComputational Complexity
#index783668
#% 
#!
  
#*Two oracles that force a big crunch.
#@Harry Buhrman,Stephen A. Fenner,Lance Fortnow,Leen Torenvliet
#t2001
#cComputational Complexity
#index783669
#% 
#!
  
#*Lower Bounds for the Non-Linear Complexity of Algebraic Computation Trees with Integer Inputs.
#@Michael D. Hirsch
#t1991
#cComputational Complexity
#index783670
#% 
#!
  
#*Language compression and pseudorandom generators.
#@Harry Buhrman,Troy Lee,Dieter van Melkebeek
#t2005
#cComputational Complexity
#index783671
#%104422
#%104661
#%104781
#%211867
#%623126
#%623050
#%861146
#%950644
#%960453
#%972821
#%973009
#%973056
#%972704
#%1058752
#%1059166
#%1059792
#!
  
#*Solvability of systems of polynomial congruences modulo a large prime.
#@Ming-Deh A. Huang,Yiu-Chung Wong
#t1999
#cComputational Complexity
#index783672
#% 
#!
  
#*The Relative Power of Logspace and Polynomial Time Reductions.
#@Harry Buhrman,Edith Spaan,Leen Torenvliet
#t1993
#cComputational Complexity
#index783673
#% 
#!
  
#*Improved Low-Density Subset Sum Algorithms.
#@Matthijs J. Coster,Antoine Joux,Brian A. LaMacchia,Andrew M. Odlyzko,Claus-Peter Schnorr,Jacques Stern
#t1992
#cComputational Complexity
#index783674
#% 
#!
  
#*Homogenization and the polynomial calculus.
#@Josh Buresh-Oppenheim,Matthew Clegg,Russell Impagliazzo,Toniann Pitassi
#t2002
#cComputational Complexity
#index783675
#%210170
#%211710
#%621419
#%621740
#%783554
#%861951
#%971631
#!
  
#*Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm.
#@Russell Impagliazzo,Pavel Pudlák,Jiri Sgall
#t1999
#cComputational Complexity
#index783676
#% 
#!
  
#*The complexity of semilinear problems in succinct representation.
#@Peter Bürgisser,Felipe Cucker,Paulin Jacobé de Naurois
#t2006
#cComputational Complexity
#index783677
#% 
#!
  
#*Bounds on Tradeoffs Between Randomness and Communication Complexity.
#@Ran Canetti,Oded Goldreich
#t1993
#cComputational Complexity
#index783678
#% 
#!
  
#*Sperner's Lemma and Robust Machines.
#@Pierluigi Crescenzi,Riccardo Silvestri
#t1998
#cComputational Complexity
#index783679
#% 
#!
  
#*(Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture.
#@Leandro Caniglia,Guillermo Cortiñas,Silvia Danón,Joos Heintz,Teresa Krick,Pablo Solernó
#t1993
#cComputational Complexity
#index783680
#% 
#!
  
#*Function algebraic characterizations of the polytime functions.
#@Hajime Ishihara
#t1999
#cComputational Complexity
#index783681
#% 
#!
  
#*The Electrical Resistance of a Graph Captures its Commute and Cover Times.
#@Ashok K. Chandra,Prabhakar Raghavan,Walter L. Ruzzo,Roman Smolensky,Prasoon Tiwari
#t1997
#cComputational Complexity
#index783682
#% 
#!
  
#*Interactive protocols over the reals.
#@Sergei Ivanov,Michel de Rougemont
#t1999
#cComputational Complexity
#index783683
#% 
#!
  
#*On the Hardness of Approximating Multicut and Sparsest-Cut.
#@Shuchi Chawla,Robert Krauthgamer,Ravi Kumar,Yuval Rabani,D. Sivakumar
#t2006
#cComputational Complexity
#index783684
#% 
#!
  
#*Finding Maximal Orders in Semisimple Algebras Over Q.
#@Gábor Ivanyos,Lajos Rónyai
#t1993
#cComputational Complexity
#index783685
#% 
#!
  
#*Straight-line programs and torsion points on elliptic curves.
#@Qi Cheng
#t2003
#cComputational Complexity
#index783686
#%42731
#%960249
#%972420
#%972829
#!
  
#*Weakly Complete Problems are not Rare.
#@David W. Juedes
#t1995
#cComputational Complexity
#index783687
#% 
#!
  
#*Which bases admit non-trivial shrinkage of formulae?
#@Hana Chockler,Uri Zwick
#t2001
#cComputational Complexity
#index783688
#% 
#!
  
#*On P versus NP cap co-NP for decision trees and read-once branching programs.
#@Stasys Jukna,Alexander A. Razborov,Petr Savický,Ingo Wegener
#t1999
#cComputational Complexity
#index783689
#% 
#!
  
#*The Privacy of Dense Symmetric Functions.
#@Benny Chor,Netta Shani
#t1995
#cComputational Complexity
#index783690
#% 
#!
  
#*Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds.
#@Valentine Kabanets,Russell Impagliazzo
#t2004
#cComputational Complexity
#index783691
#%104419
#%104624
#%198122
#%203999
#%211579
#%449376
#%619768
#%621298
#%621346
#%622629
#%622540
#%622334
#%622980
#%623208
#%783586
#%783752
#%818089
#%861055
#%861924
#%861858
#%931375
#%949520
#%949573
#%949592
#%949575
#%949797
#%949858
#%950272
#%950755
#%950994
#%950816
#%951039
#%951554
#%951574
#%960453
#%971415
#%972272
#%972275
#%972363
#%972821
#%973009
#%973056
#%972829
#%972704
#%993911
#%1058771
#%1058897
#%1059402
#%1059792
#%1060333
#%1060547
#%1095035
#!
  
#*Towards Optimal Simulations of Formulas by Bounded-Width Programs.
#@Richard Cleve
#t1991
#cComputational Complexity
#index783692
#% 
#!
  
#*On the complexity of computing determinants.
#@Erich Kaltofen,Gilles Villard
#t2005
#cComputational Complexity
#index783693
#% 
#!
  
#*On the hardness of approximating the permanent of structured matrices.
#@Bruno Codenotti,Igor Shparlinski,Arne Winterhof
#t2002
#cComputational Complexity
#index783694
#%16969
#%120277
#%610085
#%622649
#%623154
#%623208
#%783574
#%842293
#%933867
#%1012432
#%1058768
#!
  
#*Graph Isomorphism is Low for PP.
#@Johannes Köbler,Uwe Schöning,Jacobo Torán
#t1992
#cComputational Complexity
#index783695
#% 
#!
  
#*Three Sigma^p_2-Complete Problems in Computational Learning Theory.
#@Ker-I Ko,Wen-Guey Tzeng
#t1991
#cComputational Complexity
#index783696
#% 
#!
  
#*Feasibly Continuous Type-Two Functionals.
#@Bruce M. Kapron
#t1999
#cComputational Complexity
#index783697
#% 
#!
  
#*Free binary decision diagrams for the computation of EAR.
#@Jan Kára,Daniel Král
#t2006
#cComputational Complexity
#index783698
#%494451
#%951812
#%971413
#!
  
#*Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity.
#@Mauricio Karchmer,Ran Raz,Avi Wigderson
#t1995
#cComputational Complexity
#index783699
#% 
#!
  
#*Quantum computation of zeta functions of curves.
#@Kiran S. Kedlaya
#t2006
#cComputational Complexity
#index783700
#%42579
#%42786
#%211968
#%219721
#%623259
#%816327
#%993991
#!
  
#*Alternation in interaction.
#@Marcos A. Kiwi,Carsten Lund,Daniel A. Spielman,Alexander Russell,Ravi Sundaram
#t2000
#cComputational Complexity
#index783701
#% 
#!
  
#*The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs.
#@Paul Beame,Russell Impagliazzo,Ashish Sabharwal
#t2007
#cComputational Complexity
#index783702
#% 
#!
  
#*Valiant's model and the cost of computing integers.
#@Pascal Koiran
#t2005
#cComputational Complexity
#index783703
#% 
#!
  
#*The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers.
#@Pierre McKenzie,Klaus W. Wagner
#t2007
#cComputational Complexity
#index783704
#% 
#!
  
#*On the computational power of Boolean decision lists.
#@Matthias Krause
#t2006
#cComputational Complexity
#index783705
#%621309
#%622263
#%783609
#%783709
#%950994
#%971509
#%972291
#%1061001
#%1092744
#!
  
#*If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.
#@Dan Gutfreund,Ronen Shaltiel,Amnon Ta-Shma
#t2007
#cComputational Complexity
#index783706
#%104391
#%104572
#%104607
#%210168
#%210995
#%211445
#%211891
#%621122
#%621138
#%623184
#%623228
#%622965
#%775450
#%783586
#%783786
#%783652
#%861350
#%861415
#%861853
#%949797
#%950465
#%951423
#%972042
#%972128
#%972717
#%973009
#%1059027
#%1059166
#%1059476
#%1059915
#%1060058
#!
  
#*Pseudorandom functions in TC and cryptographic limitations to proving lower bounds.
#@Matthias Krause,Stefan Lucks
#t2001
#cComputational Complexity
#index783707
#% 
#!
  
#*On the Complexity of Succinct Zero-Sum Games.
#@Lance Fortnow,Russell Impagliazzo,Valentine Kabanets,Christopher Umans
#t2008
#cComputational Complexity
#index783708
#%108904
#%210986
#%219309
#%621346
#%622655
#%622672
#%783763
#%861740
#%930309
#%933113
#%971415
#%971606
#!
  
#*Computing Boolean Functions by Polynomials and Threshold Circuits.
#@Matthias Krause,Pavel Pudlák
#t1998
#cComputational Complexity
#index783709
#% 
#!
  
#*Time-Space Tradeoffs for Counting NP Solutions Modulo Integers.
#@R. Ryan Williams
#t2008
#cComputational Complexity
#index783710
#%104341
#%104485
#%104872
#%104828
#%139096
#%211350
#%211920
#%212015
#%212039
#%621437
#%623057
#%623391
#%627488
#%783791
#%861093
#%861156
#%862256
#%862272
#%862427
#%887165
#%950319
#%1058450
#%1058575
#%1059792
#%1060030
#%1060707
#%1060548
#%1089244
#%1093431
#%1093673
#%1095035
#%1180296
#!
  
#*Errata for: "On randomized one-round communication complexity".
#@Ilan Kremer,Noam Nisan,Dana Ron
#t2001
#cComputational Complexity
#index783711
#%104407
#%622577
#!
  
#*Preface to the Special Issue from Random'06.
#@Oded Goldreich
#t2008
#cComputational Complexity
#index783712
#% 
#!
  
#*On Randomized One-Round Communication Complexity.
#@Ilan Kremer,Noam Nisan,Dana Ron
#t1999
#cComputational Complexity
#index783713
#% 
#!
  
#*Randomness-Efficient Sampling within NC.
#@Alexander Healy
#t2008
#cComputational Complexity
#index783714
#% 
#!
  
#*Neat function algebraic characterizations of logspace and linspace.
#@Lars Kristiansen
#t2005
#cComputational Complexity
#index783715
#% 
#!
  
#*Inverse NP Problems.
#@Hubie Chen
#t2008
#cComputational Complexity
#index783716
#%12615
#%493769
#%623072
#%744723
#%816463
#%931986
#%932097
#%1059742
#%1091928
#!
  
#*Recursion Schemata for Slowly Growing Depth Circuit Classes.
#@Satoru Kuroda
#t2004
#cComputational Complexity
#index783717
#%621778
#%783621
#%783605
#%783639
#!
  
#*Halfspace Matrices.
#@Alexander A. Sherstov
#t2008
#cComputational Complexity
#index783718
#%104910
#%104897
#%209856
#%211936
#%212128
#%621468
#%622461
#%783713
#%783577
#%839546
#%862259
#%949799
#%971943
#%972409
#%972792
#%973141
#%1009380
#%1009254
#%1010102
#%1061468
#%1061457
#%1091148
#%1094176
#%2851813
#!
  
#*The Quantum Adversary Method and Classical Formula Size Lower Bounds.
#@Sophie Laplante,Troy Lee,Mario Szegedy
#t2006
#cComputational Complexity
#index783719
#% 
#!
  
#*Space Complexity Vs. Query Complexity.
#@Oded Lachish,Ilan Newman,Asaf Shapira
#t2008
#cComputational Complexity
#index783720
#%623135
#%831305
#%950466
#%971558
#%1051972
#%1052226
#%1058571
#%1060134
#!
  
#*How can a Complex Square Root be Computed in an Optimal Way.
#@Thomas Lickteig,Kai Werther
#t1995
#cComputational Complexity
#index783721
#% 
#!
  
#*Special Issue: "Conference on Computational Complexity 2007" Guest Editor's Foreword.
#@Peter Bro Miltersen
#t2008
#cComputational Complexity
#index783722
#% 
#!
  
#*On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games.
#@Maciej Liskiewicz,Rüdiger Reischuk
#t1999
#cComputational Complexity
#index783723
#% 
#!
  
#*Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions.
#@Daniele Micciancio
#t2007
#cComputational Complexity
#index783724
#%42702
#%42755
#%50922
#%119855
#%120312
#%120310
#%193020
#%193081
#%210268
#%211443
#%621138
#%621144
#%621569
#%622147
#%622804
#%622965
#%783674
#%798011
#%861853
#%930792
#%950465
#%950871
#%950958
#%951423
#%971353
#%971906
#%1014208
#%1059476
#%1060061
#%1060060
#%1094479
#%1080584
#!
  
#*On-line Learning of Linear Functions.
#@Nick Littlestone,Philip M. Long,Manfred K. Warmuth
#t1995
#cComputational Complexity
#index783725
#% 
#!
  
#*Polynomials that Sign Represent Parity and Descartes' Rule of Signs.
#@Saugata Basu,Nayantara Bhatnagar,Parikshit Gopalan,Richard J. Lipton
#t2008
#cComputational Complexity
#index783726
#%104541
#%211266
#%211193
#%622772
#%622831
#%623057
#%783609
#%783591
#%861659
#%931364
#%950618
#%953019
#%971485
#!
  
#*The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity.
#@James F. Lynch
#t1992
#cComputational Complexity
#index783727
#% 
#!
  
#*The Strength of Multilinear Proofs.
#@Ran Raz,Iddo Tzameret
#t2008
#cComputational Complexity
#index783728
#% 
#!
  
#*Two Tapes Versus One for Off-Line Turing Machines.
#@Wolfgang Maass,Georg Schnitger,Endre Szemerédi,György Turán
#t1993
#cComputational Complexity
#index783729
#% 
#!
  
#*On Pseudorandom Generators with Linear Stretch in NC.
#@Benny Applebaum,Yuval Ishai,Eyal Kushilevitz
#t2008
#cComputational Complexity
#index783730
#% 
#!
  
#*Quantum Arthur-Merlin games.
#@Chris Marriott,John Watrous
#t2005
#cComputational Complexity
#index783731
#% 
#!
  
#*Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time.
#@Marius Zimand
#t2008
#cComputational Complexity
#index783732
#%104727
#%104769
#%104847
#%210486
#%210684
#%210783
#%210995
#%211069
#%384764
#%557726
#%622147
#%623051
#%783691
#%861081
#%861273
#%861625
#%972704
#%985845
#%986122
#%1058645
#%1058992
#%1059362
#%1059476
#%1061405
#%3255630
#%3255416
#!
  
#*Parameterized complexity of constraint satisfaction problems.
#@Dániel Marx
#t2005
#cComputational Complexity
#index783733
#% 
#!
  
#*The complexity of chromatic strength and chromatic edge strength.
#@Dániel Marx
#t2006
#cComputational Complexity
#index783734
#%22484
#%46597
#%494068
#%627488
#%836194
#%837974
#%847891
#%852109
#%853215
#%887133
#%931296
#%931655
#%950638
#%952599
#%977006
#%1060614
#%1060518
#%1092051
#%1095126
#!
  
#*Hardness Hypotheses, Derandomization, and Circuit Complexity.
#@John M. Hitchcock,Aduri Pavan
#t2008
#cComputational Complexity
#index783735
#% 
#!
  
#*On the Oracle Complexity of Factoring Integers.
#@Ueli M. Maurer
#t1995
#cComputational Complexity
#index783736
#% 
#!
  
#*Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems.
#@Richard Cleve,William Slofstra,Falk Unger,Sarvagya Upadhyay
#t2008
#cComputational Complexity
#index783737
#%104496
#%104885
#%211971
#%621471
#%621970
#%622516
#%623327
#%823052
#%862162
#%950618
#%972416
#%1058566
#%1060340
#%1091173
#!
  
#*NC¹: The Automata-Theoretic Viewpoint.
#@Pierre McKenzie,Pierre Péladeau,Denis Thérien
#t1991
#cComputational Complexity
#index783738
#% 
#!
  
#*Basis Collapse in Holographic Algorithms.
#@Jin-yi Cai,Pinyan Lu
#t2008
#cComputational Complexity
#index783739
#%104880
#%104872
#%211920
#%212039
#%623391
#%861697
#%862256
#%862427
#%1060582
#%1095032
#!
  
#*Special Issue on Circuit Complexity: Foreword.
#@Pierre McKenzie,Denis Thérien
#t1994
#cComputational Complexity
#index783740
#% 
#!
  
#*The "log rank" conjecture for modular communication complexity.
#@Christoph Meinel,Stephan Waack
#t2001
#cComputational Complexity
#index783741
#% 
#!
  
#*Limits on the Hardness of Lattice Problems in Norms.
#@Chris Peikert
#t2008
#cComputational Complexity
#index783742
#% 
#!
  
#*Deterministic polynomial-time quantum algorithms for Simon's problem.
#@Takashi Mihara,Shao Chin Sung
#t2003
#cComputational Complexity
#index783743
#%451424
#%622193
#%1058599
#%1060454
#%1060461
#!
  
#*Derandomizing Arthur-Merlin Games using Hitting Sets.
#@Peter Bro Miltersen,N. V. Vinodchandran
#t2005
#cComputational Complexity
#index783744
#%104781
#%209910
#%210986
#%211457
#%267250
#%267252
#%611019
#%621355
#%621351
#%621346
#%622147
#%622334
#%623126
#%783586
#%861055
#%861786
#%861866
#%949520
#%951517
#%971415
#%972272
#%973009
#%973056
#%972974
#%973123
#%972704
#%1058645
#%1059792
#%1061057
#%1088955
#!
  
#*A Note on Rabin's Width of a Complete Proof.
#@José Luis Montaña,Luis Miguel Pardo,Tomás Recio
#t1994
#cComputational Complexity
#index783745
#% 
#!
  
#*Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets.
#@Ashish V. Naik,Alan L. Selman
#t1999
#cComputational Complexity
#index783746
#% 
#!
  
#*RL <= SC.
#@Noam Nisan
#t1994
#cComputational Complexity
#index783747
#% 
#!
  
#*On the Degree of Boolean Functions as Real Polynomials.
#@Noam Nisan,Mario Szegedy
#t1994
#cComputational Complexity
#index783748
#% 
#!
  
#*Lower Bounds on Arithmetic Circuits Via Partial Derivatives.
#@Noam Nisan,Avi Wigderson
#t1997
#cComputational Complexity
#index783749
#% 
#!
  
#*Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication.
#@Mike Paterson,Uri Zwick
#t1993
#cComputational Complexity
#index783750
#% 
#!
  
#*The Hardness of Approximation: Gap Location.
#@Erez Petrank
#t1994
#cComputational Complexity
#index783751
#% 
#!
  
#*Exponential lower bounds for depth three Boolean circuits.
#@Ramamohan Paturi,Michael E. Saks,Francis Zane
#t2000
#cComputational Complexity
#index783752
#% 
#!
  
#*Primality Testing with Fewer Random Bits.
#@René Peralta,Victor Shoup
#t1993
#cComputational Complexity
#index783753
#% 
#!
  
#*Exponential Lower Bounds for the Pigeonhole Principle.
#@Toniann Pitassi,Paul Beame,Russell Impagliazzo
#t1993
#cComputational Complexity
#index783754
#% 
#!
  
#*Languages to diagonalize against advice classes.
#@Chris Pollett
#t2006
#cComputational Complexity
#index783755
#%375566
#%493814
#%741327
#%951558
#%972774
#%1015610
#%1060547
#%3004884
#%3541
#!
  
#*Improving Known Solutions is Hard.
#@Desh Ranjan,Suresh Chari,Pankaj Rohatgi
#t1993
#cComputational Complexity
#index783756
#% 
#!
  
#*Deterministic polynomial identity testing in non-commutative models.
#@Ran Raz,Amir Shpilka
#t2005
#cComputational Complexity
#index783757
#% 
#!
  
#*Lower Bounds for the Polynomial Calculus.
#@Alexander A. Razborov
#t1998
#cComputational Complexity
#index783758
#% 
#!
  
#*An Average Complexity Measure that Yields Tight Hierarchies.
#@Rüdiger Reischuk,Christian Schindelhauer
#t1997
#cComputational Complexity
#index783759
#% 
#!
  
#*A complexity gap for tree resolution.
#@Søren Riis
#t2001
#cComputational Complexity
#index783760
#% 
#!
  
#*Algorithmic Properties of Maximal Orders in Simple Algebras over Q.
#@Lajos Rónyai
#t1992
#cComputational Complexity
#index783761
#% 
#!
  
#*Finding Irreducible Components of Some Real Transcendental Varieties.
#@Marie-Françoise Roy,Nicolai Vorobjov
#t1994
#cComputational Complexity
#index783762
#% 
#!
  
#*Symmetric Alternation Captures BPP.
#@Alexander Russell,Ravi Sundaram
#t1998
#cComputational Complexity
#index783763
#% 
#!
  
#*On the complexity of approximating tsp with neighborhoods and related problems.
#@Shmuel Safra,Oded Schwartz
#t2006
#cComputational Complexity
#index783764
#%104598
#%185939
#%451455
#%621853
#%622098
#%622299
#%622234
#%622887
#%622980
#%783751
#%816412
#%835927
#%930537
#%940428
#%949569
#%951041
#%952867
#%1060076
#%111297
#!
  
#*Verifying the Determinant in Parallel.
#@Miklos Santha,Sovanna Tan
#t1998
#cComputational Complexity
#index783765
#% 
#!
  
#*On the size of randomized OBDDs and read-once branching programs for k-stable functions.
#@Martin Sauerhoff
#t2001
#cComputational Complexity
#index783766
#% 
#!
  
#*Towards proving strong direct product theorems.
#@Ronen Shaltiel
#t2003
#cComputational Complexity
#index783767
#%210986
#%622147
#%622882
#%798416
#%1058834
#%1060340
#%1060149
#%1061468
#%1094176
#!
  
#*On the Rank of Certain Finite Fields.
#@Mohammad Amin Shokrollahi
#t1991
#cComputational Complexity
#index783768
#% 
#!
  
#*Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields.
#@Mohammad Amin Shokrollahi
#t1992
#cComputational Complexity
#index783769
#% 
#!
  
#*Lower Bounds for Polynomial Evaluation and Interpolation Problems.
#@Victor Shoup,Roman Smolensky
#t1997
#cComputational Complexity
#index783770
#% 
#!
  
#*A Deterministic Test for Permutation Polynomials.
#@Igor Shparlinski
#t1992
#cComputational Complexity
#index783771
#% 
#!
  
#*Depth-3 arithmetic circuits over fields of characteristic zero.
#@Amir Shpilka,Avi Wigderson
#t2001
#cComputational Complexity
#index783772
#% 
#!
  
#*A separation of syntactic and nonsyntactic (1, +k)-branching programs.
#@Detlef Sieling
#t2000
#cComputational Complexity
#index783773
#% 
#!
  
#*Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates.
#@Meera Sitharam
#t1995
#cComputational Complexity
#index783774
#% 
#!
  
#*Pseudorandom Generators and Learning Algorithms for AC^0.
#@Meera Sitharam
#t1995
#cComputational Complexity
#index783775
#% 
#!
  
#*Representations of Sets of Boolean Functions by Commutative Rings.
#@Roman Smolensky
#t1997
#cComputational Complexity
#index783776
#% 
#!
  
#*Easy Lower Bound for a Strange Computational Model.
#@Roman Smolensky
#t1997
#cComputational Complexity
#index783777
#% 
#!
  
#*Well-Known Bound for the VC-Dimension Made Easy.
#@Roman Smolensky
#t1997
#cComputational Complexity
#index783778
#% 
#!
  
#*A Lower Bound on the Mod 6 Degree of the Or Function.
#@Gábor Tardos,David A. Mix Barrington
#t1998
#cComputational Complexity
#index783779
#% 
#!
  
#*Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size.
#@Denis Thérien
#t1994
#cComputational Complexity
#index783780
#% 
#!
  
#*On Closure Properties of GapP.
#@Thomas Thierauf,Seinosuke Toda,Osamu Watanabe
#t1994
#cComputational Complexity
#index783781
#% 
#!
  
#*The Complexity of Tensor Circuit Evaluation.
#@Martin Beaudry,Markus Holzer
#t2007
#cComputational Complexity
#index783782
#%3348
#%621621
#%627488
#%783552
#%888326
#%929954
#%949951
#%951796
#%971486
#%971474
#%971914
#%1058771
#%1088760
#%1088817
#%1089244
#!
  
#*A Generic Time Hierarchy with One Bit of Advice.
#@Dieter van Melkebeek,Konstantin Pervyshev
#t2007
#cComputational Complexity
#index783783
#%210600
#%622028
#%622029
#%622027
#%949575
#%951558
#%972752
#!
  
#*Pseudorandomness and Average-Case Complexity Via Uniform Reductions.
#@Luca Trevisan,Salil P. Vadhan
#t2007
#cComputational Complexity
#index783784
#%104473
#%104706
#%104607
#%104683
#%104844
#%139080
#%209814
#%210600
#%210986
#%210995
#%211457
#%211891
#%267252
#%619768
#%621351
#%621625
#%622029
#%622152
#%622334
#%783586
#%783786
#%783652
#%861055
#%861262
#%861350
#%861415
#%861627
#%861978
#%949797
#%950272
#%951039
#%951573
#%951574
#%971558
#%972272
#%972705
#%973009
#%973056
#%972704
#%1058368
#%1058645
#%1058753
#%1059166
#%1059476
#%1060547
#%1061744
#%1342032
#%3005167
#!
  
#*On the Complexity of Planar Boolean Circuits.
#@György Turán
#t1995
#cComputational Complexity
#index783785
#% 
#!
  
#*The complexity of constructing pseudorandom generators from hard functions.
#@Emanuele Viola
#t2005
#cComputational Complexity
#index783786
#% 
#!
  
#*On the complexity of simulating space-bounded quantum computations.
#@John Watrous
#t2003
#cComputational Complexity
#index783787
#%104769
#%268366
#%621226
#%971914
#%971948
#%973102
#%1058330
#!
  
#*Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword.
#@Oded Goldreich,Salil P. Vadhan
#t2007
#cComputational Complexity
#index783788
#%104607
#%104875
#%210268
#%621122
#%621157
#%621138
#%783574
#%783786
#%861415
#%861853
#%930288
#%951423
#%972042
#%972275
#%973009
#%1059166
#%1059915
#%1060061
#%3256291
#!
  
#*Compression of Samplable Sources.
#@Luca Trevisan,Salil P. Vadhan,David Zuckerman
#t2005
#cComputational Complexity
#index783789
#%104537
#%104801
#%104846
#%145937
#%211482
#%211665
#%211894
#%620606
#%622371
#%622974
#%623126
#%783567
#%861050
#%861979
#%889448
#%953158
#%972705
#%972910
#%972704
#%1052189
#%1058834
#%1059355
#%1059476
#%1059658
#%1095035
#!
  
#*A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness.
#@Paul Beame,Toniann Pitassi,Nathan Segerlind,Avi Wigderson
#t2006
#cComputational Complexity
#index783790
#%104288
#%104407
#%104786
#%211169
#%621658
#%622882
#%623042
#%783577
#%819651
#%861092
#%861440
#%929662
#%951418
#%971447
#%971417
#%971408
#%1058491
#%1060151
#%1060340
#%1060149
#%1061211
#%1094176
#!
  
#*Inductive Time-Space Lower Bounds for Sat and Related Problems.
#@Ryan Williams
#t2006
#cComputational Complexity
#index783791
#%104485
#%104477
#%104811
#%185539
#%211350
#%622404
#%861093
#%930677
#%933669
#%949951
#%950319
#%950703
#%951341
#%951545
#%1058775
#%1060030
#!
  
#*Pseudorandomness for Approximate Counting and Sampling.
#@Ronen Shaltiel,Christopher Umans
#t2006
#cComputational Complexity
#index783792
#%104483
#%210986
#%211457
#%621346
#%621459
#%622334
#%783586
#%783763
#%861055
#%861498
#%861740
#%930309
#%971606
#%973009
#%973056
#%972704
#%1058645
#%1059166
#%1059370
#%1059450
#%1059792
#%1088955
#!
  
#*Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword.
#@Anna Gál
#t2006
#cComputational Complexity
#index783793
#% 
#!
  
#*Complexity of Ring Morphism Problems.
#@Neeraj Kayal,Nitin Saxena
#t2006
#cComputational Complexity
#index783794
#%42606
#%557726
#%622703
#%861273
#%972936
#%1059370
#!
  
#*Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword.
#@Venkatesan Guruswami,Valentine Kabanets
#t2007
#cComputational Complexity
#index783795
#% 
#!
  
#*Every Linear Threshold Function has a Low-Weight Approximator.
#@Rocco A. Servedio
#t2007
#cComputational Complexity
#index783796
#%39284
#%105275
#%109128
#%109232
#%211077
#%211482
#%494327
#%621897
#%624299
#%887890
#%951841
#%971497
#%972143
#%971962
#%972409
#%1009339
#%1059359
#%1061457
#!
  
#*An Improved Analysis of Linear Mergers.
#@Zeev Dvir,Amir Shpilka
#t2007
#cComputational Complexity
#index783797
#%210032
#%622666
#%622889
#%623122
#%861494
#!
  
#*Polynomial Identity Testing for Depth 3 Circuits.
#@Neeraj Kayal,Nitin Saxena
#t2007
#cComputational Complexity
#index783798
#%198122
#%621890
#%622182
#%622629
#%622540
#%622978
#%783772
#%783757
#%783691
#%818089
#%861095
#%861560
#%934133
#%949592
#%950790
#%951554
#%1058897
#!
  
#*Communication vs. Computation.
#@Prahladh Harsha,Yuval Ishai,Joe Kilian,Kobbi Nissim,Srinivasan Venkatesh
#t2007
#cComputational Complexity
#index783799
#%621658
#%622147
#%622881
#%623099
#%623312
#%783678
#%887672
#%951039
#%1058491
#%1058834
#%1060151
#%1095035
#!
  
#*New Results on the Complexity of the Middle Bit of Multiplication.
#@Ingo Wegener,Philipp Woelfel
#t2007
#cComputational Complexity
#index783800
#% 
#!
  
#*Dimension Characterizations of Complexity Classes.
#@Xiaoyang Gu,Jack H. Lutz
#t2008
#cComputational Complexity
#index1221786
#% 
#!
  
#*2-Local Random Reductions to 3-Valued Functions.
#@Aduri Pavan,N. V. Vinodchandran
#t2008
#cComputational Complexity
#index1221787
#% 
#!
  
#*Probabilistic Communication Complexity Over The Reals.
#@Dima Grigoriev
#t2008
#cComputational Complexity
#index1221788
#% 
#!
  
#*Balancing Syntactically Multilinear Arithmetic Circuits.
#@Ran Raz,Amir Yehudayoff
#t2008
#cComputational Complexity
#index1221789
#% 
#!
  
#*Every 2-csp Allows Nontrivial Approximation.
#@Johan Håstad
#t2008
#cComputational Complexity
#index1221790
#% 
#!
  
#*Hardness Amplification via Space-Efficient Direct Products.
#@Venkatesan Guruswami,Valentine Kabanets
#t2008
#cComputational Complexity
#index1221791
#% 
#!
  
#*On Defining Integers And Proving Arithmetic Circuit Lower Bounds.
#@Peter Bürgisser
#t2009
#cComputational Complexity
#index1221792
#% 
#!
  
#*Extractors And Rank Extractors For Polynomial Sources.
#@Zeev Dvir,Ariel Gabizon,Avi Wigderson
#t2009
#cComputational Complexity
#index1221793
#% 
#!
  
#*Using Entanglement in Quantum Multi-Prover Interactive Proofs.
#@Julia Kempe,Hirotada Kobayashi,Keiji Matsumoto,Thomas Vidick
#t2009
#cComputational Complexity
#index1221794
#% 
#!
  
#*Nullstellensätze for Zero-Dimensional Gröbner Bases.
#@Amir Hashemi
#t2009
#cComputational Complexity
#index1221795
#% 
#!
  
#*Disjointness is Hard in the Multiparty Number-on-the-Forehead Model.
#@Troy Lee,Adi Shraibman
#t2009
#cComputational Complexity
#index1221796
#% 
#!
  
#*Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword.
#@Paul Beame,Amit Chakrabarti
#t2009
#cComputational Complexity
#index1221797
#% 
#!
  
#*Approximation Resistant Predicates from Pairwise Independence.
#@Per Austrin,Elchanan Mossel
#t2009
#cComputational Complexity
#index1221798
#% 
#!
  
#*Robust Algorithms For Generalized Pham Systems.
#@Ezequiel Dratman,Guillermo Matera,Ariel Waissbein
#t2009
#cComputational Complexity
#index1221799
#% 
#!
  
#*Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.
#@Alexander A. Sherstov
#t2009
#cComputational Complexity
#index1221800
#% 
#!
  
#*Lower Bounds and Separations for Constant Depth Multilinear Circuits.
#@Ran Raz,Amir Yehudayoff
#t2009
#cComputational Complexity
#index1221801
#% 
#!
  
#*The Black-Box Query Complexity of Polynomial Summation.
#@Ali Juma,Valentine Kabanets,Charles Rackoff,Amir Shpilka
#t2009
#cComputational Complexity
#index1221802
#% 
#!
  
#*The Sum of Small-Bias Generators Fools Polynomials of Degree .
#@Emanuele Viola
#t2009
#cComputational Complexity
#index1221803
#% 
#!
  
#*On Approximate Majority and Probabilistic Time.
#@Emanuele Viola
#t2009
#cComputational Complexity
#index1333365
#% 
#!
  
#*Space-Efficient Counting in Graphs on Surfaces.
#@Mark Braverman,Raghav Kulkarni,Sambuddha Roy
#t2009
#cComputational Complexity
#index1333359
#% 
#!
  
#*Reduced Kronecker Coefficients and Counter-Examples to Mulmuley's Strong Saturation Conjecture SH.
#@Emmanuel Briand,Rosa Orellana,Mercedes Rosas
#t2009
#cComputational Complexity
#index1333363
#% 
#!
  
#*Upper Bounds for Monotone Planar Circuit Value and Variants.
#@Nutan Limaye,Meena Mahajan,Jayalal M. N. Sarma
#t2009
#cComputational Complexity
#index1333364
#% 
#!
  
#*VPSPACE and a Transfer Theorem over the Reals.
#@Pascal Koiran,Sylvain Perifel
#t2009
#cComputational Complexity
#index1333358
#% 
#!
  
#*Private Approximation of Clustering and Vertex Cover.
#@Amos Beimel,Renen Hallak,Kobbi Nissim
#t2009
#cComputational Complexity
#index1333361
#% 
#!
  
#*On the Approximation Resistance of a Random Predicate.
#@Johan Håstad
#t2009
#cComputational Complexity
#index1333362
#% 
#!
  
#*Constructions of Low-degree and Error-Correcting epsilon-Biased Generators.
#@Amir Shpilka
#t2009
#cComputational Complexity
#index1333360
#% 
#!
  
#*Parallel Time and Quantifier Prefixes.
#@Felipe Cucker,Paulin Jacobé de Naurois
#t2009
#cComputational Complexity
#index1333357
#% 
#!
  
#*A New Characterization of ACC and Probabilistic CC.
#@Kristoffer Arnsfelt Hansen,Michal Koucký
#t2010
#cComputational Complexity
#index2851187
#% 
#!
  
#*Special Issue "Conference on Computational Complexity 2009" Guest Editor's Foreword.
#@Johan Håstad
#t2010
#cComputational Complexity
#index2851188
#% 
#!
  
#*The Complexity of Boolean Functions in Different Characteristics.
#@Parikshit Gopalan,Amir Shpilka,Shachar Lovett
#t2010
#cComputational Complexity
#index2851195
#% 
#!
  
#*Counting Irreducible Components of Complex Algebraic Varieties.
#@Peter Bürgisser,Peter Scheiblechner
#t2010
#cComputational Complexity
#index2851196
#% 
#!
  
#*Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic.
#@Jin-yi Cai,Xi Chen,Dong Li
#t2010
#cComputational Complexity
#index2851189
#% 
#!
  
#*Lower Bounds on the Randomized Communication Complexity of Read-Once Functions.
#@Nikos Leonardos,Michael Saks
#t2010
#cComputational Complexity
#index2851190
#% 
#!
  
#*Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes.
#@Vikraman Arvind,T. C. Vijayaraghavan
#t2010
#cComputational Complexity
#index2851197
#% 
#!
  
#*Communication Complexity Under Product and Nonproduct Distributions.
#@Alexander A. Sherstov
#t2010
#cComputational Complexity
#index2851191
#% 
#!
  
#*Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete.
#@Akitoshi Kawamura
#t2010
#cComputational Complexity
#index2851192
#% 
#!
  
#*On The Randomness Complexity of Property Testing.
#@Oded Goldreich,Or Sheffet
#t2010
#cComputational Complexity
#index2851193
#% 
#!
  
#*-Subgraph Isomorphism on AC Circuits.
#@Kazuyuki Amano
#t2010
#cComputational Complexity
#index2851194
#% 
#!
  
#*Are PCPs Inherent in Efficient Arguments?
#@Guy N. Rothblum,Salil P. Vadhan
#t2010
#cComputational Complexity
#index2851186
#% 
#!
  
#*New Results on Noncommutative and Commutative Polynomial Identity Testing.
#@Vikraman Arvind,Partha Mukhopadhyay,Srikanth Srinivasan
#t2010
#cComputational Complexity
#index2964917
#% 
#!
  
#*All Natural NP-Complete Problems Have Average-Case Complete Versions.
#@Noam Livne
#t2010
#cComputational Complexity
#index2964918
#% 
#!
  
#*Space Hierarchy Results for Randomized and other Semantic Models.
#@Jeff Kinne,Dieter van Melkebeek
#t2010
#cComputational Complexity
#index2964909
#% 
#!
  
#*Interpolation of Shifted-Lacunary Polynomials.
#@Mark Giesbrecht,Daniel S. Roche
#t2010
#cComputational Complexity
#index2964912
#% 
#!
  
#*Efficiently Certifying Non-Integer Powers.
#@Erich Kaltofen,Mark Lavin
#t2010
#cComputational Complexity
#index2964910
#% 
#!
  
#*Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size.
#@Dana Moshkovitz,Ran Raz
#t2010
#cComputational Complexity
#index2964911
#% 
#!
  
#*The Complexity of the Inertia.
#@Thanh Minh Hoang,Thomas Thierauf
#t2010
#cComputational Complexity
#index2964914
#% 
#!
  
#*Random Cnf's are Hard for the Polynomial Calculus.
#@Eli Ben-Sasson,Russell Impagliazzo
#t2010
#cComputational Complexity
#index2964913
#% 
#!
  
#*Lower Bounds for Agnostic Learning via Approximate Rank.
#@Adam R. Klivans,Alexander A. Sherstov
#t2010
#cComputational Complexity
#index2964916
#% 
#!
  
#*A Complexity Dichotomy For Hypergraph Partition Functions.
#@Martin E. Dyer,Leslie Ann Goldberg,Mark Jerrum
#t2010
#cComputational Complexity
#index2964915
#% 
#!
  
#*Complexity of Hard-Core Set Proofs.
#@Chi-Jen Lu,Shi-Chun Tsai,Hsin-Lung Wu
#t2011
#cComputational Complexity
#index3062558
#% 
#!
  
#*Generic Complexity of Finitely Presented Monoids and Semigroups.
#@Mark Kambites
#t2011
#cComputational Complexity
#index3062559
#% 
#!
  
#*Parameterized Proof Complexity.
#@Stefan S. Dantchev,Barnaby Martin,Stefan Szeider
#t2011
#cComputational Complexity
#index3062562
#% 
#!
  
#*Interpolation in Valiant's Theory.
#@Pascal Koiran,Sylvain Perifel
#t2011
#cComputational Complexity
#index3062560
#% 
#!
  
#*Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma.
#@Ronen Shaltiel
#t2011
#cComputational Complexity
#index3062561
#% 
#!
  
#*Arthur and Merlin as Oracles.
#@Venkatesan T. Chakaravarthy,Sambuddha Roy
#t2011
#cComputational Complexity
#index3150709
#% 
#!
  
#*On Matrix Rigidity and Locally Self-correctable Codes.
#@Zeev Dvir
#t2011
#cComputational Complexity
#index3150708
#% 
#!
  
#*The Gaussian Surface Area and Noise Sensitivity of Degree- Polynomial Threshold Functions.
#@Daniel M. Kane
#t2011
#cComputational Complexity
#index3150706
#% 
#!
  
#*Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
#@Baris Aydinlioglu,Dan Gutfreund,John M. Hitchcock,Akinori Kawachi
#t2011
#cComputational Complexity
#index3150707
#% 
#!
  
#*Spectral Algorithms for Unique Games.
#@Alexandra Kolla
#t2011
#cComputational Complexity
#index3150705
#% 
#!
  
#*PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability.
#@Irit Dinur,Eldar Fischer,Guy Kindler,Ran Raz,Shmuel Safra
#t2011
#cComputational Complexity
#index3150703
#% 
#!
  
#*Derandomized Parallel Repetition via Structured PCPs.
#@Irit Dinur,Or Meir
#t2011
#cComputational Complexity
#index3150704
#% 
#!
  
#*Homogeneous Formulas and Symmetric Polynomials.
#@Pavel Hrubes,Amir Yehudayoff
#t2011
#cComputational Complexity
#index3150711
#% 
#!
  
#*Special Issue "Conference on Computational Complexity 2010" Guest Editor's Foreword.
#@Dieter van Melkebeek
#t2011
#cComputational Complexity
#index3150710
#% 
#!
  
#*On the security of Goldreich's one-way function.
#@Andrej Bogdanov,Youming Qiao
#t2012
#cComputational Complexity
#index3381620
#% 
#!
  
#*Hierarchy Theorems for Property Testing.
#@Oded Goldreich,Michael Krivelevich,Ilan Newman,Eyal Rozenberg
#t2012
#cComputational Complexity
#index3381622
#% 
#!
  
#*Property Testing Lower Bounds via Communication Complexity.
#@Eric Blais,Joshua Brody,Kevin Matulef
#t2012
#cComputational Complexity
#index3381629
#% 
#!
  
#*Lower Bounds for k-DNF Resolution on Random 3-CNFs.
#@Michael Alekhnovich
#t2011
#cComputational Complexity
#index3381628
#% 
#!
  
#*Random low-degree polynomials are hard to approximate.
#@Ido Ben-Eliezer,Rani Hod,Shachar Lovett
#t2012
#cComputational Complexity
#index3381635
#% 
#!
  
#*Bounded-Depth Circuits Cannot Sample Good Codes.
#@Shachar Lovett,Emanuele Viola
#t2012
#cComputational Complexity
#index3381619
#% 
#!
  
#*Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword.
#@Anup Rao
#t2012
#cComputational Complexity
#index3381630
#% 
#!
  
#*Obituary.
#@Max Nalsky,Michael Ostrovsky
#t2011
#cComputational Complexity
#index3381627
#% 
#!
  
#*More on Average Case vs Approximation Complexity.
#@Michael Alekhnovich
#t2011
#cComputational Complexity
#index3381626
#% 
#!
  
#*Towards lower bounds on locally testable codes via density arguments.
#@Eli Ben-Sasson,Michael Viderman
#t2012
#cComputational Complexity
#index3381633
#% 
#!
  
#*Special issue from RANDOM'09: Editors' Foreword.
#@Oded Goldreich,Salil P. Vadhan
#t2012
#cComputational Complexity
#index3381621
#% 
#!
  
#*Improved direct product theorems for randomized query complexity.
#@Andrew Drucker
#t2012
#cComputational Complexity
#index3381634
#% 
#!
  
#*Toward a Model for Backtracking and Dynamic Programming.
#@Michael Alekhnovich,Allan Borodin,Joshua Buresh-Oppenheim,Russell Impagliazzo,Avner Magen,Toniann Pitassi
#t2011
#cComputational Complexity
#index3381625
#% 
#!
  
#*Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy.
#@Mikhail Alekhnovich,Sanjeev Arora,Iannis Tourlakis
#t2011
#cComputational Complexity
#index3381624
#% 
#!
  
#*Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds.
#@Jeff Kinne,Dieter van Melkebeek,Ronen Shaltiel
#t2012
#cComputational Complexity
#index3381631
#% 
#!
  
#*Special Issue In Memory of Misha Alekhnovich. Foreword.
#@Allan Borodin,Toniann Pitassi,Alexander A. Razborov
#t2011
#cComputational Complexity
#index3381618
#% 
#!
  
#*Hardness of Approximating the Closest Vector Problem with Pre-Processing.
#@Mikhail Alekhnovich,Subhash Khot,Guy Kindler,Nisheeth K. Vishnoi
#t2011
#cComputational Complexity
#index3381632
#% 
#!
  
#*Satisfiability, Branch-Width and Tseitin tautologies.
#@Michael Alekhnovich,Alexander A. Razborov
#t2011
#cComputational Complexity
#index3381623
#% 
#!
  
#*On a Theorem of Razborov.
#@Henning Wunderlich
#t2012
#cComputational Complexity
#index3469703
#% 
#!
  
#*Length 3 Edge-Disjoint Paths Is NP-Hard.
#@Hannah Alpert,Jennifer Iglesias
#t2012
#cComputational Complexity
#index3469705
#% 
#!
  
#*A Quantum Characterization Of NP.
#@Hugue Blier,Alain Tapp
#t2012
#cComputational Complexity
#index3469704
#% 
#!
  
#*Complexity and Approximability of the Cover Polynomial.
#@Markus Bläser,Holger Dell,Mahmoud Fouz
#t2012
#cComputational Complexity
#index3469706
#% 
#!
  
#*On reducing factorization to the discrete logarithm problem modulo a composite.
#@Jacek Pomykala,Bartosz Zralek
#t2012
#cComputational Complexity
#index3469708
#% 
#!
  
#*Low-Depth Witnesses are Easy to Find.
#@Luis Filipe Coelho Antunes,Lance Fortnow,Alexandre Pinto,Andre Souto
#t2012
#cComputational Complexity
#index3469707
#% 
#!
  
#*Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping.
#@Edmund M. Clarke,Kenneth L. McMillan,Xudong Zhao,Masahiro Fujita,J. Yang
#t1997
#cFormal Methods in System Design
#index878778
#% 
#!
  
#*Formal Verification of the VAMP Floating Point Unit.
#@Christian Jacobi,Christoph Berg
#t2005
#cFormal Methods in System Design
#index878779
#%40085
#%49500
#%71766
#%79324
#%79341
#%79545
#%79760
#%131210
#%131550
#%209216
#%209187
#%209168
#%219697
#%281806
#%281619
#%542473
#%878954
#%879050
#%1080430
#%1127430
#%3004538
#!
  
#*Predicate Abstraction of ANSI-C Programs Using SAT.
#@Edmund M. Clarke,Daniel Kroening,Natasha Sharygina,Karen Yorav
#t2004
#cFormal Methods in System Design
#index878780
#%79224
#%79353
#%79338
#%79474
#%79655
#%131833
#%131900
#%133250
#%209233
#%361599
#%484602
#%542317
#%546114
#%546304
#%546057
#%615550
#%837885
#%878995
#%1123402
#%1123552
#%1127717
#!
  
#*A Methodology for Efficient Hardware Verification.
#@Mark Aagaard,Miriam Leeser
#t1994
#cFormal Methods in System Design
#index878781
#% 
#!
  
#*A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus.
#@Rance Cleaveland,Bernhard Steffen
#t1993
#cFormal Methods in System Design
#index878782
#% 
#!
  
#*Formal Verification Successes at Motorola.
#@Magdy S. Abadir,Ken Albin,John Havlicek,Narayanan Krishnamurthy,Andrew K. Martin
#t2003
#cFormal Methods in System Design
#index878783
#%79288
#%133466
#%858229
#%878976
#!
  
#*Bounded Model Checking Using Satisfiability Solving.
#@Edmund M. Clarke,Armin Biere,Richard Raimi,Yunshan Zhu
#t2001
#cFormal Methods in System Design
#index878784
#%71484
#%72072
#%79362
#%79573
#%79725
#%79842
#%79788
#%86935
#%131474
#%131563
#%143032
#%486435
#%546114
#%950130
#%994488
#%1078407
#%1123453
#%1123560
#%1123449
#%3006115
#!
  
#*A New Heuristic for Bad Cycle Detection Using BDDs.
#@R. H. Hardin,Robert P. Kurshan,Sandeep K. Shukla,Moshe Y. Vardi
#t2001
#cFormal Methods in System Design
#index878785
#%79367
#%546462
#%878782
#%1123449
#%3006115
#!
  
#*On the Effective Deployment of Functional Formal Verification.
#@Yael Abarbanel-Vinov,Neta Aizenbud-Reshef,Ilan Beer,Cindy Eisner,Daniel Geist,Tamir Heyman,Iris Reuveni,Eran Rippel,Irit Shitsevalov,Yaron Wolfsthal,Tali Yatzkar-Haham
#t2001
#cFormal Methods in System Design
#index878786
#%79187
#%79450
#%131416
#%132038
#%133768
#%134370
#%283020
#%486435
#%3006115
#!
  
#*Using Integer Programming to Verify General Safety and Liveness Properties.
#@James C. Corbett,George S. Avrunin
#t1995
#cFormal Methods in System Design
#index878787
#% 
#!
  
#*Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
#@Parosh Aziz Abdulla,Aurore Collomb-Annichini,Ahmed Bouajjani,Bengt Jonsson
#t2004
#cFormal Methods in System Design
#index878788
#%79222
#%79246
#%79367
#%79226
#%79422
#%79474
#%79242
#%79795
#%114208
#%114354
#%208708
#%481310
#%555072
#%572637
#%625144
#%886886
#%887432
#%949854
#%1089601
#%1123817
#!
  
#*Multiway Decision Graphs for Automated Hardware Verification.
#@Francisco Corella,Zijian Zhou,Xiaoyu Song,Michel Langevin,Eduard Cerny
#t1997
#cFormal Methods in System Design
#index878789
#%3264
#%79293
#%79623
#%79450
#%86936
#%131262
#%131552
#%134023
#%234366
#%285952
#%546114
#%546850
#%559511
#%629109
#%1078407
#%1078815
#!
  
#*SAT-Solving the Coverability Problem for Petri Nets.
#@Parosh Aziz Abdulla,S. Purushothaman Iyer,Aletta Nylén
#t2004
#cFormal Methods in System Design
#index878790
#%79137
#%79716
#%79668
#%79842
#%212889
#%625208
#%832427
#%878885
#%879007
#%886882
#%1088642
#%1091149
#%1123449
#%3006115
#!
  
#*The Implicit Set Paradigm: A New Approach to Finite State System Verification.
#@Olivier Coudert,Jean Christophe Madre
#t1995
#cFormal Methods in System Design
#index878791
#% 
#!
  
#*Verisym: Verifying Circuits by Symbolic Simulation.
#@William Adams,Warren A. Hunt Jr.,Damir Jamsek
#t2003
#cFormal Methods in System Design
#index878792
#%161
#%131551
#%878976
#%1078407
#!
  
#*Memory-Efficient Algorithms for the Verification of Temporal Properties.
#@Costas Courcoubetis,Moshe Y. Vardi,Pierre Wolper,Mihalis Yannakakis
#t1992
#cFormal Methods in System Design
#index878793
#% 
#!
  
#*Formalization of Fixed-Point Arithmetic in HOL.
#@Behzad Akbarpour,Sofiène Tahar,Abdelkader Dekdouk
#t2005
#cFormal Methods in System Design
#index878794
#%79324
#%142232
#%209216
#%209222
#%209168
#%209236
#%281619
#%286353
#%629614
#%878923
#%878925
#%1127430
#%3004538
#!
  
#*Introduction to the Special Issue on Computer-Aided Verification (CAV93).
#@Costas Courcoubetis
#t1997
#cFormal Methods in System Design
#index878795
#% 
#!
  
#*Partial-Order Reduction in Symbolic State-Space Exploration.
#@Rajeev Alur,Robert K. Brayton,Thomas A. Henzinger,Shaz Qadeer,Sriram K. Rajamani
#t2001
#cFormal Methods in System Design
#index878796
#%79278
#%79716
#%79824
#%131563
#%133905
#%213176
#%484460
#%559533
#%625135
#%887999
#%3006115
#!
  
#*Minimum and Maximum Delay Problems in Real-Time Systems.
#@Costas Courcoubetis,Mihalis Yannakakis
#t1992
#cFormal Methods in System Design
#index878797
#% 
#!
  
#*Computing Accumulated Delays in Real-time Systems.
#@Rajeev Alur,Costas Courcoubetis,Thomas A. Henzinger
#t1997
#cFormal Methods in System Design
#index878798
#%61357
#%79310
#%79363
#%257684
#%268235
#%486435
#%553006
#%559520
#%622287
#%886899
#%949654
#%1088803
#%1088805
#%1127360
#!
  
#*Generating Validation Feedback for Automatic Interpretation of Informal Requirements.
#@Walling R. Cyre,Aniruddha Thakar
#t1997
#cFormal Methods in System Design
#index878799
#%88
#%86937
#%290039
#%489529
#%489923
#%832946
#%890857
#%1074051
#%1078905
#%1112673
#!
  
#*Introduction.
#@Rajeev Alur,Thomas A. Henzinger
#t1999
#cFormal Methods in System Design
#index878800
#% 
#!
  
#*Deriving Correctness Properties of Compiled Code.
#@Paul Curzon
#t1993
#cFormal Methods in System Design
#index878801
#% 
#!
  
#*Introduction.
#@Rajeev Alur,Thomas A. Henzinger
#t1999
#cFormal Methods in System Design
#index878802
#% 
#!
  
#*LSCs: Breathing Life into Message Sequence Charts.
#@Werner Damm,David Harel
#t2001
#cFormal Methods in System Design
#index878803
#%49791
#%79282
#%86833
#%131564
#%212962
#%378364
#%625081
#%625055
#%625385
#%806658
#%979746
#%1056847
#%1071158
#%1074502
#%1128287
#!
  
#*Reactive Modules.
#@Rajeev Alur,Thomas A. Henzinger
#t1999
#cFormal Methods in System Design
#index878804
#%2597
#%79172
#%79170
#%79513
#%79604
#%219992
#%545933
#%625057
#%929625
#%1056640
#%1088628
#%1123234
#%1123560
#%1123695
#%3003862
#%3006115
#!
  
#*Verification of a Radio-Based Signaling System Using the STATEMATE Verification Environment.
#@Werner Damm,Jochen Klose
#t2001
#cFormal Methods in System Design
#index878805
#% 
#!
  
#*Polyhedral Flows in Hybrid Automata.
#@Rajeev Alur,Sampath Kannan,Salvatore La Torre
#t2004
#cFormal Methods in System Design
#index878806
#%79121
#%257609
#%486435
#%886899
#%972199
#%1088803
#%1088805
#%1127360
#%1128403
#!
  
#*Modular Abstractions for Verifying Real-Time Distributed Systems.
#@Hana De-Leon,Orna Grumberg
#t1993
#cFormal Methods in System Design
#index878807
#% 
#!
  
#*Deciding Global Partial-Order Properties.
#@Rajeev Alur,Kenneth L. McMillan,Doron Peled
#t2005
#cFormal Methods in System Design
#index878808
#%79530
#%79824
#%79658
#%79717
#%484462
#%484464
#%544385
#%546462
#%887999
#%888691
#%933260
#%933366
#%1092522
#%1093965
#%3307402
#!
  
#*Constraint-Based Verification of Parameterized Cache Coherence Protocols.
#@Giorgio Delzanno
#t2003
#cFormal Methods in System Design
#index878809
#%79291
#%79387
#%79493
#%79474
#%79256
#%79576
#%79509
#%79728
#%79843
#%86935
#%117240
#%419209
#%484383
#%484375
#%484647
#%484652
#%546269
#%625362
#%832960
#%841423
#%878849
#%878914
#%887555
#%950407
#%1076496
#%1088642
#%1091149
#%1117387
#%1117775
#%1123451
#%1125631
#%3006150
#!
  
#*Modelling IP Mobility.
#@Roberto M. Amadio,Sanjiva Prasad
#t2000
#cFormal Methods in System Design
#index878810
#%114090
#%116392
#%173056
#%188202
#%268861
#%522053
#%588692
#%627565
#%807638
#%888913
#%980736
#%1117507
#%1123830
#%1123872
#%1124330
#%1127399
#!
  
#*Using Hybrid Automata to Support Human Factors Analysis in a Critical System.
#@Gavin J. Doherty,Mieke Massink,Giorgio P. Faconti
#t2001
#cFormal Methods in System Design
#index878811
#%79509
#%362145
#%484790
#%1076496
#!
  
#*Verifying the Implementation of an Error Control Code.
#@Pascalin Amagbégnon,Uri Barkai
#t2003
#cFormal Methods in System Design
#index878812
#%131214
#%858128
#%3006115
#!
  
#*Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394.
#@Marco Devillers,W. O. David Griffioen,Judi Romijn,Frits W. Vaandrager
#t2000
#cFormal Methods in System Design
#index878813
#%79228
#%79481
#%563820
#%626601
#%629332
#%631781
#%888771
#%1129168
#!
  
#*Compositional Checking of Satsfaction.
#@Henrik Reif Andersen,Glynn Winskel
#t1992
#cFormal Methods in System Design
#index878814
#% 
#!
  
#*Specification and Automatic Verification of Self-Timed Queues.
#@David L. Dill,Steven M. Nowick,Robert F. Sproull
#t1992
#cFormal Methods in System Design
#index878815
#% 
#!
  
#*Modeling Multi-rate DSP Specification Semantics for Formal Transformational Design in HOL.
#@Catia M. Angelo,Luc J. M. Claesen,Hugo De Man
#t1994
#cFormal Methods in System Design
#index878816
#% 
#!
  
#*Translating VHDL into Functional Symbolic Finite-State Models.
#@Gert Döhmen,Ronald Herrmann,Hergen Pargmann
#t1995
#cFormal Methods in System Design
#index878817
#% 
#!
  
#*On the Comparison of HOL and Boyer-Moore for Formal Hardware Verification.
#@Catia M. Angelo,Diederik Verkest,Luc J. M. Claesen,Hugo De Man
#t1993
#cFormal Methods in System Design
#index878818
#% 
#!
  
#*Exploiting Object Escape and Locking Information in Partial-Order Reductions for Concurrent Object-Oriented Programs.
#@Matthew B. Dwyer,John Hatcliff,Robby,Venkatesh Prasad Ranganath
#t2004
#cFormal Methods in System Design
#index878819
#%361680
#%471434
#%471884
#%521998
#%538114
#%542327
#%542519
#%542597
#%542560
#%546233
#%601286
#%615587
#%773819
#%1006727
#%1092523
#%1117579
#%1128403
#%3004631
#!
  
#*Gate-Delay-Fault Testability Properties of Multiplexor-Based Networks.
#@Pranav Ashar,Srinivas Devadas,Kurt Keutzer
#t1993
#cFormal Methods in System Design
#index878820
#% 
#!
  
#*Design and Analysis of Delay-Insensitive Modulo- Counters.
#@Jo C. Ebergen,Ad M. G. Peeters
#t1993
#cFormal Methods in System Design
#index878821
#% 
#!
  
#*Experience with Applying Formal Methods to Protocol Specification and System Architecture.
#@Mani Azimi,Ching-Tsun Chou,Akhilesh Kumar,Victor W. Lee,Phanindra K. Mannava,Seungjoon Park
#t2003
#cFormal Methods in System Design
#index878822
#%79662
#%806503
#%858128
#%878976
#%1008311
#%1078407
#%1078814
#%3006115
#!
  
#*The Formal Design of 1M-gate ASICs.
#@Ásgeir Th. Eiríksson
#t2000
#cFormal Methods in System Design
#index878823
#%79400
#%79663
#%79662
#%132036
#%209215
#%419140
#%878976
#!
  
#*Formula-Dependent Equivalence for Compositional CTL Model Checking.
#@Adnan Aziz,Thomas R. Shiple,Vigyan Singhal,Robert K. Brayton,Alberto L. Sangiovanni-Vincentelli
#t2002
#cFormal Methods in System Design
#index878824
#%700
#%79233
#%79376
#%79254
#%114354
#%133905
#%484554
#%1089722
#%1123560
#%1123449
#!
  
#*Symmetry and Model Checking.
#@E. Allen Emerson,A. Prasad Sistla
#t1996
#cFormal Methods in System Design
#index878825
#% 
#!
  
#*Algebraic Decision Diagrams and Their Applications.
#@R. Iris Bahar,Erica A. Frohm,Charles M. Gaona,Gary D. Hachtel,Enrico Macii,Abelardo Pardo,Fabio Somenzi
#t1997
#cFormal Methods in System Design
#index878826
#% 
#!
  
#*Verification of Safety Properties Using Integer Programming: Beyond the State Equation.
#@Javier Esparza,Stephan Melzer
#t2000
#cFormal Methods in System Design
#index878827
#% 
#!
  
#*An Exercise in the Automatic Verification of Asynchronous Designs.
#@Andrew M. Bailey,George A. McCaskill,George J. Milne
#t1994
#cFormal Methods in System Design
#index878828
#% 
#!
  
#*An Improvement of McMillan's Unfolding Algorithm.
#@Javier Esparza,Stefan Römer,Walter Vogler
#t2002
#cFormal Methods in System Design
#index878829
#%3207
#%24913
#%45557
#%79660
#%79658
#%625208
#%740727
#%879007
#%1056701
#%1095101
#!
  
#*An Iterative Approach to Verification of Real-Time Systems.
#@Felice Balarin,Alberto L. Sangiovanni-Vincentelli
#t1995
#cFormal Methods in System Design
#index878830
#% 
#!
  
#*Model Checking for Action-Based Logics.
#@Alessandro Fantechi,Stefania Gnesi,Gioia Ristori
#t1994
#cFormal Methods in System Design
#index878831
#% 
#!
  
#*Logic Based Abstractions of Real-Time Systems.
#@Roberto Barbuti,Nicoletta De Francesco,Antonella Santone,Gigliola Vaglini
#t2000
#cFormal Methods in System Design
#index878832
#%79222
#%79376
#%79347
#%79422
#%79802
#%213235
#%494073
#%559520
#%559594
#%625035
#%626499
#%889007
#%949656
#%971449
#%1123402
#%1123453
#%1123449
#!
  
#*On-the-fly Verification of Finite Transition Systems.
#@Jean-Claude Fernandez,Laurent Mounier,Claude Jard,Thierry Jéron
#t1992
#cFormal Methods in System Design
#index878833
#% 
#!
  
#*Reduced Models for Efficient CCS Verification.
#@Roberto Barbuti,Nicoletta De Francesco,Antonella Santone,Gigliola Vaglini
#t2005
#cFormal Methods in System Design
#index878834
#%79222
#%79233
#%79283
#%79347
#%79422
#%79424
#%79550
#%79716
#%79824
#%114002
#%114161
#%114290
#%208708
#%213148
#%267507
#%793494
#%971449
#%1056588
#%1073460
#%1094767
#%1123402
#%1123453
#%1123449
#%3005514
#!
  
#*Assisting Requirement Formalization by Means of Natural Language Translation.
#@Alessandro Fantechi,Stefania Gnesi,Gioia Ristori,Michele Carenini,Massimo Vanocchi,Paolo Moreschini
#t1994
#cFormal Methods in System Design
#index878835
#% 
#!
  
#*Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking.
#@Sharon Barner,Orna Grumberg
#t2005
#cFormal Methods in System Design
#index878836
#%79187
#%79409
#%79437
#%79450
#%86947
#%131416
#%131489
#%134370
#%283020
#%486435
#%553006
#%627565
#%878873
#%878910
#%1078407
#%1089722
#%1123560
#%1123454
#%1123449
#%1124338
#%3006115
#!
  
#*Bisimulation Minimization and Symbolic Model Checking.
#@Kathi Fisler,Moshe Y. Vardi
#t2002
#cFormal Methods in System Design
#index878837
#%39965
#%79185
#%79376
#%79347
#%79260
#%79262
#%79254
#%79278
#%114428
#%209217
#%209215
#%285641
#%546114
#%622608
#%878921
#%888440
#%950643
#%1060205
#%1091968
#%1123458
#%1123560
#!
  
#*Modeling a Hardware Synthesis Methodology in Isabelle.
#@David A. Basin,Stefan Friedrich
#t1999
#cFormal Methods in System Design
#index878838
#%2355
#%79171
#%86908
#%486578
#%507756
#%625080
#%629113
#%887517
#%950688
#%1123225
#%1128971
#!
  
#*Experiences with Software Specification and Verification Using LP, The Larch Proof Assistant.
#@Manfred Broy
#t1996
#cFormal Methods in System Design
#index878839
#% 
#!
  
#*Better Verification Through Symmetry.
#@C. Norris Ip,David L. Dill
#t1996
#cFormal Methods in System Design
#index878840
#% 
#!
  
#*An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists.
#@Jason Baumgartner,Tamir Heyman,Vigyan Singhal,Adnan Aziz
#t2003
#cFormal Methods in System Design
#index878841
#%79177
#%131416
#%132431
#%283053
#%625239
#%1058933
#%1089722
#%1117750
#%1123560
#%1123449
#%3006115
#!
  
#*Checking Finite Traces Using Alternating Automata.
#@Bernd Finkbeiner,Henny Sipma
#t2004
#cFormal Methods in System Design
#index878842
#%722
#%62076
#%71954
#%484516
#%546503
#%615565
#%615640
#%625157
#%628994
#%878876
#%3005676
#!
  
#*On the Expressive Power of OKFDDs.
#@Bernd Becker,Rolf Drechsler,Michael Theobald
#t1997
#cFormal Methods in System Design
#index878843
#%3670
#%131520
#%131561
#%132003
#%133214
#%134113
#%193919
#%267329
#%283053
#%621136
#%832306
#%887109
#%1078408
#%1078407
#!
  
#*Collecting Statistics Over Runtime Executions.
#@Bernd Finkbeiner,Sriram Sankaranarayanan,Henny Sipma
#t2005
#cFormal Methods in System Design
#index878844
#%62076
#%71954
#%484516
#%546503
#%599280
#%600883
#%615565
#%615640
#%626499
#%628994
#%744687
#%769785
#%878876
#%949951
#%1052994
#%3005676
#!
  
#*Efficient Detection of Vacuity in Temporal Model Checking.
#@Ilan Beer,Shoham Ben-David,Cindy Eisner,Yoav Rodeh
#t2001
#cFormal Methods in System Design
#index878845
#%79524
#%79790
#%114354
#%131416
#%131408
#%131832
#%221128
#%267891
#%268861
#%486435
#%559511
#%1089722
#%3006115
#!
  
#*Verification in Process Algebra of the Distributed Control of Track Vehicles - A Case Study.
#@Siegfried Fischer,Andreas Scholz
#t1994
#cFormal Methods in System Design
#index878846
#% 
#!
  
#*Checking Combinational Equivalence of Speed-Independent Circuits.
#@Peter A. Beerel,Jerry R. Burch,Teresa H. Y. Meng
#t1998
#cFormal Methods in System Design
#index878847
#% 
#!
  
#*A Functional Rephrasing of the Assumption/Commitment Specification Style.
#@Manfred Broy
#t1998
#cFormal Methods in System Design
#index878848
#%310272
#%559564
#%930811
#%1123695
#%3004213
#!
  
#*Verifying Systems with Replicated Components in Mur[b.phiv].
#@C. Norris Ip,David L. Dill
#t1999
#cFormal Methods in System Design
#index878849
#%79128
#%79470
#%79749
#%79471
#%86947
#%86896
#%114246
#%131627
#%134371
#%197225
#%286006
#%542302
#%543808
#%544198
#%614573
#%878995
#%878840
#%878983
#%929768
#%950407
#%1125631
#!
  
#*Verification of Hierarchical State/Event Systems using Reusability and Compositionality.
#@Gerd Behrmann,Kim Guldstrand Larsen,Henrik Reif Andersen,Henrik Hulgaard,Jørn Lind-Nielsen
#t2002
#cFormal Methods in System Design
#index878850
#%2619
#%221120
#%601063
#%625312
#%979746
#%1056847
#%1078407
#%1079860
#%1128753
#%3006352
#!
  
#*Hazard Algebras.
#@Janusz A. Brzozowski,Zoltán Ésik
#t2003
#cFormal Methods in System Design
#index878851
#%55100
#%440733
#!
  
#*PAM: A Process Algebra Manipulator.
#@Huimin Lin
#t1995
#cFormal Methods in System Design
#index878852
#% 
#!
  
#*Model Checking at IBM.
#@Shoham Ben-David,Cindy Eisner,Daniel Geist,Yaron Wolfsthal
#t2003
#cFormal Methods in System Design
#index878853
#%79187
#%79122
#%79151
#%79181
#%79450
#%79788
#%131416
#%132038
#%132266
#%209150
#%234081
#%267891
#%282321
#%450825
#%553006
#%615648
#%878786
#%878845
#!
  
#*Introduction to the Special Issue on Multi-Terminal Binary Decision Diagrams.
#@Masahiro Fujita,Patrick C. McGeer
#t1997
#cFormal Methods in System Design
#index878854
#% 
#!
  
#*Automatic Generation of Invariants.
#@Saddek Bensalem,Yassine Lakhnech
#t1999
#cFormal Methods in System Design
#index878855
#%79226
#%208708
#%360710
#%546057
#%546462
#%553006
#%631825
#%771310
#%773244
#%773613
#%1089421
#%1129168
#%3005676
#!
  
#*Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation.
#@Masahiro Fujita,Patrick C. McGeer,Jerry Chih-Yuan Yang
#t1997
#cFormal Methods in System Design
#index878856
#% 
#!
  
#*Foreword.
#@Albert Benveniste,Axel Poigné
#t2001
#cFormal Methods in System Design
#index878857
#% 
#!
  
#*The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2.
#@Ruben Gamboa
#t2002
#cFormal Methods in System Design
#index878858
#%2022
#%71588
#%209171
#%954829
#%1128581
#!
  
#*Compared Study of Two Correctness Proofs for the Standardized.
#@Béatrice Bérard,Laurent Fribourg,Francis Klay,Jean-François Monin
#t2003
#cFormal Methods in System Design
#index878859
#%79263
#%79645
#%79740
#%79729
#%204301
#%257465
#%257773
#%267213
#%565118
#%621231
#%625169
#%631916
#%833077
#%1088628
#%1088803
#%1094216
#!
  
#*Mod-2-OBDDs - A Data Structure that Generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams.
#@Jordan Gergov,Christoph Meinel
#t1996
#cFormal Methods in System Design
#index878860
#% 
#!
  
#*Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function.
#@Sergey Berezin,Edmund M. Clarke,Armin Biere,Yunshan Zhu
#t2002
#cFormal Methods in System Design
#index878861
#%79532
#%79293
#%79462
#%79523
#%79663
#%79799
#%79768
#%86833
#%209152
#%486435
#%546850
#%878840
#%1078407
#%1123449
#%3006115
#!
  
#*Delay-Insensitivity and Semi-Modularity.
#@Janusz A. Brzozowski,H. Zhang
#t2000
#cFormal Methods in System Design
#index878862
#%879070
#%1089761
#%3004663
#%3003862
#!
  
#*The symbolic OBDD scheme for generating mechanical assembly sequences.
#@Tianlong Gu,Huadong Liu
#t2008
#cFormal Methods in System Design
#index878863
#%477552
#%744654
#%746327
#%832306
#%878912
#%933875
#%1078407
#!
  
#*A Formal Verification Environment for Railway Signaling System Design.
#@Cinzia Bernardeschi,Alessandro Fantechi,Stefania Gnesi,Salvatore Larosa,Giorgio Mongardi,Dario Romano
#t1998
#cFormal Methods in System Design
#index878864
#%2597
#%79283
#%79262
#%79757
#%86725
#%208602
#%208947
#%208967
#%213263
#%268861
#%627565
#%795011
#%878846
#%950643
#%971863
#%1070466
#%1123449
#!
  
#*Formal Design of Cache Memory Protocols in IBM.
#@Steven M. German
#t2003
#cFormal Methods in System Design
#index878865
#%132036
#%213444
#%286006
#%808201
#%832786
#%878823
#%3006115
#!
  
#*An Implementation of Constructive Synchronous Programs in POLIS.
#@Gérard Berry,Ellen Sentovich
#t2000
#cFormal Methods in System Design
#index878866
#%2597
#%66717
#%131360
#%1056510
#%1056847
#!
  
#*Introduction to the Special Issue on Verification of Arithmetic Hardware.
#@Steven M. German
#t1999
#cFormal Methods in System Design
#index878867
#% 
#!
  
#*A Complete Mechanization of Correctness of a String-Preprocessing Algorithm.
#@Milos Besta,Frank A. Stomp
#t2005
#cFormal Methods in System Design
#index878868
#%522
#%690
#%2022
#%71261
#%79421
#%305250
#%770268
#%879004
#%1057178
#%1094773
#%3169345
#!
  
#*A Mechanized Proof Environment for the Convenient Computations Proof Method.
#@Marcelo Glusman,Shmuel Katz
#t2003
#cFormal Methods in System Design
#index878869
#%114639
#%543785
#%552643
#%629372
#%841523
#%1092523
#%1093965
#%1117370
#%1129168
#%1129397
#%3004205
#!
  
#*A Formal Framework for Verification of Embedded Custom Memories of the Motorola MPC7450 Microprocessor.
#@Jayanta Bhadra,Andrew K. Martin,Jacob A. Abraham
#t2005
#cFormal Methods in System Design
#index878870
#%51382
#%79288
#%79833
#%131408
#%133158
#%133466
#%133464
#%134220
#%453735
#%455399
#%508517
#%625426
#%832186
#%858229
#%878976
#%1078407
#!
  
#*Introduction: Special Issue on the Fourth International Workshop of the ERCIM Working Group on Formal Methods for Industrial Critical Systems, Trento, July 11-12, 1999 - Selected Papers.
#@Stefania Gnesi,Diego Latella
#t2001
#cFormal Methods in System Design
#index878871
#% 
#!
  
#*Network Event Recognition.
#@Karthikeyan Bhargavan,Carl A. Gunter
#t2005
#cFormal Methods in System Design
#index878872
#%209718
#%545937
#%588606
#%588830
#%588733
#%615579
#%665057
#%795101
#%1075053
#%1127522
#!
  
#*Another Look at LTL Model Checking.
#@Edmund M. Clarke,Orna Grumberg,Kiyoharu Hamaguchi
#t1997
#cFormal Methods in System Design
#index878873
#%79362
#%86935
#%131520
#%486435
#%546462
#%559568
#%559566
#%951612
#%1078407
#%1123449
#%3006115
#!
  
#*Looped Schedules for Dataflow Descriptions of Multirate Signal Processing Algorithms.
#@Shuvra S. Bhattacharyya,Edward A. Lee
#t1994
#cFormal Methods in System Design
#index878874
#% 
#!
  
#*Verification of the Futurebus+ Cache Coherence Protocol.
#@Edmund M. Clarke,Orna Grumberg,Hiromi Hiraishi,Somesh Jha,David E. Long,Kenneth L. McMillan,Linda A. Ness
#t1995
#cFormal Methods in System Design
#index878875
#% 
#!
  
#*Verifying Temporal Properties of Reactive Systems: A STeP Tutorial.
#@Nikolaj Bjørner,Anca Browne,Michael Colón,Bernd Finkbeiner,Zohar Manna,Henny Sipma,Tomás E. Uribe
#t2000
#cFormal Methods in System Design
#index878876
#%722
#%49779
#%71103
#%79239
#%79224
#%79228
#%79353
#%79530
#%79474
#%79707
#%209144
#%219303
#%257682
#%257836
#%267592
#%486435
#%546076
#%546057
#%553006
#%559603
#%564920
#%625590
#%773613
#%878995
#%951282
#%951597
#%973067
#%1078407
#%1089421
#%1089647
#%1093297
#%1123453
#%1123699
#%3005676
#%3006115
#!
  
#*Special Issue on the First International workshop of the ERCIM Working Group on Formal Methods for Industrial Critical Systems, St. Hugh's College, Oxford, March 19, 1996 - Selected Papers.
#@Stefania Gnesi,Diego Latella
#t1998
#cFormal Methods in System Design
#index878877
#% 
#!
  
#*Reduction and Quantifier Elimination Techniques for Program Validation.
#@Jean-Paul Bodeveix,Mamoun Filali
#t2002
#cFormal Methods in System Design
#index878878
#%722
#%546850
#%575413
#%625165
#%1117387
#!
  
#*Software Model Checking: The VeriSoft Approach.
#@Patrice Godefroid
#t2005
#cFormal Methods in System Design
#index878879
#%73
#%79423
#%79550
#%79455
#%79459
#%79716
#%86935
#%121718
#%208488
#%213074
#%286006
#%361605
#%361680
#%361925
#%362279
#%362216
#%450771
#%450827
#%450899
#%450853
#%450946
#%471884
#%486389
#%538202
#%538221
#%542478
#%546114
#%546233
#%546462
#%548412
#%555145
#%555077
#%601101
#%601177
#%615684
#%615640
#%625036
#%625262
#%776489
#%832306
#%878885
#%878881
#%1092523
#%1123458
#%1123431
#%1123449
#%3006115
#!
  
#*Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs.
#@Bernard Boigelot,Patrice Godefroid
#t1999
#cFormal Methods in System Design
#index878880
#% 
#!
  
#*State-Space Caching Revisited.
#@Patrice Godefroid,Gerard J. Holzmann,Didier Pirottin
#t1995
#cFormal Methods in System Design
#index878881
#% 
#!
  
#*Regrouping Parallel Processes.
#@Tommaso Bolognesi
#t1996
#cFormal Methods in System Design
#index878882
#% 
#!
  
#*Symbolic Protocol Verification with Queue BDDs.
#@Patrice Godefroid,David E. Long
#t1999
#cFormal Methods in System Design
#index878883
#%700
#%79336
#%79410
#%79242
#%79472
#%79471
#%79717
#%86947
#%133216
#%484554
#%484724
#%546114
#%546057
#%625165
#%769785
#%832306
#%887999
#%3001930
#%3003862
#%3006115
#!
  
#*Generality in Design and Compositional Verification Using TAV.
#@Anders Børjesson,Kim Guldstrand Larsen,Arne Skou
#t1995
#cFormal Methods in System Design
#index878884
#% 
#!
  
#*Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.
#@Patrice Godefroid,Pierre Wolper
#t1993
#cFormal Methods in System Design
#index878885
#% 
#!
  
#*Denotational Semantics of a Synchronous VHDL Subset.
#@Dominique Borrione,Ashraf M. Salem
#t1995
#cFormal Methods in System Design
#index878886
#% 
#!
  
#*Connectivity Testing.
#@Jens Chr. Godskesen
#t2004
#cFormal Methods in System Design
#index878887
#%2022
#%213356
#%221037
#%625312
#%1078407
#%3004693
#!
  
#*Lazy Techniques for Fully Expansive Theorem Proving.
#@Richard J. Boulton
#t1993
#cFormal Methods in System Design
#index878888
#% 
#!
  
#*BDD Based Procedures for a Theory of Equality with Uninterpreted Functions.
#@Anuj Goel,Khurram Sajid,Hai Zhou,Adnan Aziz,Vigyan Singhal
#t2003
#cFormal Methods in System Design
#index878889
#%2022
#%79289
#%79318
#%79293
#%79278
#%131553
#%132802
#%134160
#%209144
#%209242
#%282391
#%283053
#%818414
#%951595
#%1071740
#%1078407
#!
  
#*Forward Analysis of Updatable Timed Automata.
#@Patricia Bouyer
#t2004
#cFormal Methods in System Design
#index878890
#%79166
#%79263
#%79338
#%114066
#%114146
#%178524
#%221167
#%268234
#%268236
#%564110
#%565118
#%564996
#%619958
#%625156
#%879072
#%879036
#%881409
#%953766
#%1088805
#!
  
#*Mechanically Verifying Safety and Liveness Properties of Delay Insensitive Circuits.
#@David M. Goldschlag
#t1994
#cFormal Methods in System Design
#index878891
#% 
#!
  
#*Mexitl: Multimedia in Executable Interval Temporal Logic.
#@Howard Bowman,Helen Cameron,Peter R. King,Simon J. Thompson
#t2003
#cFormal Methods in System Design
#index878892
#% 
#!
  
#*Industrial Practice of Formal Hardware Verification: A Sampling.
#@Ganesh Gopalakrishnan,Warren A. Hunt Jr.
#t2003
#cFormal Methods in System Design
#index878893
#% 
#!
  
#*A Formal Framework for Viewpoint Consistency.
#@Howard Bowman,Maarten Steen,Eerke A. Boiten,John Derrick
#t2002
#cFormal Methods in System Design
#index878894
#%2597
#%208492
#%208490
#%209604
#%212931
#%213204
#%486468
#%555083
#%555193
#%676603
#%676700
#%793494
#%794660
#%1056592
#%1124242
#%1124404
#!
  
#*Verifying the SRT Division Algorithm Using Theorem Proving Techniques.
#@Edmund M. Clarke,Steven M. German,Xudong Zhao
#t1999
#cFormal Methods in System Design
#index878895
#%794
#%79341
#%79740
#%626665
#%629127
#%629386
#%878946
#%879050
#%951594
#!
  
#*Experimental Evaluation of Verification and Validation Tools on Martian Rover Software.
#@Guillaume P. Brat,Doron Drusinsky,Dimitra Giannakopoulou,Allen Goldberg,Klaus Havelund,Michael R. Lowry,Corina S. Pasareanu,Arnaud Venet,Willem Visser,Richard Washington
#t2004
#cFormal Methods in System Design
#index878896
#%363384
#%471884
#%615640
#%761051
#%1117579
#%1124306
#%1127849
#%450785
#!
  
#*Introduction: Formal Methods for CAD: Enabling Technologies and System-level Applications.
#@Ganesh Gopalakrishnan
#t2000
#cFormal Methods in System Design
#index878897
#% 
#!
  
#*A Simple Denotational Semantics, Proof Theory and a Validation Condition Generator for Unit-Delay VHDL.
#@Peter T. Breuer,Luis Sánchez Fernández,Carlos Delgado Kloos
#t1995
#cFormal Methods in System Design
#index878898
#% 
#!
  
#*Modular and Visual Specification of Hybrid Systems: An Introduction to HyCharts.
#@Radu Grosu,Thomas Stauner
#t2002
#cFormal Methods in System Design
#index878899
#%24983
#%49784
#%114070
#%188346
#%221126
#%221042
#%221092
#%257443
#%257766
#%257961
#%671299
#%1056847
#%1088803
#%1088805
#%3006352
#!
  
#*The DUAL-EVAL Hardware Description Language and Its Use in the Formal Specification and Verification of the FM9001 Microprocessor.
#@Bishop Brock,Warren A. Hunt Jr.
#t1997
#cFormal Methods in System Design
#index878900
#%3264
#%79840
#%451001
#%629106
#%954688
#%954800
#%955161
#%1071740
#%1082670
#%3006115
#!
  
#*Hiding Propositional Constants in BDDs.
#@Jan Friso Groote
#t1996
#cFormal Methods in System Design
#index878901
#% 
#!
  
#*Using Fixed-Point Semantics to Prove Retiming Lemmas.
#@Stephen D. Brookes
#t1993
#cFormal Methods in System Design
#index878902
#% 
#!
  
#*Hierarchical Reachability Graph Generation for Petri Nets.
#@Peter Buchholz,Peter Kemper
#t2002
#cFormal Methods in System Design
#index878903
#%45034
#%45177
#%45011
#%45463
#%45380
#%45557
#%45169
#%45591
#%45635
#%45478
#%79844
#%555073
#%555071
#%625007
#%878885
#%1063888
#%1090109
#%1123458
#%1123449
#%1127677
#%1127643
#%1129128
#%3005514
#!
  
#*Introduction: Special Issue on CAV '97.
#@Orna Grumberg
#t2001
#cFormal Methods in System Design
#index878904
#% 
#!
  
#*Rule-Based Induction.
#@Holger Busch
#t1994
#cFormal Methods in System Design
#index878905
#% 
#!
  
#*Distributed Symbolic Model Checking for µ-Calculus.
#@Orna Grumberg,Tamir Heyman,Assaf Schuster
#t2005
#cFormal Methods in System Design
#index878906
#% 
#!
  
#*The General Product Machine: a New Model for Symbolic FSM Traversal.
#@Gianpiero Cabodi,Paolo Camurati,Fulvio Corno,Paolo Prinetto,Matteo Sonza Reorda
#t1998
#cFormal Methods in System Design
#index878907
#%131520
#%131563
#%131573
#%131802
#%134302
#%1078407
#!
  
#*Formal Hardware Verification Methods: A Survey.
#@Aarti Gupta
#t1992
#cFormal Methods in System Design
#index878908
#% 
#!
  
#*Formal Methods Technology Transfer: A View from NASA.
#@James L. Caldwell
#t1998
#cFormal Methods in System Design
#index878909
#%25448
#%209039
#%209154
#%220349
#%221136
#%565711
#%629104
#%1129168
#%3006979
#!
  
#*On-the-Fly Model Checking Under Fairness that Exploits Symmetry.
#@Viktor Gyuris,A. Prasad Sistla
#t1999
#cFormal Methods in System Design
#index878910
#%73
#%2022
#%79336
#%79376
#%79410
#%79409
#%79530
#%86947
#%484459
#%490808
#!
  
#*Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System.
#@Sérgio Vale Aguiar Campos,Edmund M. Clarke,Orna Grumberg
#t2000
#cFormal Methods in System Design
#index878911
#%220230
#%285804
#%485244
#%486393
#%486435
#%546462
#%559553
#%559531
#%565099
#%565132
#%878873
#%1078407
#%1123449
#!
  
#*A Symbolic Algorithms for Maximum Flow in 0-1 Networks.
#@Gary D. Hachtel,Fabio Somenzi
#t1997
#cFormal Methods in System Design
#index878912
#%707
#%2022
#%2616
#%131520
#%282223
#%285903
#%286413
#%454002
#%1078407
#!
  
#*Efficient Verification of Sequential and Concurrent C Programs.
#@Sagar Chaki,Edmund M. Clarke,Alex Groce,Joël Ouaknine,Ofer Strichman,Karen Yorav
#t2004
#cFormal Methods in System Design
#index878913
#%2597
#%79224
#%79353
#%79338
#%79339
#%79474
#%79692
#%79662
#%282266
#%361599
#%361680
#%361842
#%362779
#%486435
#%542317
#%546304
#%546057
#%615550
#%625357
#%625301
#%646790
#%772823
#%1060205
#%1123453
#%1123449
#%1127717
#!
  
#*Verification of Real-Time Systems using Linear Relation Analysis.
#@Nicolas Halbwachs,Yann-Erick Proy,Patrick Roumanoff
#t1997
#cFormal Methods in System Design
#index878914
#%40075
#%79384
#%79493
#%114466
#%257465
#%257684
#%543125
#%546076
#%546057
#%559512
#%559529
#%740903
#%886899
#%984357
#%1088803
#%1117534
#!
  
#*An Experiment in Program Composition and Proof.
#@K. Mani Chandy,Michel Charpentier
#t2002
#cFormal Methods in System Design
#index878915
#%208570
#%408467
#%833077
#%1056670
#%1123560
#%1123699
#!
  
#*An Embedding of Timed Transition Systems in HOL.
#@Roger Hale,Rachel Cardell-Oliver,John Herbert
#t1993
#cFormal Methods in System Design
#index878916
#% 
#!
  
#*A Model for Synchronous Switching Circuits and its Theory of Correctness.
#@Zhou Chaochen,C. A. R. Hoare
#t1992
#cFormal Methods in System Design
#index878917
#% 
#!
  
#*Reasoning About Analog-Level Implementations of Digital Systems.
#@F. Keith Hanna
#t2000
#cFormal Methods in System Design
#index878918
#% 
#!
  
#*Editorial.
#@Edmund M. Clarke
#t1997
#cFormal Methods in System Design
#index878919
#% 
#!
  
#*A Formal Approach to Reactive Systems Software: A Telecommunications Application in ESTEREL.
#@Lalita Jategaonkar Jagadeesan,Carlos Puchol,James Von Olnhausen
#t1996
#cFormal Methods in System Design
#index878920
#% 
#!
  
#*Exploiting Symmetry in Temporal Logic Model Checking.
#@Edmund M. Clarke,Somesh Jha,Reinhard Enders,Thomas Filkorn
#t1996
#cFormal Methods in System Design
#index878921
#% 
#!
  
#*Verifying the Summit Bus Converter Protocols with Symbolic Model Checking.
#@Cheryl Harkness,Elizabeth Wolf
#t1994
#cFormal Methods in System Design
#index878922
#% 
#!
  
#*Floating Point Verification in HOL Light: The Exponential Function.
#@John Harrison
#t2000
#cFormal Methods in System Design
#index878923
#%17869
#%209171
#%209238
#%209168
#%219845
#%626665
#%629429
#%629421
#%771172
#%832535
#%950053
#%951013
#%1127430
#%2871018
#%3005071
#!
  
#*Formal Verification of Square Root Algorithms.
#@John Harrison
#t2003
#cFormal Methods in System Design
#index878924
#%209222
#%209238
#%209236
#%629429
#%890629
#%3005071
#!
  
#*Constructing the Real Numbers in HOL.
#@John Harrison
#t1994
#cFormal Methods in System Design
#index878925
#% 
#!
  
#*Foreword - Selected Papers from the First International Workshop on Runtime Verification held in Paris, July 2001 (RV'01).
#@Klaus Havelund,Grigore Rosu
#t2004
#cFormal Methods in System Design
#index878926
#% 
#!
  
#*An Overview of the Runtime Verification Tool Java PathExplorer.
#@Klaus Havelund,Grigore Rosu
#t2004
#cFormal Methods in System Design
#index878927
#%361680
#%362216
#%471498
#%471521
#%471884
#%546233
#%615565
#%615563
#%615684
#%615640
#%625096
#%625157
#%651561
#%761051
#%1078407
#%1117579
#%3005676
#!
  
#*Foreword.
#@Klaus Havelund,Grigore Rosu
#t2005
#cFormal Methods in System Design
#index878928
#% 
#!
  
#*From Pre-Historic to Post-Modern Symbolic Model Checking.
#@Thomas A. Henzinger,Orna Kupferman,Shaz Qadeer
#t2003
#cFormal Methods in System Design
#index878929
#% 
#!
  
#*A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits.
#@Tamir Heyman,Daniel Geist,Orna Grumberg,Assaf Schuster
#t2002
#cFormal Methods in System Design
#index878930
#%79187
#%79362
#%79437
#%131416
#%133997
#%281791
#%282871
#%285766
#%286666
#%1078407
#%3006115
#!
  
#*An Environment for Formal Verification Based on Symbolic Computations.
#@Ramin Hojati,Robert K. Brayton
#t1995
#cFormal Methods in System Design
#index878931
#% 
#!
  
#*An Analysis of Bitstate Hashing.
#@Gerard J. Holzmann
#t1998
#cFormal Methods in System Design
#index878932
#%79457
#%79844
#%86897
#%213174
#%213444
#%555075
#%555071
#%1074288
#%1128403
#!
  
#*Formal Verification of a Complex Pipelined Processor.
#@Ravi Hosabettu,Ganesh Gopalakrishnan,Mandayam K. Srivas
#t2003
#cFormal Methods in System Design
#index878933
#%2355
#%79228
#%79532
#%79293
#%79531
#%79711
#%79663
#%79831
#%79768
#%79767
#%209121
#%209152
#%209200
#%878861
#%1071740
#%1129168
#%209118
#!
  
#*Bounded Delay Timing Analysis of a Class of CSP Programs.
#@Henrik Hulgaard,Steven M. Burns
#t1997
#cFormal Methods in System Design
#index878934
#%45678
#%79493
#%79658
#%131255
#%282348
#%286512
#%555075
#%559518
#%878797
#%1078396
#%1078407
#%1079836
#%1127508
#!
  
#*Introduction: Special Issue on Microprocessor Verifications.
#@Warren A. Hunt Jr.
#t2002
#cFormal Methods in System Design
#index878935
#% 
#!
  
#*Automatic Verification of Distributed Systems: The Process Algebra Approach.
#@Paola Inverardi,Corrado Priami
#t1996
#cFormal Methods in System Design
#index878936
#% 
#!
  
#*Translating Java for Multiple Model Checkers: The Bandera Back-End.
#@Radu Iosif,Matthew B. Dwyer,John Hatcliff
#t2005
#cFormal Methods in System Design
#index878937
#%2348
#%3048
#%71766
#%77273
#%79168
#%79267
#%79330
#%172840
#%213178
#%213176
#%361680
#%361842
#%361681
#%361839
#%361763
#%471585
#%471884
#%538114
#%546304
#%546233
#%546853
#%572742
#%601317
#%615589
#%615641
#%615548
#%615646
#%615684
#%625357
#%950446
#%1006727
#%1073884
#%1128403
#!
  
#*A Notation and Logic for Mobile Computing.
#@Gruia-Catalin Roman,Peter J. McCann
#t2002
#cFormal Methods in System Design
#index878938
#%116392
#%173888
#%188202
#%559512
#%613377
#%772823
#%772992
#%806417
#%1124330
#%1128902
#!
  
#*Probabilistic Verification of Boolean Functions.
#@Jawahar Jain,Jacob A. Abraham,James R. Bitner,Donald S. Fussell
#t1992
#cFormal Methods in System Design
#index878939
#% 
#!
  
#*A Timed Verification of the IEEE 1394 Leader Election Protocol.
#@Judi Romijn
#t2001
#cFormal Methods in System Design
#index878940
#%79481
#%257834
#%268068
#%544255
#%563820
#%878813
#%888771
#%888772
#%1025778
#%1057136
#%1090401
#%1129168
#%3005676
#!
  
#*Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems.
#@Bertrand Jeannet
#t2003
#cFormal Methods in System Design
#index878941
#%40075
#%79129
#%79224
#%79228
#%79353
#%79338
#%79384
#%79262
#%79474
#%79242
#%79794
#%79853
#%114068
#%221152
#%543125
#%546062
#%546076
#%546057
#%565132
#%565271
#%878914
#%1056588
#%1056843
#%1088803
#%1089421
#%3003225
#!
  
#*Description of a Design Management System for the P-ASIC Design Flow Using EXPDL.
#@W. M. H. M. Rovers
#t1994
#cFormal Methods in System Design
#index878942
#% 
#!
  
#*Condensed State Spaces for Symmetrical Coloured Petri Nets.
#@Kurt Jensen
#t1996
#cFormal Methods in System Design
#index878943
#% 
#!
  
#*Auto/Autograph.
#@Valérie Roy,Robert de Simone
#t1992
#cFormal Methods in System Design
#index878944
#% 
#!
  
#*Accommodating Interference in the Formal Design of Concurrent Object-Based Programs.
#@Cliff B. Jones
#t1996
#cFormal Methods in System Design
#index878945
#% 
#!
  
#*Modular Verification of SRT Division.
#@Harald Rueß,Natarajan Shankar,Mandayam K. Srivas
#t1999
#cFormal Methods in System Design
#index878946
#%79341
#%79571
#%79572
#%79760
#%131553
#%131550
#%209187
#%209212
#%209168
#%286353
#%625352
#%626665
#%629109
#%878954
#%879050
#%951594
#%1081143
#%1129168
#!
  
#*Formal Verification of Out-of-Order Execution with Incremental Flushing.
#@Robert B. Jones,Jens U. Skakkebæk,David L. Dill
#t2002
#cFormal Methods in System Design
#index878947
#%79532
#%79293
#%79531
#%79663
#%79799
#%79767
#%86833
#%131562
#%209121
#%209152
#%209144
#%209119
#%209259
#%282391
#%1088628
#!
  
#*Symbolic Verification and Analysis of Discrete Timed Systems.
#@Jürgen Ruf,Thomas Kropf
#t2003
#cFormal Methods in System Design
#index878948
#%700
#%79301
#%86873
#%131835
#%209208
#%209214
#%213512
#%257509
#%564609
#%629116
#%886899
#%1052994
#%1066189
#%1078407
#%281624
#!
  
#*Checking Cache-Coherence Protocols with TLA.
#@Rajeev Joshi,Leslie Lamport,John Matthews,Serdar Tasiran,Mark R. Tuttle,Yuan Yu
#t2003
#cFormal Methods in System Design
#index878949
#%1123699
#!
  
#*Generating Model Checkers from Algebraic Specifications.
#@Teodor Rus,Eric Van Wyk,Tom Halverson
#t2002
#cFormal Methods in System Design
#index878950
#%714
#%722
#%725
#%697
#%40195
#%49810
#%79406
#%546548
#%559596
#%769689
#%792482
#%971863
#%1078407
#%1093031
#%1123449
#%1128751
#%3003349
#%3003854
#%3006115
#!
  
#*Annotations in Formal Specifications and Proofs.
#@Saraswati Kalvala
#t1994
#cFormal Methods in System Design
#index878951
#% 
#!
  
#*A Formalization of a Subset of VHDL in the Boyer-Moore Logic.
#@David M. Russinoff
#t1995
#cFormal Methods in System Design
#index878952
#% 
#!
  
#*Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory.
#@Deepak Kapur,Mahadevan Subramaniam
#t1998
#cFormal Methods in System Design
#index878953
#% 
#!
  
#*A Mechanically Checked Proof of Correctness of the AMD K5 Floating Point Square Root Microcode.
#@David M. Russinoff
#t1999
#cFormal Methods in System Design
#index878954
#%79760
#%209168
#%286353
#%629421
#!
  
#*jContractor: Introducing Design-by-Contract to Java Using Reflective Bytecode Instrumentation.
#@Murat Karaorman,Parker Abercrombie
#t2005
#cFormal Methods in System Design
#index878955
#%2612
#%2608
#%47562
#%255386
#%683882
#%683939
#%772269
#%772823
#!
  
#*The Use of the B Formal Method for the Design and the Validation of the Transaction Mechanism for Smart Card Applications.
#@Denis Sabatier,Pierre Lartigue
#t2000
#cFormal Methods in System Design
#index878956
#%61908
#%61914
#!
  
#*Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics.
#@T. Karvi,Tienari Tienari,Roope Kaivola
#t2005
#cFormal Methods in System Design
#index878957
#%73
#%61354
#%61355
#%79422
#%114259
#%544131
#%555029
#%555004
#%555211
#%793494
#%841253
#%886928
#%889723
#%934307
#%950642
#%1060205
#%3005514
#!
  
#*Verification of FM9801: An Out-of-Order Microprocessor Model with Speculative Execution, Exceptions, and Program-Modifying Capability.
#@Jun Sawada,Warren A. Hunt Jr.
#t2002
#cFormal Methods in System Design
#index878958
#%706
#%79532
#%79513
#%79293
#%79663
#%79799
#%79768
#%79767
#%86833
#%131562
#%209152
#%209224
#%209256
#%282391
#%629133
#%1088628
#!
  
#*A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions.
#@Joost-Pieter Katoen,Rom Langerak,Ed Brinksma,Diego Latella,Tommaso Bolognesi
#t1998
#cFormal Methods in System Design
#index878959
#% 
#!
  
#*Using Transformations and Verification in Circuit Design.
#@James B. Saxe,James J. Horning,John V. Guttag,Stephen J. Garland
#t1993
#cFormal Methods in System Design
#index878960
#% 
#!
  
#*Saving Space by Fully Exploiting Invisible Transitions.
#@Shmuel Katz,Hillel Miller
#t1999
#cFormal Methods in System Design
#index878961
#%61363
#%79457
#%79844
#%213176
#%546462
#%879042
#%887999
#%1074288
#%1092523
#!
  
#*Model-Checking with Coverability Graphs.
#@Karsten Schmidt
#t1999
#cFormal Methods in System Design
#index878962
#%45103
#%889617
#!
  
#*Polynomial Formal Verification of Multipliers.
#@Martin Keim,Rolf Drechsler,Bernd Becker,Michael Martin,Paul Molitor
#t2003
#cFormal Methods in System Design
#index878963
#%131553
#%131564
#%131344
#%281808
#%281962
#%282229
#%832306
#%1078408
#%1078407
#!
  
#*Accelerating Tableaux Proofs Using Compact Representations.
#@Klaus Schneider,Ramayya Kumar,Thomas Kropf
#t1994
#cFormal Methods in System Design
#index878964
#% 
#!
  
#*Merging Behavior Specifications.
#@Ferhat Khendek,Gregor von Bochmann
#t1995
#cFormal Methods in System Design
#index878965
#% 
#!
  
#*On WLCDs and the Complexity of Word-Level Decision Diagrams-A Lower Bound for Division.
#@Christoph Scholl,Bernd Becker,Thomas M. Weis
#t2002
#cFormal Methods in System Design
#index878966
#%79818
#%131553
#%132003
#%131835
#%132851
#%281808
#%281777
#%281962
#%283096
#%620887
#%1078408
#%1078407
#%281624
#!
  
#*Java-MaC: A Run-Time Assurance Approach for Java Programs.
#@Moonzoo Kim,Mahesh Viswanathan,Sampath Kannan,Insup Lee,Oleg Sokolsky
#t2004
#cFormal Methods in System Design
#index878967
#%79456
#%361680
#%471884
#%564001
#%564003
#%565371
#%615640
#%832427
#%1127522
#%1129188
#!
  
#*A Comparative Study of Synthesis Methods for Discrete Event Controllers.
#@Luz E. Pinzon,Hans-Michael Hanisch,Mohsen A. Jafari,T. Boucher
#t1999
#cFormal Methods in System Design
#index878968
#%3048
#%1123449
#%3354188
#!
  
#*Analysis and Identification of Speed-Independent Circuits on an Event Model.
#@Michael Kishinevsky,Alex Kondratyev,Alexander Taubin,Victor Varshavsky
#t1994
#cFormal Methods in System Design
#index878969
#% 
#!
  
#*The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours.
#@Olaf Schröer,Ingo Wegener
#t1998
#cFormal Methods in System Design
#index878970
#%131520
#%131553
#%132851
#%133215
#%133214
#%133216
#%836501
#%837453
#%887109
#%933875
#%1078407
#%1079379
#%1080535
#%1082618
#%281624
#!
  
#*Analysis of an Industrial System.
#@J. J. T. Kleijn,Michel A. Reniers,J. E. Rooda
#t2003
#cFormal Methods in System Design
#index878971
#%2597
#%40059
#%71766
#%208715
#%613017
#%984464
#%1091260
#!
  
#*Verifying Time Partitioning in the DEOS Scheduling Kernel.
#@John Penix,Willem Visser,Seungjoon Park,Corina S. Pasareanu,Eric Engstrom,Aaron Larson,Nicholas Weininger
#t2005
#cFormal Methods in System Design
#index878972
#%62076
#%79353
#%79339
#%79474
#%209739
#%212902
#%361601
#%361680
#%361842
#%361733
#%362776
#%362905
#%450855
#%450860
#%450995
#%471808
#%471884
#%530329
#%542540
#%543125
#%546304
#%546233
#%553006
#%601061
#%601286
#%601187
#%615582
#%615579
#%615548
#%615684
#%625096
#%625098
#%625357
#%625420
#%979746
#%1073884
#%1123449
#%1127308
#%1127719
#%1128364
#%1128404
#%1128403
#%3006115
#%450785
#!
  
#*Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings.
#@Alex Kondratyev,Michael Kishinevsky,Alexander Taubin,Sergei Ten
#t1998
#cFormal Methods in System Design
#index878973
#%45557
#%45591
#%45678
#%79455
#%282006
#%626501
#%879007
#!
  
#*Extended BDDs: Trading off Canonicity for Structure in Verification Algorithms.
#@Bernard Plessier,Gary D. Hachtel,Fabio Somenzi
#t1994
#cFormal Methods in System Design
#index878974
#% 
#!
  
#*A Suite of Tools for Debugging Distributed Autonomous Systems.
#@David Kortenkamp,Reid G. Simmons,Tod Milam,Joaquín Lopez Fernández
#t2004
#cFormal Methods in System Design
#index878975
#%434845
#%450944
#%552637
#%745561
#%747405
#%1053124
#%1070963
#%1079860
#%1128487
#!
  
#*Formal Verification by Symbolic Evaluation of Partially-Ordered Trajectories.
#@Carl-Johan H. Seger,Randal E. Bryant
#t1995
#cFormal Methods in System Design
#index878976
#% 
#!
  
#*Structuring and Automating Hardware Proofs in a Higher-Order Theorem-Proving Environment.
#@Ramayya Kumar,Klaus Schneider,Thomas Kropf
#t1993
#cFormal Methods in System Design
#index878977
#% 
#!
  
#*The T-Ruby Design System.
#@Robin Sharp,Ole Rasmussen
#t1997
#cFormal Methods in System Design
#index878978
#%71827
#%86955
#%86961
#%86939
#%203190
#%629107
#%629562
#!
  
#*Model Checking of Safety Properties.
#@Orna Kupferman,Moshe Y. Vardi
#t2001
#cFormal Methods in System Design
#index878979
#%700
#%62076
#%79122
#%79460
#%79668
#%79825
#%79658
#%79862
#%131474
#%132996
#%267507
#%282317
#%283020
#%451411
#%484908
#%486435
#%546462
#%553006
#%555036
#%878793
#%889644
#%949951
#%950948
#%951612
#%973067
#%1123449
#%1123800
#%3006516
#!
  
#*Guest Editorial.
#@Natasha Sharygina
#t2004
#cFormal Methods in System Design
#index878980
#% 
#!
  
#*Combining Software and Hardware Verification Techniques.
#@Robert P. Kurshan,Vladimir Levin,Marius Minea,Doron Peled,Hüsnü Yenigün
#t2002
#cFormal Methods in System Design
#index878981
#%79158
#%79459
#%79604
#%79824
#%202280
#%213176
#%625298
#%625135
#%930979
#%933366
#%1128403
#%3003862
#%3006115
#!
  
#*Lessons Learned from Model Checking a NASA Robot Controller.
#@Natasha Sharygina,James C. Browne,Fei Xie,Robert P. Kurshan,Vladimir Levin
#t2004
#cFormal Methods in System Design
#index878982
#%79474
#%79692
#%79663
#%79662
#%202300
#%202280
#%219992
#%361599
#%361680
#%484460
#%546304
#%625298
#%878995
#%1117615
#%1123234
#%1127717
#%3004698
#%3006115
#!
  
#*A Structural Linearization Principle for Processes.
#@Robert P. Kurshan,Michael Merritt,Ariel Orda,Sonia R. Sachs
#t1994
#cFormal Methods in System Design
#index878983
#% 
#!
  
#*A Tutorial on Stålmarck's Proof Procedure for Propositional Logic.
#@Mary Sheeran,Gunnar Stålmarck
#t2000
#cFormal Methods in System Design
#index878984
#% 
#!
  
#*Modelling Asynchrony with a Synchronous Model.
#@Robert P. Kurshan,Michael Merritt,Ariel Orda,Sonia R. Sachs
#t1999
#cFormal Methods in System Design
#index878985
#%2597
#%544255
#%879019
#%3006115
#!
  
#*A Comparison of Free BDDs and Transformed BDDs.
#@Detlef Sieling,Ingo Wegener
#t2001
#cFormal Methods in System Design
#index878986
#%131447
#%133193
#%283053
#%879009
#%1078408
#%1078407
#%1079379
#%1196767
#%1196701
#!
  
#*Model-Based Verification of a Security Protocol for Conditional Access to Services.
#@Guy Leduc,Olivier Bonaventure,Luc Léonard,E. Koerner,Charles Pecheur
#t1999
#cFormal Methods in System Design
#index878987
#%2597
#%51095
#%79247
#%79422
#%83856
#%83732
#%193104
#%213061
#%625318
#%775450
#%793494
#%932661
#%1076169
#%1117452
#!
  
#*The Synchronous Approach to Designing Reactive Systems.
#@Axel Poigné,Matthew Morley,Olivier Maffeïs,Leszek Holenderski,Reinhard Budde
#t1998
#cFormal Methods in System Design
#index878988
#%79278
#%114466
#%219368
#%221103
#%479455
#%486435
#%878920
#%1056510
#%1056847
#%1093506
#%1128289
#%3006115
#!
  
#*Verification of Large State/Event Systems Using Compositionality and Dependency Analysis.
#@Jørn Lind-Nielsen,Henrik Reif Andersen,Henrik Hulgaard,Gerd Behrmann,Kåre J. Kristoffersen,Kim Guldstrand Larsen
#t2001
#cFormal Methods in System Design
#index878989
#%79362
#%79123
#%79450
#%282637
#%484554
#%601068
#%625067
#%626586
#%1056847
#%1078407
#%1123453
#%1128753
#%3006115
#!
  
#*A Constructive Approach to Hardware/Software Partitioning.
#@Leila Silva,Augusto Sampaio,Edna Barros
#t2004
#cFormal Methods in System Design
#index878990
#%86794
#%106052
#%208963
#%282305
#%645945
#%1094271
#%1117821
#%3003879
#!
  
#*Verification of a Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic.
#@Paul Loewenstein
#t1992
#cFormal Methods in System Design
#index878991
#% 
#!
  
#*True Concurrency in Models of Asynchronous Circuit Behavior.
#@Signe J. Silver,Janusz A. Brzozowski
#t2003
#cFormal Methods in System Design
#index878992
#%706
#%2597
#%79732
#%79733
#%114212
#%114327
#%114366
#%530053
#%741014
#%878862
#%879070
#%1089372
#%1089761
#%1090423
#%3003862
#%3307402
#!
  
#*A Formal Theory of Simulations between Infinite Automata.
#@Paul Loewenstein
#t1993
#cFormal Methods in System Design
#index878993
#% 
#!
  
#*Verification of the MultiStream Potocol (MSP) Using COSPAN.
#@Thomas F. La Porta,Mischa Schwartz
#t1994
#cFormal Methods in System Design
#index878994
#% 
#!
  
#*Property Preserving Abstractions for the Verification of Concurrent Systems.
#@Claire Loiseaux,Susanne Graf,Joseph Sifakis,Ahmed Bouajjani,Saddek Bensalem
#t1995
#cFormal Methods in System Design
#index878995
#% 
#!
  
#*Deductive Model Checking.
#@Henny Sipma,Tomás E. Uribe,Zohar Manna
#t1999
#cFormal Methods in System Design
#index878996
#%51378
#%71103
#%79239
#%79154
#%79376
#%79386
#%79474
#%79254
#%79575
#%79536
#%79601
#%79740
#%79707
#%79729
#%79794
#%79802
#%219303
#%268545
#%484459
#%486435
#%546057
#%546346
#%553006
#%625047
#%625590
#%773613
#%878995
#%1078407
#%1089421
#%1093297
#%1123402
#%3005676
#%3005872
#%3006115
#%285829
#!
  
#*Automated Correctness Condition Generation for Formal Verification of Synthesized RTL Designs.
#@Nazanin Mansouri,Ranga Vemuri
#t2000
#cFormal Methods in System Design
#index878997
#% 
#!
  
#*Stubborn Sets for Real-Time Petri Nets.
#@Robert H. Sloan,Ugo A. Buy
#t1997
#cFormal Methods in System Design
#index878998
#%79824
#%79858
#%450857
#%450815
#%466523
#%1124306
#%1127508
#%1129108
#!
  
#*The Incorporation of Testing into Formal Verification: Direct, Modular, and Hierarchical Correctness Degrees.
#@Leo Marcus
#t1996
#cFormal Methods in System Design
#index878999
#% 
#!
  
#*Specification, Refinement and Verification of Concurrent Systems-An Integration of Object-Z and CSP.
#@Graeme Smith,John Derrick
#t2001
#cFormal Methods in System Design
#index879000
#% 
#!
  
#*Asynchronous Datapaths and the Design of an Asynchronous Adder.
#@Alain J. Martin
#t1992
#cFormal Methods in System Design
#index879001
#% 
#!
  
#*Correct Compilation of Specifications to Deterministic Asynchronous Circuits.
#@Scott F. Smith,Amy E. Zwarico
#t1995
#cFormal Methods in System Design
#index879002
#% 
#!
  
#*On Deducing Timing Constraints in the Verification of Interfaces.
#@Farhad Mavaddat,T. Gahlinger
#t1998
#cFormal Methods in System Design
#index879003
#%286512
#%3418259
#!
  
#*Applying Formal Verification to the AAMP5 Microprocessor: A Case Study in the Industrial Use of Formal Methods.
#@Mandayam K. Srivas,Steven P. Miller
#t1996
#cFormal Methods in System Design
#index879004
#% 
#!
  
#*Formal Analysis of Correctness of Behavioral Transformations.
#@Michael C. McFarland
#t1993
#cFormal Methods in System Design
#index879005
#% 
#!
  
#*Non-Abelian Groups in Optimization of Decision Diagrams Representations of Discrete Functions.
#@Radomir S. Stankovic
#t2001
#cFormal Methods in System Design
#index879006
#%132003
#%440875
#%441294
#%1078407
#!
  
#*A Technique of State Space Search Based on Unfolding.
#@Kenneth L. McMillan
#t1995
#cFormal Methods in System Design
#index879007
#% 
#!
  
#*Properties of Hybrid Systems-A Computer Science Perspective.
#@Thomas Stauner
#t2004
#cFormal Methods in System Design
#index879008
#% 
#!
  
#*A Unifying Theoretical Background for Some Bdd-based Data Structures.
#@Christoph Meinel,Anna Slobodová
#t1997
#cFormal Methods in System Design
#index879009
#%131447
#%415969
#%494281
#%620284
#%832306
#%1078310
#%1078407
#%1079379
#%1196701
#!
  
#*Localized Verification of Modular Designs.
#@Jørgen Staunstrup,Niels Mellergaard
#t1995
#cFormal Methods in System Design
#index879010
#% 
#!
  
#*Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines.
#@Christoph Meinel,Thorsten Theobald
#t2001
#cFormal Methods in System Design
#index879011
#%131203
#%131447
#%133193
#%282929
#%283053
#%494283
#%1078407
#%1080535
#%1196767
#%1196701
#!
  
#*Gordon's Computer: A Hardware Verification Case Study in OBJ3.
#@Victoria Stavridou
#t1994
#cFormal Methods in System Design
#index879012
#% 
#!
  
#*The HOL Logic Extended with Quantification over Type Variables.
#@Thomas F. Melham
#t1993
#cFormal Methods in System Design
#index879013
#% 
#!
  
#*Parallelizing the Murj Verifier.
#@Ulrich Stern,David L. Dill
#t2001
#cFormal Methods in System Design
#index879014
#% 
#!
  
#*Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic.
#@Michael Mendler
#t2000
#cFormal Methods in System Design
#index879015
#%79171
#%188988
#%194045
#%282753
#%511831
#%879017
#%887806
#%888930
#%951868
#%1079601
#%1085089
#!
  
#*Undefined Expressions and Logic in Z and B.
#@Bill Stoddart,Steve Dunne,Andy Galloway
#t1999
#cFormal Methods in System Design
#index879016
#%2607
#%613011
#%676720
#%931990
#%3004213
#!
  
#*Newtonian Arbiters Cannot be Proven Correct.
#@Michael Mendler,Terry Stroup
#t1993
#cFormal Methods in System Design
#index879017
#% 
#!
  
#*Automated Analysis of Fault-Tolerance in Distributed Systems.
#@Scott D. Stoller,Fred B. Schneider
#t2005
#cFormal Methods in System Design
#index879018
#%89
#%161
#%213176
#%310272
#%546057
#%546650
#%559511
#%559564
#%1056616
#%1089601
#%1123453
#%1123702
#%1128403
#!
  
#*Formal Verification of a Distributed Computer System.
#@Michael Merritt,Ariel Orda,Sonia R. Sachs
#t1997
#cFormal Methods in System Design
#index879019
#%79604
#%486435
#%544255
#%623096
#%878983
#!
  
#*Foreword.
#@Scott D. Stoller,Willem Visser
#t2005
#cFormal Methods in System Design
#index879020
#% 
#!
  
#*Editorial Note.
#@Dominique Méry,Beverly A. Sanders
#t2002
#cFormal Methods in System Design
#index879021
#% 
#!
  
#*Accelerating Bounded Model Checking of Safety Properties.
#@Ofer Strichman
#t2004
#cFormal Methods in System Design
#index879022
#%79187
#%79181
#%79788
#%131416
#%133250
#%220551
#%282321
#%450825
#%950130
#!
  
#*Arithmetic Boolean Expression Manipulator Using BDDs.
#@Shin-ichi Minato,Fabio Somenzi
#t1997
#cFormal Methods in System Design
#index879023
#%131520
#%131564
#%131835
#%132275
#%133216
#%283053
#%1078407
#%281624
#!
  
#*Factored Edge-Valued Binary Decision Diagrams.
#@Paul Tafertshofer,Massoud Pedram
#t1997
#cFormal Methods in System Design
#index879024
#%131520
#%131835
#%132851
#%282577
#%832306
#%1078407
#%1080310
#%281624
#!
  
#*A Simple, Object-Based View of Multiprogramming.
#@Jayadev Misra
#t2002
#cFormal Methods in System Design
#index879025
#%89
#%2597
#%2612
#%769785
#%771305
#%876314
#%1123699
#%3005514
#!
  
#*A Practical Methodology for the Formal Verification of RISC Processors.
#@Sofiène Tahar,Ramayya Kumar
#t1998
#cFormal Methods in System Design
#index879026
#%79293
#%86818
#%131457
#%131562
#%131839
#%193971
#%209259
#%378327
#%629100
#%629133
#%629560
#%629614
#%629558
#%805904
#%878977
#%878908
#%879004
#%954685
#%954800
#%1071740
#%1078407
#%1079036
#%1079737
#%1082670
#%3004666
#%3004240
#%3005526
#%3169345
#!
  
#*Limits of Using Signatures for Permutation Independent Boolean Comparison.
#@Janett Mohnke,Paul Molitor,Sharad Malik
#t2002
#cFormal Methods in System Design
#index879027
#%3670
#%131520
#%131835
#%281782
#%282804
#%282970
#%286327
#%1078407
#%3401389
#!
  
#*Structural Operational Semantics for a Portable Subset of Behavioral VHDL-93.
#@Krishnaprasad Thirunarayan,Robert L. Ewing
#t2001
#cFormal Methods in System Design
#index879028
#%86736
#%86842
#%86732
#%86830
#%86883
#%878898
#%3005873
#%3006691
#!
  
#*Formalization and Analysis of a Solution to the PCI 2.1 Bus Transaction Ordering Problem.
#@Abdel Mokkedem,Ravi Hosabettu,Michael D. Jones,Ganesh Gopalakrishnan
#t2000
#cFormal Methods in System Design
#index879029
#%79711
#%79688
#%86738
#%1129168
#!
  
#*A Unified Framework for Describing and Verifying Hardware Synchronous Sequential Systems.
#@Ghislaine Thuau,Bachir Berkane
#t1993
#cFormal Methods in System Design
#index879030
#% 
#!
  
#*Proving the Correctness of the Standardized Algorithm for ABR Conformance.
#@Jean-François Monin
#t2000
#cFormal Methods in System Design
#index879031
#%61347
#%71766
#%79509
#%553006
#%631916
#%1076496
#%1088805
#%1094216
#!
  
#*Software Engineering with Formal Methods: The Development of a Storm Surge Barrier Control System Revisiting Seven Myths of Formal Methods.
#@Jan Tretmans,Klaas Wijbrans,Michel R. V. Chaudron
#t2001
#cFormal Methods in System Design
#index879032
#%178511
#%555275
#%1070466
#%1070912
#%1128403
#!
  
#*A Mechanically Checked Proof of a Multiprocessor Result via a Uniprocessor View.
#@J. Strother Moore
#t1999
#cFormal Methods in System Design
#index879033
#%79498
#%79768
#%209171
#%773617
#%1057009
#%1123699
#%1123599
#%1128581
#!
  
#*Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks.
#@Stefano Quer,Gianpiero Cabodi,Paolo Camurati,Luciano Lavagno,Ellen Sentovich,Robert K. Brayton
#t2000
#cFormal Methods in System Design
#index879034
#%52290
#%86951
#%131802
#%132802
#%134179
#%281740
#%281791
#%282224
#%283251
#%285797
#%285902
#%286413
#%857773
#%878907
#%283113
#!
  
#*Efficient Combinational Verification Using Overlapping Local BDDs and a Hash Table.
#@Rajarshi Mukherjee,Jawahar Jain,Koichiro Takayama,Jacob A. Abraham,Donald S. Fussell,Masahiro Fujita
#t2002
#cFormal Methods in System Design
#index879035
#%132516
#%133147
#%133693
#%281764
#%282535
#%283053
#%621778
#%1078407
#%1123714
#!
  
#*Analysis of Timed Systems Using Time-Abstracting Bisimulations.
#@Stavros Tripakis,Sergio Yovine
#t2001
#cFormal Methods in System Design
#index879036
#%79310
#%79513
#%79729
#%79821
#%79853
#%114068
#%221152
#%257502
#%361925
#%486435
#%495067
#%559512
#%565271
#%564996
#%620822
#%622608
#%625156
#%878793
#%886899
#%1056588
#%1060205
#%1094179
#!
  
#*Joint Minimization of Code and Data for Synchronous Dataflow Programs.
#@Praveen K. Murthy,Shuvra S. Bhattacharyya,Edward A. Lee
#t1997
#cFormal Methods in System Design
#index879037
#% 
#!
  
#*Special issue on formal methods for globally asynchronous and locally synchronous (GALS) systems.
#@Sandeep K. Shukla,Michael Theobald
#t2006
#cFormal Methods in System Design
#index879038
#% 
#!
  
#*Formal Verification of Dynamic Properties in an Aerospace Application.
#@Simin Nadjm-Tehrani,Jan-Erik Strömberg
#t1999
#cFormal Methods in System Design
#index879039
#%25247
#%66717
#%71766
#%79760
#%221110
#%221150
#%257443
#%257967
#%565385
#%949843
#%1056847
#%1070916
#%1088803
#%1127946
#%1128361
#!
  
#*Checking Timed Büchi Automata Emptiness Efficiently.
#@Stavros Tripakis,Sergio Yovine,Ahmed Bouajjani
#t2005
#cFormal Methods in System Design
#index879040
#% 
#!
  
#*Signal Transition Graph Constraints for Synthesis of Hazard-Free Asynchronous Circuits with Unbounded-Gate Delays.
#@Radhakrishna Nagalla,Graham R. Hellestrand
#t1994
#cFormal Methods in System Design
#index879041
#% 
#!
  
#*A Stubborn Attack on State Explosion.
#@Antti Valmari
#t1992
#cFormal Methods in System Design
#index879042
#% 
#!
  
#*Test Case Verification by Model Checking.
#@Kshirasagar Naik,Behçet Sarikaya
#t1993
#cFormal Methods in System Design
#index879043
#% 
#!
  
#*On Stubborn Sets in the Verification of Linear Time Temporal Properties.
#@Kimmo Varpaaniemi
#t2005
#cFormal Methods in System Design
#index879044
#%3500
#%3498
#%45131
#%45649
#%79549
#%79569
#%79716
#%79583
#%79825
#%114560
#%555036
#%841523
#%879042
#%878998
#%882008
#%882271
#%882381
#%887950
#!
  
#*Deriving Efficient Cache Coherence Protocols Through Refinement.
#@Ratan Nalumasu,Ganesh Gopalakrishnan
#t2002
#cFormal Methods in System Design
#index879045
#%79400
#%79711
#%79707
#%197142
#%201969
#%286006
#%419118
#%542302
#%772826
#%773819
#%807158
#%1123349
#!
  
#*Two Case Studies of Semantics Execution in Maude: CCS and LOTOS.
#@Alberto Verdejo,Narciso Martí-Oliet
#t2005
#cFormal Methods in System Design
#index879046
#%2597
#%40269
#%62075
#%79422
#%208462
#%212969
#%213481
#%487749
#%543127
#%555038
#%625152
#%629464
#%631838
#%950001
#%950643
#%1025713
#%1090136
#%1090138
#%1091968
#%1093249
#!
  
#*An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation.
#@Ratan Nalumasu,Ganesh Gopalakrishnan
#t2002
#cFormal Methods in System Design
#index879047
#%79367
#%79158
#%79460
#%79530
#%79459
#%79716
#%79688
#%79825
#%79717
#%86738
#%209186
#%213176
#%282550
#%555075
#%773819
#%879042
#%1123449
#%1128403
#%3006618
#!
  
#*Silicon Debug of a PowerPC[tm] Microprocessor Using Model Checking.
#@Richard Raimi,James Lear
#t2002
#cFormal Methods in System Design
#index879048
#% 
#!
  
#*Theorem Proving Guided Development of Formal Assertions in a Resource-Constrained Scheduler for High-Level Synthesis.
#@Naren Narasimhan,Elena Teica,Rajesh Radhakrishnan,Sriram Govindarajan,Ranga Vemuri
#t2001
#cFormal Methods in System Design
#index879049
#%71766
#%133485
#%134161
#%629339
#%629440
#%629523
#%645674
#%790862
#%858473
#%1117893
#%3417378
#!
  
#*A Proof of the Nonrestoring Division Algorithm and its Implementation on an ALU.
#@Diederik Verkest,Luc J. M. Claesen,Hugo De Man
#t1994
#cFormal Methods in System Design
#index879050
#% 
#!
  
#*Relative Liveness: From Intuition to Automated Verification.
#@Radu Negulescu,Janusz A. Brzozowski
#t1998
#cFormal Methods in System Design
#index879051
#%722
#%706
#%2597
#%55216
#%544124
#%544255
#%741020
#%841332
#%3004205
#!
  
#*Reasoning about Action Systems using the B-Method.
#@Marina A. Waldén,Kaisa Sere
#t1998
#cFormal Methods in System Design
#index879052
#%114107
#%208436
#%208517
#%252140
#%543632
#%544448
#%676523
#%1123656
#%3006972
#!
  
#*Abstractions of Random Finite-State Machines.
#@Kostas N. Oikonomou
#t2001
#cFormal Methods in System Design
#index879053
#%807992
#%879055
#%1059662
#%1081167
#%2871121
#!
  
#*Difficult Configurations-On the Complexity of .
#@Igor Walukiewicz
#t2005
#cFormal Methods in System Design
#index879054
#% 
#!
  
#*On a Class of Optimal Abstractions of Finite-State Machines.
#@Kostas N. Oikonomou
#t1996
#cFormal Methods in System Design
#index879055
#% 
#!
  
#*Parametric Analysis of Computer Systems.
#@Farn Wang
#t2000
#cFormal Methods in System Design
#index879056
#%79363
#%486435
#%565132
#%621231
#%886899
#%889735
#%1078407
#%1123449
#!
  
#*A Colored Petri Net Model of VHDL.
#@Serafín Olcoz,José Manuel Colom
#t1995
#cFormal Methods in System Design
#index879057
#% 
#!
  
#*Behavioral Subtyping Relations for Active Objects.
#@Heike Wehrheim
#t2003
#cFormal Methods in System Design
#index879058
#%2612
#%2597
#%45046
#%173273
#%208877
#%209604
#%209572
#%209667
#%209669
#%213395
#%213494
#%361783
#%559522
#%626672
#%676585
#%776776
#%793494
#%888913
#%949871
#%1123728
#!
  
#*Introduction: Special Issue on Partial Order in Formal Methods.
#@Doron Peled
#t2005
#cFormal Methods in System Design
#index879059
#% 
#!
  
#*Efficient Simulation of Formal Processor Models.
#@Matthew Wilding,David A. Greve,David Hardin
#t2001
#cFormal Methods in System Design
#index879060
#%79498
#%79840
#%209154
#%209171
#%209229
#%878900
#%949843
#%954688
#%1127515
#%1128581
#!
  
#*Combining Partial Order Reductions with On-the-Fly Model-Checking.
#@Doron Peled
#t1996
#cFormal Methods in System Design
#index879061
#% 
#!
  
#*Introduction: Special Issues for FM'99, the First World Congress on Formal Methods in the Development of Computing Systems.
#@Jeannette M. Wing,Jim Woodcock
#t2000
#cFormal Methods in System Design
#index879062
#% 
#!
  
#*Relaxed Visibility Enhances Partial Order Reduction.
#@Doron Peled,Antti Valmari,Ilkka Kokkarinen
#t2001
#cFormal Methods in System Design
#index879063
#%79455
#%79459
#%79716
#%79825
#%485250
#%555036
#%841523
#%879042
#%878793
#%887999
#%1092523
#%1093966
#!
  
#*A Flowgraph Semantics of VHDL: Toward a VHDL Verification Workbench in HOL.
#@Ralf Reetz,Thomas Kropf
#t1995
#cFormal Methods in System Design
#index879064
#% 
#!
  
#*Formal Methods in Designing Embedded Systems-the SACRES Experience.
#@Klaus Winkelmann
#t2001
#cFormal Methods in System Design
#index879065
#% 
#!
  
#*Validation of HOL Proofs by Proof Checking.
#@Wai Wong
#t1999
#cFormal Methods in System Design
#index879066
#%629550
#%771640
#%807776
#%954685
#%3169345
#!
  
#*Mechanizing Some Advanced Refinement Concepts.
#@Joakim von Wright,Jukka Hekanaho,P. Luostarinen,Thomas Långbacka
#t1993
#cFormal Methods in System Design
#index879067
#% 
#!
  
#*Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets.
#@Alexandre Yakovlev
#t1998
#cFormal Methods in System Design
#index879068
#%131882
#%133839
#%282006
#%644353
#%776396
#%858559
#%859021
#%1093757
#%1135092
#%1135039
#!
  
#*On the Models for Asynchronous Circuit Behaviour with OR Causality.
#@Alexandre Yakovlev,Michael Kishinevsky,Alex Kondratyev,Luciano Lavagno,Marta Pietkiewicz-Koutny
#t1996
#cFormal Methods in System Design
#index879069
#% 
#!
  
#*A Unified Signal Transition Graph Model for Asynchronous Control Circuit Synthesis.
#@Alexandre Yakovlev,Luciano Lavagno,Alberto L. Sangiovanni-Vincentelli
#t1996
#cFormal Methods in System Design
#index879070
#% 
#!
  
#*On the Computational Power of Binary Decision Diagram with Redundant Variables.
#@Tetsuya Yamada,Hiroto Yasuura
#t1996
#cFormal Methods in System Design
#index879071
#% 
#!
  
#*An Efficient Algorithm for Minimizing Real-Time Transition Systems.
#@Mihalis Yannakakis,David Lee
#t1997
#cFormal Methods in System Design
#index879072
#%2022
#%61357
#%79367
#%79310
#%79254
#%114068
#%267213
#%622608
#%878797
#%888440
#%1056588
#%1060205
#%1074288
#%1123449
#%3005514
#!
  
#*Efficient Algorithms for Interface Timing Verification.
#@Ti-Yen Yen,Alex Ishii,Albert E. Casavant,Wayne Wolf
#t1998
#cFormal Methods in System Design
#index879073
#%2022
#%134210
#%281786
#%286512
#%286337
#%286445
#%287035
#!
  
#*Design and Verification of Distributed Recovery Blocks with CSP.
#@Wing Lok Yeung,Steve Schneider
#t2003
#cFormal Methods in System Design
#index879074
#%2597
#%221049
#%221066
#%523679
#%807065
#%833063
#%841535
#%949871
#%1057136
#%1056904
#%1078700
#%1080046
#%1093521
#%1117581
#%1123699
#%1128613
#%1129168
#%3005514
#!
  
#*Efficient Verification of Parallel Real-Time Systems.
#@Tomohiro Yoneda,Bernd-Holger Schlingloff
#t1997
#cFormal Methods in System Design
#index879075
#% 
#!
  
#*Using Static Analysis to Reduce Dynamic Analysis Overhead.
#@Suan Hsi Yong,Susan Horwitz
#t2005
#cFormal Methods in System Design
#index879076
#%188119
#%202214
#%484174
#%542315
#%542310
#%542401
#%542935
#%546565
#%546777
#%546797
#%600828
#%636128
#%1008198
#%1074938
#!
  
#*Static Analysis for State-Space Reductions Preserving Temporal Logics.
#@Karen Yorav,Orna Grumberg
#t2004
#cFormal Methods in System Design
#index879077
#%700
#%2597
#%79222
#%79422
#%79718
#%79824
#%79673
#%114639
#%213176
#%546233
#%546057
#%546462
#%625298
#%625669
#%627565
#%1078407
#%1089722
#%1123453
#%1123449
#%3006115
#%3006516
#!
  
#*Translation and Run-Time Validation of Loop Transformations.
#@Lenore D. Zuck,Amir Pnueli,Benjamin Goldberg,Clark W. Barrett,Yi Fang,Ying Hu
#t2005
#cFormal Methods in System Design
#index879078
#%2288
#%9630
#%79813
#%542760
#%542761
#%546564
#%625363
#%646783
#!
  
#*Feature interaction detection by pairwise analysis of LTL properties - A case study.
#@Muffy Calder,Alice Miller
#t2006
#cFormal Methods in System Design
#index879079
#%700
#%61373
#%71371
#%114246
#%114354
#%209721
#%213178
#%213176
#%286006
#%362216
#%471330
#%471884
#%544198
#%546145
#%555036
#%558402
#%615673
#%794351
#%878849
#%878983
#%929768
#%950407
#%1089722
#%1123453
#%1128364
#%1128403
#%3006115
#!
  
#*Concurrency in Synchronous Systems.
#@Dumitru Potop-Butucaru,Benoît Caillaud,Albert Benveniste
#t2006
#cFormal Methods in System Design
#index879080
#%887159
#%888769
#%1056510
#%1056847
#!
  
#*Optimistic synchronization-based state-space reduction.
#@Scott D. Stoller,Ernie Cohen
#t2006
#cFormal Methods in System Design
#index879081
#%79435
#%114266
#%188812
#%213176
#%471884
#%507777
#%522650
#%522910
#%530340
#%546233
#%773819
#%888564
#%1117579
#%1128403
#!
  
#*Model Checking with Strong Fairness.
#@Yonit Kesten,Amir Pnueli,Li-on Raviv,Elad Shahar
#t2006
#cFormal Methods in System Design
#index879082
#%79729
#%131832
#%209202
#%268545
#%268428
#%486393
#%486435
#%546462
#%553006
#%624163
#%878873
#%1056685
#%1093297
#%3004205
#%3005676
#!
  
#*Reasoning about synchronization in GALS systems.
#@Supratik Chakraborty,Joycee Mekie,Dinesh K. Sharma
#t2006
#cFormal Methods in System Design
#index879083
#%52175
#%55104
#%55281
#%131257
#%287014
#%565444
#%645557
#%879073
#%986850
#%1081647
#%1117823
#%1135290
#!
  
#*Coverage metrics for temporal logic model checking.
#@Hana Chockler,Orna Kupferman,Moshe Y. Vardi
#t2006
#cFormal Methods in System Design
#index879084
#%2597
#%3670
#%79736
#%131408
#%131758
#%131832
#%132065
#%132063
#%132408
#%132624
#%132529
#%281825
#%281716
#%282040
#%286143
#%418912
#%486435
#%546114
#%546462
#%553006
#%878845
#%950948
#%1080954
#!
  
#*A predictive synchronizer for periodic clock domains.
#@Uri Frank,Tsachy Kapschitz,Ran Ginosar
#t2006
#cFormal Methods in System Design
#index879085
#%49869
#%55037
#%55104
#%55155
#%131416
#%131698
#%1082126
#!
  
#*A Framework for Modeling the Distributed Deployment of Synchronous Designs.
#@Luca P. Carloni,Alberto L. Sangiovanni-Vincentelli
#t2006
#cFormal Methods in System Design
#index879086
#%55093
#%142576
#%181329
#%181320
#%281805
#%887159
#%1008387
#!
  
#*An algebraic theory for behavioral modeling and protocol synthesis in system design.
#@Jean-Pierre Talpin,Paul Le Guernic
#t2006
#cFormal Methods in System Design
#index879087
#%2597
#%24986
#%181292
#%181329
#%221128
#%282287
#%542359
#!
  
#*Compositional SCC Analysis for Language Emptiness.
#@Chao Wang,Roderick Bloem,Gary D. Hachtel,Kavita Ravi,Fabio Somenzi
#t2006
#cFormal Methods in System Design
#index879088
#%79123
#%79338
#%79339
#%79278
#%133504
#%134232
#%209115
#%209185
#%209257
#%209202
#%268428
#%282208
#%282637
#%282812
#%283020
#%484908
#%546462
#%610587
#%625222
#%625312
#%1078407
#%3006115
#!
  
#*An Algorithm for Strongly Connected Component Analysis in log Symbolic Steps.
#@Roderick Bloem,Harold N. Gabow,Fabio Somenzi
#t2006
#cFormal Methods in System Design
#index879089
#% 
#!
  
#*Distributed disk-based algorithms for model checking very large Markov chains.
#@Alexander Bell,Boudewijn R. Haverkort
#t2006
#cFormal Methods in System Design
#index879090
#%2022
#%489669
#%528118
#%1034701
#%1036581
#%1036645
#%1036853
#%1076486
#%1117562
#%1275233
#%3005670
#%3005140
#!
  
#*Foreword.
#@Lubos Brim,Martin Leucker
#t2006
#cFormal Methods in System Design
#index879091
#% 
#!
  
#*Cones and foci: A mechanical framework for protocol verification.
#@Wan Fokkink,Jun Pang,Jaco van de Pol
#t2006
#cFormal Methods in System Design
#index879092
#%697
#%79240
#%79332
#%79707
#%108557
#%114077
#%114346
#%202241
#%268133
#%493579
#%542760
#%544255
#%625363
#%626601
#%631781
#%878869
#%888771
#%929983
#%950446
#%1089061
#%1091260
#%1091695
#%1117192
#%1123699
#%3003352
#%3004973
#!
  
#*Dealing with practical limitations of distributed timed model checking for timed automata.
#@Víctor A. Braberman,Alfredo Olivero,Fernando Schapachnik
#t2006
#cFormal Methods in System Design
#index879093
#%79189
#%209150
#%286666
#%361278
#%565101
#%615552
#%615539
#%625161
#%625035
#%878930
#%886899
#%1076484
#%1088805
#!
  
#*Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude.
#@Peter Csaba Ölveczky,José Meseguer,Carolyn L. Talcott
#t2006
#cFormal Methods in System Design
#index879094
#%173146
#%202245
#%499799
#%546914
#%651561
#%1090136
#%1093844
#%1095087
#!
  
#*CTL model checking on a shared-memory architecture.
#@Cornelia P. Inggs,Howard Barringer
#t2006
#cFormal Methods in System Design
#index879095
#%79189
#%79517
#%195954
#%209150
#%414931
#%537646
#%615552
#%615539
#!
  
#*Some ways to reduce the space dimension in polyhedra computations.
#@Nicolas Halbwachs,David Merchat,Laure Gonnord
#t2006
#cFormal Methods in System Design
#index879096
#%2348
#%17491
#%254159
#%360354
#%542398
#%546076
#%572588
#%878876
#%878914
#%1089421
#%1123843
#%1165975
#%1166280
#!
  
#*A work-efficient distributed algorithm for reachability analysis.
#@Orna Grumberg,Tamir Heyman,Assaf Schuster
#t2006
#cFormal Methods in System Design
#index879097
#%79187
#%79450
#%131416
#%133997
#%209163
#%281791
#%282871
#%878930
#%3006115
#!
  
#*Distributed breadth-first search LTL model checking.
#@Jiri Barnat,Ivana Cerná
#t2006
#cFormal Methods in System Design
#index879098
#%209721
#%615552
#%615646
#%878793
#%973067
#%1128403
#!
  
#*On using priced timed automata to achieve optimal scheduling.
#@Jacob Illum Rasmussen,Kim Guldstrand Larsen,K. Subramani
#t2006
#cFormal Methods in System Design
#index879099
#%407857
#%565271
#%989184
#%1288705
#%3005546
#!
  
#*Question-guided stubborn set methods for state properties.
#@Lars Michael Kristensen,K. Schmidt,Antti Valmari
#t2006
#cFormal Methods in System Design
#index879100
#%700
#%2597
#%17446
#%17806
#%24978
#%79455
#%79716
#%79718
#%79824
#%114639
#%114710
#%486435
#%553006
#%615641
#%879063
#!
  
#*Performance analysis of probabilistic timed automata using digital clocks.
#@Marta Z. Kwiatkowska,Gethin Norman,David Parker,Jeremy Sproston
#t2006
#cFormal Methods in System Design
#index879101
#%114010
#%219390
#%268235
#%528120
#%556495
#%565099
#%625169
#%625072
#%625350
#%841327
#%878804
#%886899
#%886905
#%1025778
#%1076577
#%1076487
#%1088805
#%1092833
#!
  
#*Data structures for symbolic multi-valued model-checking.
#@Marsha Chechik,Arie Gurfinkel,Benet Devereux,Albert Y. C. Lai,Steve M. Easterbrook
#t2006
#cFormal Methods in System Design
#index879102
#%79317
#%79323
#%79458
#%209262
#%441294
#%484516
#%625096
#%625113
#%832306
#%878845
#%878789
#%879023
#%1078407
#%1123449
#%1124239
#%1124243
#%3002627
#%3006115
#%281624
#%361845
#!
  
#*Bounded model checking of infinite state systems.
#@Tobias Schüle,Klaus Schneider
#t2007
#cFormal Methods in System Design
#index879103
#%722
#%24960
#%24962
#%70710
#%71717
#%79291
#%79337
#%79786
#%131474
#%131575
#%133250
#%141960
#%158504
#%209127
#%209223
#%209251
#%268428
#%282753
#%327682
#%378457
#%415713
#%486435
#%544272
#%546462
#%555036
#%559531
#%572543
#%581530
#%625687
#%626705
#%629504
#%629496
#%832427
#%878784
#%1078408
#%1078407
#%1085089
#%1094767
#%1123357
#%3004631
#!
  
#*HySAT: An efficient proof engine for bounded model checking of hybrid systems.
#@Martin Fränzle,Christian Herde
#t2007
#cFormal Methods in System Design
#index879104
#%71183
#%71717
#%79157
#%79788
#%117751
#%131632
#%133250
#%134282
#%281693
#%565132
#%622287
#%771155
#%772676
#%934388
#!
  
#*Verification of bounded Petri nets using integer programming.
#@Victor Khomenko,Maciej Koutny
#t2007
#cFormal Methods in System Design
#index879105
#%17765
#%79668
#%79658
#%487829
#%625272
#%740727
#%878829
#%887495
#%1056701
#%1088677
#%1092722
#%1127849
#!
  
#*Static priority scheduling of event-triggered real-time embedded systems.
#@Cagkan Erbas,Andy D. Pimentel,Selin Cerav-Erbas
#t2007
#cFormal Methods in System Design
#index879106
#% 
#!
  
#*Guest editorial.
#@Constance L. Heitmeyer,Jean-Pierre Talpin
#t2007
#cFormal Methods in System Design
#index879107
#% 
#!
  
#*Providing a formal linkage between MDG and HOL.
#@Haiyan Xiong,Paul Curzon,Sofiène Tahar,Ann Blandford
#t2007
#cFormal Methods in System Design
#index879108
#%79740
#%131210
#%179850
#%206045
#%209254
#%209266
#%217026
#%625135
#%629105
#%629301
#%832306
#%878789
#%955056
#%1078407
#%1123423
#%3004666
#%3006228
#!
  
#*From NuSMV to SPIN: Experiences with model checking flight guidance systems.
#@Yunja Choi
#t2007
#cFormal Methods in System Design
#index879109
#%188089
#%188154
#%239123
#%471501
#%538114
#%558221
#%615648
#%1006727
#%1056510
#%1127719
#%1128364
#%1128403
#!
  
#*Designing communicating transaction processes by supervisory control theory.
#@Lei Feng,W. Murray Wonham,P. S. Thiagarajan
#t2007
#cFormal Methods in System Design
#index879110
#%24958
#%106037
#%209226
#%1128403
#%1164786
#%1164765
#%1344563
#!
  
#*Foreword: Selected papers from the ninth international workshop on formal methods for industrial critical systems (FMICS 04), Linz, Austria.
#@Andrew Butterfield,Juan Bicarregui,Alvaro Arenas
#t2007
#cFormal Methods in System Design
#index879111
#% 
#!
  
#*Object oriented concepts identification from formal B specifications.
#@Akram Idani,Yves Ledru
#t2007
#cFormal Methods in System Design
#index879112
#%61921
#%188105
#%208553
#%309619
#%385148
#%471628
#%676650
#%1056847
#%3005731
#!
  
#*Early verification and validation of mission critical systems.
#@Christophe Ponsard,Philippe Massonet,Jean-François Molderez,André Rifaut,Axel van Lamsweerde,Hung Tran Van
#t2007
#cFormal Methods in System Design
#index879113
#% 
#!
  
#*Static priority scheduling of event-triggered real-time embedded systems.
#@Cagkan Erbas,Andy D. Pimentel,Selin Cerav-Erbas
#t2007
#cFormal Methods in System Design
#index879114
#% 
#!
  
#*Verification of SpecC using predicate abstraction.
#@Edmund M. Clarke,Himanshu Jain,Daniel Kroening
#t2007
#cFormal Methods in System Design
#index879115
#%79172
#%79330
#%79338
#%79474
#%79788
#%131474
#%131833
#%132515
#%133250
#%133841
#%213176
#%282485
#%450579
#%486435
#%492229
#%546114
#%546189
#%546658
#%615550
#%625092
#%646845
#%878780
#%878913
#%1128403
#!
  
#*On the optimal reachability problem of weighted timed automata.
#@Patricia Bouyer,Thomas Brihaye,Véronique Bruyère,Jean-François Raskin
#t2007
#cFormal Methods in System Design
#index879116
#%79160
#%384636
#%484790
#%622287
#%625169
#%881409
#%886899
#%888497
#%1088805
#%3007117
#!
  
#*GSTE is partitioned model checking.
#@Roberto Sebastiani,Eli Singerman,Stefano Tonetta,Moshe Y. Vardi
#t2007
#cFormal Methods in System Design
#index879117
#%79338
#%79437
#%79661
#%131574
#%141954
#%209263
#%209257
#%209202
#%281791
#%282190
#%282871
#%283358
#%555036
#%625009
#%625222
#%878873
#%878976
#%878979
#%878793
#%878930
#%889644
#%950948
#%1135671
#!
  
#*Refinement preserving approximations for the design and verification of heterogeneous systems.
#@Roberto Passerone,Jerry R. Burch,Alberto L. Sangiovanni-Vincentelli
#t2007
#cFormal Methods in System Design
#index879118
#%24926
#%79474
#%106037
#%181347
#%181354
#%484602
#%543125
#%546057
#%878995
#%886905
#%1094418
#%1129105
#!
  
#*Timed substitutions for regular signal-event languages.
#@Béatrice Bérard,Paul Gastin,Antoine Petit
#t2007
#cFormal Methods in System Design
#index879119
#%267213
#%484485
#%740470
#%878890
#%881409
#%930961
#%1088805
#%1091784
#!
  
#*Exploiting interleaving semantics in symbolic state-space generation.
#@Gianfranco Ciardo,Gerald Lüttgen,Andrew S. Miner
#t2007
#cFormal Methods in System Design
#index879120
#%45557
#%45510
#%79824
#%131577
#%209264
#%209193
#%282871
#%597483
#%625007
#%878796
#%950283
#%1036581
#%1078407
#%1128599
#%1130007
#!
  
#*Learning to verify branching time properties.
#@Abhay Vardhan,Mahesh Viswanathan
#t2007
#cFormal Methods in System Design
#index879121
#%40197
#%79291
#%79256
#%471313
#%471880
#%545952
#%545960
#%587830
#%886971
#%889254
#%1091149
#!
  
#*An abstract interpretation toolkit for µCRL.
#@Miguel Valero Espada,Jaco van de Pol
#t2007
#cFormal Methods in System Design
#index879122
#% 
#!
  
#*Memory model sensitive bytecode verification.
#@Thuan Quang Huynh,Abhik Roychoudhury
#t2007
#cFormal Methods in System Design
#index879123
#%79688
#%363013
#%542989
#%546505
#%878819
#%954925
#%1081234
#%3006618
#!
  
#*The word problem for visibly pushdown languages described by grammars.
#@Salvatore La Torre,Margherita Napoli,Mimmo Parente
#t2007
#cFormal Methods in System Design
#index879124
#%79510
#%113987
#%114177
#%203970
#%268694
#%546688
#%615548
#%621233
#%887789
#%930977
#%951047
#%951143
#%1089735
#%1123256
#!
  
#*Finding optimal hardware/software partitions.
#@Zoltán Ádám Mann,András Orbán,Péter Arató
#t2007
#cFormal Methods in System Design
#index879125
#%106115
#%106220
#%106329
#%131476
#%133992
#%141991
#%142128
#%142411
#%143064
#%193948
#%193996
#%450667
#%450669
#%450649
#%477417
#%805575
#%808565
#%858055
#%858157
#%1077838
#%1081641
#%1117920
#%1117867
#%1135144
#%1135396
#%3417351
#%1117694
#!
  
#*Checking extended properties using guarded quotient structures.
#@A. Prasad Sistla,Xiaodong Wang,Min Zhou
#t2007
#cFormal Methods in System Design
#index879126
#% 
#!
  
#*Introduction.
#@Rajeev Alur,George J. Pappas
#t2008
#cFormal Methods in System Design
#index879127
#% 
#!
  
#*Optimal infinite scheduling for multi-priced timed automata.
#@Patricia Bouyer,Ed Brinksma,Kim Guldstrand Larsen
#t2008
#cFormal Methods in System Design
#index879128
#%267213
#%384636
#%528110
#%564312
#%625023
#%625072
#%861765
#%1088805
#%1095429
#!
  
#*Verification of parametric concurrent systems with prioritised FIFO resource management.
#@Ahmed Bouajjani,Peter Habermehl,Tomás Vojnar
#t2008
#cFormal Methods in System Design
#index879129
#%71371
#%79407
#%79576
#%208505
#%546145
#%625194
#%625362
#%888628
#%929768
#%950407
#%1123454
#!
  
#*Abstractions for hybrid systems.
#@Ashish Tiwari
#t2008
#cFormal Methods in System Design
#index879130
#%60484
#%79508
#%79474
#%79705
#%210909
#%257576
#%257585
#%257465
#%257609
#%257860
#%257773
#%257902
#%268228
#%449313
#%625096
#%745910
#%972199
#%994213
#%994296
#%1088803
#%1123560
#!
  
#*A congruence relation for sPBC.
#@Hermenegilda Macià,Valentín Valero Ruiz,Fernando Cuartero,David de Frutos-Escrig
#t2008
#cFormal Methods in System Design
#index879131
#%17266
#%24905
#%45079
#%45073
#%114405
#%888651
#%1089327
#%1092002
#%3003564
#%3005514
#!
  
#*Constructing invariants for hybrid systems.
#@Sriram Sankaranarayanan,Henny B. Sipma,Zohar Manna
#t2008
#cFormal Methods in System Design
#index879132
#%79144
#%79508
#%449604
#%484790
#%546076
#%546057
#%572612
#%572817
#%625414
#%878914
#%993666
#%994213
#%1196649
#%3005676
#%3004973
#!
  
#*Three optimizations for Assume-Guarantee reasoning with L.
#@Sagar Chaki,Ofer Strichman
#t2008
#cFormal Methods in System Design
#index879133
#%209165
#%213351
#%361890
#%471501
#%545952
#%587830
#%625280
#%886971
#%889254
#%950049
#%1129042
#!
  
#*Automatic symbolic compositional verification by learning assumptions.
#@Wonhong Nam,P. Madhusudan,Rajeev Alur
#t2008
#cFormal Methods in System Design
#index879134
#%79172
#%79330
#%79338
#%79513
#%79694
#%79655
#%79662
#%219992
#%450845
#%471501
#%545952
#%587830
#%886971
#%889254
#%953867
#%972256
#%1061034
#%1078407
#%1123234
#%1123560
#%1129042
#%1135152
#%3417351
#!
  
#*Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning.
#@Corina S. Pasareanu,Dimitra Giannakopoulou,Mihaela Gheorghiu Bobaru,Jamieson M. Cobleigh,Howard Barringer
#t2008
#cFormal Methods in System Design
#index879135
#%79172
#%79330
#%79338
#%114354
#%188812
#%362357
#%450845
#%484554
#%545952
#%587830
#%601143
#%760975
#%886971
#%889254
#%1124308
#%1124253
#!
  
#*Special issue on learning techniques for compositional reasoning.
#@Dimitra Giannakopoulou,Corina S. Pasareanu
#t2008
#cFormal Methods in System Design
#index879136
#% 
#!
  
#*Verification of evolving software via component substitutability analysis.
#@Sagar Chaki,Edmund M. Clarke,Natasha Sharygina,Nishant Sinha
#t2008
#cFormal Methods in System Design
#index879137
#%79314
#%79353
#%79338
#%79474
#%79662
#%450845
#%471501
#%484602
#%484460
#%484554
#%486435
#%542317
#%545952
#%546114
#%546304
#%587830
#%601059
#%625280
#%878913
#%886971
#%889254
#%1123234
#%1123728
#%1123644
#%1129042
#!
  
#*Automated assumption generation for compositional verification.
#@Anubhav Gupta,Kenneth L. McMillan,Zhaohui Fu
#t2008
#cFormal Methods in System Design
#index879138
#%886971
#%1009807
#%3006115
#!
  
#*Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006).
#@Clark W. Barrett,Leonardo Mendonça de Moura,Aaron Stump
#t2007
#cFormal Methods in System Design
#index879139
#%209205
#%542724
#%878784
#%955108
#!
  
#*Robust safety of timed automata.
#@Martin De Wulf,Laurent Doyen,Nicolas Markey,Jean-François Raskin
#t2008
#cFormal Methods in System Design
#index879140
#%61357
#%79194
#%79363
#%178524
#%221132
#%257438
#%257593
#%257894
#%483548
#%484483
#%556519
#%620060
#%625209
#%625065
#%628574
#%876476
#%953944
#%984519
#%1025546
#%1088805
#%1090609
#%1344515
#!
  
#*Don't care words with an application to the automata-based approach for real addition.
#@Jochen Eisinger,Felix Klaedtke
#t2008
#cFormal Methods in System Design
#index879141
#%722
#%79241
#%79843
#%132397
#%132801
#%449688
#%481486
#%484790
#%929768
#%950148
#%1089516
#%1092562
#%1117155
#%1117132
#%3006115
#!
  
#*An approach for extracting a small unsatisfiable core.
#@Roman Gershman,Maya Koifman,Ofer Strichman
#t2008
#cFormal Methods in System Design
#index879142
#%52357
#%71183
#%79813
#%133398
#%134282
#%141961
#%143359
#%546254
#%751599
#%771155
#%811957
#%836289
#%951454
#%972760
#%1123714
#!
  
#*Before and after vacuity.
#@Hana Chockler,Ofer Strichman
#t2009
#cFormal Methods in System Design
#index879143
#%700
#%39975
#%79736
#%131408
#%131832
#%132408
#%486435
#%492328
#%546462
#%553006
#%559566
#%622941
#%625128
#%858587
#%878845
#%889644
#%951385
#%951612
#%972447
#!
  
#*Timed verification of the generic architecture of a memory circuit using parametric timed automata.
#@Remy Chevallier,Emmanuelle Encrenaz-Tiphène,Laurent Fribourg,Weiwen Xu
#t2009
#cFormal Methods in System Design
#index879144
#%2355
#%52175
#%61357
#%79493
#%86832
#%546057
#%625169
#%1088805
#!
  
#*Safely composing security protocols.
#@Véronique Cortier,Stéphanie Delaune
#t2009
#cFormal Methods in System Design
#index879145
#%83795
#%84007
#%114082
#%123892
#%123948
#%124031
#%124109
#%124168
#%124148
#%210282
#%210030
#%484562
#%613818
#%616575
#%625318
#%774577
#%869418
#%889936
#%1056721
#%1076169
#%1123744
#%1127255
#%3142088
#!
  
#*From liveness to promptness.
#@Orna Kupferman,Nir Piterman,Moshe Y. Vardi
#t2009
#cFormal Methods in System Design
#index879146
#%700
#%79185
#%79406
#%114331
#%211205
#%211625
#%493888
#%546637
#%889644
#%1093635
#!
  
#*Approximated parameterized verification of infinite-state processes with global conditions.
#@Parosh Aziz Abdulla,Giorgio Delzanno,Ahmed Rezine
#t2009
#cFormal Methods in System Design
#index879147
#%79387
#%114019
#%484647
#%484652
#%486611
#%625066
#%773613
#%886882
#%950407
#%1092562
#%1094216
#%1123357
#!
  
#*Coverage-guided test generation for continuous and hybrid systems.
#@Thao Dang,Tarik Nahhal
#t2009
#cFormal Methods in System Design
#index879148
#%110936
#%555461
#%833252
#%1088803
#%1274144
#!
  
#*Hybrid systems: from verification to falsification by combining motion planning and discrete search.
#@Erion Plaku,Lydia E. Kavraki,Moshe Y. Vardi
#t2009
#cFormal Methods in System Design
#index879149
#%79144
#%257812
#%484790
#%622287
#%878784
#%1088803
#%1088807
#%1098664
#%3002009
#!
  
#*Local proofs for global safety properties.
#@Ariel Cohen,Kedar S. Namjoshi
#t2009
#cFormal Methods in System Design
#index879150
#%79126
#%79729
#%79662
#%450845
#%471501
#%486435
#%542627
#%543808
#%553006
#%625362
#%774869
#%950049
#%1091245
#%1128768
#%1129042
#%3006700
#!
  
#*Distributed synthesis for well-connected architectures.
#@Paul Gastin,Nathalie Sznajder,Marc Zeitoun
#t2009
#cFormal Methods in System Design
#index1223509
#%114505
#%114463
#%211601
#%211627
#%267163
#%268862
#%484672
#%484906
#%486435
#%546637
#%610973
#%1088937
#%1093635
#!
  
#*Conformance testing for real-time systems.
#@Moez Krichen,Stavros Tripakis
#t2009
#cFormal Methods in System Design
#index1223510
#%40059
#%61357
#%79166
#%79423
#%79266
#%181352
#%221159
#%268235
#%450819
#%555247
#%555371
#%555275
#%565148
#%620822
#%625013
#%625156
#%625345
#%878890
#%881409
#%1088805
#%1094708
#%1127819
#%1344515
#%3572623
#!
  
#*The 2008 CAV Award citation.
#@Randal E. Bryant,Orna Grumberg,Thomas A. Henzinger,Moshe Y. Vardi
#t2009
#cFormal Methods in System Design
#index1337491
#% 
#!
  
#*Word level bitwidth reduction for unbounded hardware model checking.
#@Per Bjesse
#t2009
#cFormal Methods in System Design
#index1337492
#%79287
#%79523
#%209305
#%252838
#%772007
#%775194
#%878840
#%889232
#!
  
#*Foreword: Special issue on numerical software verification.
#@Franjo Ivancic,Sriram Sankaranarayanan,Chao Wang
#t2009
#cFormal Methods in System Design
#index1337507
#% 
#!
  
#*Automating the addition of fault tolerance with discrete controller synthesis.
#@Alain Girault,Éric Rutten
#t2009
#cFormal Methods in System Design
#index1337496
#%40075
#%39861
#%114201
#%161710
#%174462
#%298103
#%546057
#%832506
#%878941
#%941004
#%941006
#%1056986
#%1078407
#%1094451
#%1098000
#%1123329
#%1123702
#%1127703
#%1128876
#%2889540
#%3005514
#!
  
#*Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations.
#@Himanshu Jain,Edmund M. Clarke,Orna Grumberg
#t2009
#cFormal Methods in System Design
#index1337495
#%209289
#%449705
#%546303
#%601363
#%950049
#%1123789
#%1124027
#!
  
#*Summarization for termination: no return!
#@Byron Cook,Andreas Podelski,Andrey Rybalchenko
#t2009
#cFormal Methods in System Design
#index1337501
#%79413
#%79351
#%113987
#%485125
#%530301
#%542485
#%542353
#%542688
#%546155
#%545950
#%546406
#%546658
#%546688
#%546638
#%546913
#%546964
#%615548
#%621233
#%1057108
#%1123256
#%3006700
#!
  
#*Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness.
#@Roberto Bagnara,Patricia M. Hill,Enea Zaffanella
#t2009
#cFormal Methods in System Design
#index1337505
#%2022
#%65633
#%211578
#%542398
#%542312
#%542892
#%546062
#%546076
#%546057
#%547974
#%565271
#%572805
#%575368
#%653279
#%744697
#%820199
#%878914
#%951282
#%1006848
#%1056601
#%1057362
#%1059809
#%1076676
#%1076717
#!
  
#*Reducing concurrent analysis under a context bound to sequential analysis.
#@Akash Lal,Thomas W. Reps
#t2009
#cFormal Methods in System Design
#index1337494
#%81346
#%472002
#%538305
#%542627
#%542802
#%542317
#%543028
#%546076
#%546304
#%546658
#%546554
#%546688
#%615548
#%1057108
#%1123846
#!
  
#*Computing differential invariants of hybrid systems as fixedpoints.
#@André Platzer,Edmund M. Clarke
#t2009
#cFormal Methods in System Design
#index1337498
#%79509
#%484790
#%955253
#%993666
#%1076496
#!
  
#*Full simulation coverage for SystemC transaction-level models of systems-on-a-chip.
#@Claude Helmstetter,Florence Maraninchi,Laurent Maillet-Contoz
#t2009
#cFormal Methods in System Design
#index1337493
#%79857
#%79658
#%134903
#%142217
#%181376
#%209279
#%283880
#%492288
#%542588
#%546189
#%546910
#%653279
#%773619
#%878879
#%1092523
#!
  
#*Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics.
#@Matthieu Martel
#t2009
#cFormal Methods in System Design
#index1337504
#%49701
#%188836
#%188911
#%546170
#%546057
#%581518
#%819892
#%832535
#%1006934
#%1124082
#%3003225
#%3107386
#!
  
#*Why does Astrée scale up?
#@Patrick Cousot,Radhia Cousot,Jérôme Feret,Laurent Mauborgne,Antoine Miné,Xavier Rival
#t2009
#cFormal Methods in System Design
#index1337503
#% 
#!
  
#*Preface.
#@Aarti Gupta,Sharad Malik
#t2009
#cFormal Methods in System Design
#index1337497
#% 
#!
  
#*Testing-based translation validation of generated code in the context of IEC 61508.
#@Mirko Conrad
#t2009
#cFormal Methods in System Design
#index1337506
#%141658
#%625363
#%1130050
#%1179932
#%1211557
#!
  
#*Decision problems for lower/upper bound parametric timed automata.
#@Laura Bozzelli,Salvatore La Torre
#t2009
#cFormal Methods in System Design
#index1337500
#%211625
#%484648
#%485307
#%563582
#%619952
#%621231
#%886899
#%889735
#%949654
#%972199
#%1088805
#%1117534
#!
  
#*The CAV award.
#@
#t2009
#cFormal Methods in System Design
#index1337490
#% 
#!
  
#*Action Language verifier: an infinite-state model checker for reactive software specifications.
#@Tuba Yavuz-Kahveci,Tevfik Bultan
#t2009
#cFormal Methods in System Design
#index1337502
#%79330
#%79387
#%117240
#%220998
#%361551
#%450997
#%471391
#%471313
#%484553
#%492236
#%546076
#%546057
#%625165
#%625236
#%625319
#%761071
#%878809
#%879103
#%879121
#%1123357
#%1124239
#%1128403
#%3006115
#!
  
#*Functional verification of power gated designs by compositional reasoning.
#@Cindy Eisner,Amir Nahir,Karen Yorav
#t2009
#cFormal Methods in System Design
#index1337499
#%79663
#%282466
#%3485740
#!
  
#*Advanced methods for equivalence checking of analog circuits with strong nonlinearities.
#@Sebastian Steinhorst,Lars Hedrich
#t2010
#cFormal Methods in System Design
#index2921137
#%53338
#%79508
#%79501
#%141893
#%143435
#%282251
#%645112
#!
  
#*2009 CAV award announcement.
#@Randal E. Bryant,Orna Grumberg,Joseph Sifakis,Moshe Y. Vardi
#t2010
#cFormal Methods in System Design
#index2921145
#%133250
#%771155
#%950130
#!
  
#*Simple concurrent garbage collection almost without synchronization.
#@Wim H. Hesselink,M. I. Lali
#t2010
#cFormal Methods in System Design
#index2921138
#%521756
#%542412
#%542890
#%543026
#%546119
#%771314
#%776288
#%841501
#%997559
#%1057231
#%1068343
#%1123233
#%1123719
#%1124041
#%3004631
#!
  
#*Theorem prover approach to semistructured data design.
#@Scott Uk-Jin Lee,Gillian Dobbie,Jing Sun,Lindsay Groves
#t2010
#cFormal Methods in System Design
#index2921148
#%2296
#%71766
#%79784
#%138475
#%175893
#%183159
#%183032
#%184157
#%206048
#%208914
#%544876
#%598533
#%663582
#%663727
#%663910
#%753411
#%1065320
#%1118202
#%1129168
#%3002593
#!
  
#*Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols.
#@Xiaofang Chen,Yu Yang,Ganesh Gopalakrishnan,Ching-Tsun Chou
#t2010
#cFormal Methods in System Design
#index2921146
#%74
#%71371
#%79338
#%134371
#%252903
#%286006
#%360661
#%418445
#%418665
#%419209
#%419118
#%569049
#%615646
#%878865
#%1243874
#%1243868
#%3563926
#!
  
#*On simulation-based probabilistic model checking of mixed-analog circuits.
#@Edmund M. Clarke,Alexandre Donzé,Axel Legay
#t2010
#cFormal Methods in System Design
#index2921139
#%66705
#%79861
#%211625
#%212808
#%282214
#%556575
#%556495
#%889892
#%950037
#%1076679
#%1127381
#!
  
#*Performability assessment by model checking of Markov reward models.
#@Christel Baier,Lucia Cloth,Boudewijn R. Haverkort,Holger Hermanns,Joost-Pieter Katoen
#t2010
#cFormal Methods in System Design
#index2921147
#%79206
#%79235
#%161522
#%161648
#%162072
#%556508
#%556582
#%586422
#%617027
#%625400
#%625449
#%771824
#%876400
#%924163
#%1036414
#%1036692
#%1037046
#%1037118
#%1078159
#%1079457
#%1080883
#%1080879
#%1082088
#%1092002
#%1127381
#%1130039
#!
  
#*A game-based abstraction-refinement framework for Markov decision processes.
#@Mark Kattenbelt,Marta Z. Kwiatkowska,Gethin Norman,David Parker
#t2010
#cFormal Methods in System Design
#index2921141
#%49814
#%66569
#%79338
#%79474
#%79894
#%79928
#%114046
#%209808
#%528109
#%556497
#%556563
#%556650
#%646902
#%841327
#%867749
#%870311
#%879101
#%887483
#%887665
#%888651
#%1057018
#%1092151
#%1095856
#%1130136
#%1243917
#!
  
#*Causal semantics for the algebra of connectors.
#@Simon Bliudze,Joseph Sifakis
#t2010
#cFormal Methods in System Design
#index2921140
#%2597
#%177338
#%181508
#%267760
#%362964
#%363182
#%581542
#%581642
#%601106
#%601176
#%805712
#%805713
#%889932
#%1014627
#%1056640
#%1083211
#%1089742
#%1091955
#%3002452
#%3005514
#!
  
#*MAVEN: modular aspect verification and interference analysis.
#@Max Goldman,Emilia Katz,Shmuel Katz
#t2010
#cFormal Methods in System Design
#index2921149
#%43131
#%43202
#%43163
#%79331
#%114384
#%173081
#%465630
#%471315
#%601285
#%625502
#%713918
#%770060
#%867567
#%1088686
#%1123560
#%1124361
#%1281281
#!
  
#*Analog property checkers: a DDR2 case study.
#@Kevin D. Jones,Victor Konrad,Dejan Nickovic
#t2010
#cFormal Methods in System Design
#index2921142
#%79122
#%79886
#%132320
#%143740
#%212808
#%258137
#%283490
#%555036
#%559529
#%615640
#%645112
#%949654
#%3005676
#!
  
#*Pushdown module checking.
#@Laura Bozzelli,Aniello Murano,Adriano Peron
#t2010
#cFormal Methods in System Design
#index2921143
#%2597
#%79838
#%113987
#%137069
#%269126
#%486435
#%553006
#%887789
#%949951
#%950948
#%973067
#%1095138
#!
  
#*Partially-shared zero-suppressed multi-terminal BDDs: concept, algorithms and applications.
#@Kai Lampka,Markus Siegle,Jörn Ossowski,Christel Baier
#t2010
#cFormal Methods in System Design
#index2921144
#%133214
#%528126
#%625045
#%683338
#%879120
#%1076768
#%1077855
#%1078407
#!
  
#*Context-aware counter abstraction.
#@Gérard Basler,Michele Mazzucchi,Thomas Wahl,Daniel Kroening
#t2010
#cFormal Methods in System Design
#index2921136
#%79387
#%79474
#%79730
#%213176
#%472002
#%542627
#%546189
#%573001
#%615548
#%615722
#%625192
#%625092
#%625452
#%691498
#%867264
#%878825
#%878836
#%878921
#%1095897
#%1125631
#%1206127
#%2811389
#!
  
#*Model-based construction and verification of critical systems using composition and partial refinement.
#@Ralph D. Jeffords,Constance L. Heitmeyer,Myla Archer,Elizabeth I. Leonard
#t2010
#cFormal Methods in System Design
#index2968452
#%3123
#%208557
#%221060
#%363943
#%483724
#%543548
#%601196
#%601195
#%625139
#%1056847
#%1057099
#%1057308
#%1088628
#%1123230
#%1123699
#%1123729
#%1124217
#%1127298
#%1128361
#%1130102
#%1243817
#!
  
#*Certifying compilers using higher-order theorem provers as certificate checkers.
#@Jan Olaf Blech,Benjamin Grégoire
#t2011
#cFormal Methods in System Design
#index2968450
#%3449
#%65903
#%81290
#%209103
#%484473
#%542760
#%542761
#%546430
#%546428
#%546564
#%546700
#%546911
#%581504
#%625363
#%625623
#%629310
#%708539
#%866666
#%868586
#%869845
#%954904
#%1124004
#%1180152
#!
  
#*Bisimulation conversion and verification procedure for goal-based control systems.
#@Julia M. B. Braman,Richard M. Murray
#t2011
#cFormal Methods in System Design
#index2968449
#%55546
#%79330
#%79384
#%79655
#%359867
#%546189
#%615548
#%625022
#%748412
#%832427
#%1091720
#%1127360
#%1129168
#%1129634
#%1180899
#%1195930
#%389260
#!
  
#*Doomed program points.
#@Jochen Hoenicke,K. Rustan M. Leino,Andreas Podelski,Martin Schäf,Thomas Wies
#t2010
#cFormal Methods in System Design
#index2968448
#%47530
#%79905
#%451000
#%487425
#%530325
#%530315
#%530358
#%530305
#%542559
#%546191
#%601447
#%601537
#%615573
#%932546
#%1070704
#%1123638
#%1123734
#%1123714
#%1123788
#%1243841
#%1256598
#%1271248
#%1321696
#%3005676
#!
  
#*Special issue: 2nd World Congress on Formal Methods.
#@Ana Cavalcanti,Dennis Dams
#t2010
#cFormal Methods in System Design
#index2968447
#% 
#!
  
#*Pointfree expression and calculation: from quantification to temporal logic.
#@Raymond T. Boute
#t2010
#cFormal Methods in System Design
#index2968445
#%74
#%2607
#%3311
#%209096
#%209721
#%268861
#%361839
#%379642
#%546819
#%591177
#%769685
#%772425
#%807665
#%1014857
#%1123304
#%1124006
#%1236879
#%1243845
#%1264852
#%2772860
#%2939957
#%2939527
#%3002116
#%3004669
#%3005070
#%3006700
#%3005873
#!
  
#*Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects.
#@Benoît Delahaye,Benoît Caillaud,Axel Legay
#t2011
#cFormal Methods in System Design
#index2968451
#%49774
#%61364
#%114050
#%211625
#%211928
#%385172
#%486435
#%556575
#%581706
#%601059
#%722639
#%889644
#%949658
#%1124371
#%1164708
#%1206112
#%1237929
#%1247135
#%1248743
#%1256151
#%1309628
#%2921139
#%2950618
#%3005514
#!
  
#*Scenario-based verification of real-time systems using Uppaal.
#@Shuhao Li,Sandie Balaguer,Alexandre David,Kim G. Larsen,Brian Nielsen,Saulius Pusinskas
#t2010
#cFormal Methods in System Design
#index2968444
#%49796
#%66600
#%209226
#%209640
#%213512
#%305546
#%581536
#%625277
#%625035
#%635147
#%635259
#%1057041
#%1076529
#%1088805
#%1243830
#%2783110
#!
  
#*Reasoning about memory layouts.
#@Holger Gast
#t2010
#cFormal Methods in System Design
#index2968446
#%79876
#%79905
#%124721
#%202374
#%485149
#%485064
#%500912
#%507755
#%543026
#%546987
#%581591
#%629669
#%646905
#%722016
#%888871
#%974065
#%1124076
#%1214869
#%1243854
#%1247182
#%1256621
#%1271251
#%1271255
#%2854045
#!
  
#*Runtime enforcement monitors: composition, synthesis, and enforcement abilities.
#@Yliès Falcone,Laurent Mounier,Jean-Claude Fernandez,Jean-Luc Richier
#t2011
#cFormal Methods in System Design
#index3068642
#%267592
#%327529
#%543030
#%869676
#%869762
#%1103570
#%1103711
#%1123573
#%1128768
#%1228003
#%1259555
#%3569059
#!
  
#*A WSDL-based type system for asynchronous WS-BPEL processes.
#@Alessandro Lapadula,Rosario Pugliese,Francesco Tiezzi
#t2011
#cFormal Methods in System Design
#index3068641
#%45544
#%66725
#%114151
#%114756
#%114745
#%116405
#%188898
#%189055
#%189065
#%189149
#%209713
#%370892
#%371059
#%546009
#%546061
#%546885
#%581691
#%628099
#%673249
#%774287
#%868624
#%869047
#%869550
#%869559
#%889799
#%925390
#%1057299
#%1092208
#%1128139
#%1227994
#%1280505
#%2819816
#%2864108
#%361965
#!
  
#*MSO logics for weighted timed automata.
#@Karin Quaas
#t2011
#cFormal Methods in System Design
#index3068643
#%722
#%158529
#%212865
#%212830
#%221167
#%257439
#%269400
#%484051
#%879116
#%1088805
#%1088815
#%1090710
#%1207025
#%1243928
#!
  
#*Conjugate symmetry.
#@Peter M. Maurer
#t2011
#cFormal Methods in System Design
#index3068644
#%131579
#%132137
#%132743
#%132996
#%133418
#%133822
#%133948
#%134288
#%142509
#%161238
#%282475
#%282819
#%283094
#%776608
#%879027
#%1015151
#%1016268
#%1082379
#%1117882
#!
  
#*Programs with lists are counter automata.
#@Ahmed Bouajjani,Marius Bozga,Peter Habermehl,Radu Iosif,Pierre Moro,Tomás Vojnar
#t2011
#cFormal Methods in System Design
#index3068639
#%79196
#%79924
#%79948
#%79876
#%114003
#%189102
#%485149
#%538165
#%542750
#%546871
#%572943
#%646862
#%866919
#%1123880
#!
  
#*Faster algorithms for mean-payoff games.
#@Lubos Brim,Jakub Chaloupka,Laurent Doyen,Raffaella Gentilini,Jean-François Raskin
#t2011
#cFormal Methods in System Design
#index3068640
#%79838
#%212850
#%620452
#%622209
#%683435
#%838529
#%861765
#%1013819
#%1095429
#%1252392
#!
  
#*Preface.
#@Armin Biere,Karen Yorav
#t2011
#cFormal Methods in System Design
#index3166008
#% 
#!
  
#*Specification and encoding of transaction interaction properties.
#@Divjyot Sethi,Yogesh S. Mahajan,Sharad Malik
#t2011
#cFormal Methods in System Design
#index3166012
#%71371
#%79291
#%79407
#%86851
#%106098
#%134036
#%209284
#%209290
#%492333
#%543810
#%546913
#%625092
#%929768
#%1239878
#!
  
#*Automatic analysis of DMA races using model checking and -induction.
#@Alastair F. Donaldson,Daniel Kroening,Philipp Rümmer
#t2011
#cFormal Methods in System Design
#index3166005
#% 
#!
  
#*On the refinement of liveness properties of distributed systems.
#@Paul C. Attie
#t2011
#cFormal Methods in System Design
#index3166007
#%74
#%2597
#%40100
#%71766
#%79170
#%114406
#%114600
#%211625
#%219303
#%296637
#%544272
#%546057
#%546502
#%625590
#%888771
#%888770
#%889391
#%933901
#%933902
#%972372
#%1061466
#%1088628
#%1091091
#%1093297
#%1117108
#%1117532
#%1123252
#%1123329
#%1123560
#%1123699
#%1123728
#%1123800
#%1128768
#%3005514
#!
  
#*Incremental preprocessing methods for use in BMC.
#@Stefan Kupferschmid,Matthew D. T. Lewis,Tobias Schubert,Bernd Becker
#t2011
#cFormal Methods in System Design
#index3166010
#%53295
#%79278
#%131474
#%209251
#%209273
#%510335
#%837447
#%878784
#%879022
#%950130
#!
  
#*Verification of continuous dynamical systems by timed automata.
#@Christoffer Sloth,Rafael Wisniewski
#t2011
#cFormal Methods in System Design
#index3166011
#%114054
#%257469
#%717065
#%879130
#%1088805
#!
  
#*Benchmarking a model checker for algorithmic improvements and tuning for performance.
#@Gianpiero Cabodi,Sergio Nocco,Stefano Quer
#t2011
#cFormal Methods in System Design
#index3166004
#%61356
#%79116
#%79298
#%79299
#%79278
#%131474
#%132801
#%141538
#%143708
#%206048
#%209123
#%209156
#%209251
#%283632
#%283866
#%1086789
#%1118060
#%1225835
#%1241473
#%1243869
#%1268180
#%1277988
#%2976371
#!
  
#*Feasibility analysis for robustness quantification by symbolic model checking.
#@Souheib Baarir,Cécile Braunstein,Emmanuelle Encrenaz,Jean-Michel Ilié,Isabelle Mounier,Denis Poitrenaud,Sana Younès
#t2011
#cFormal Methods in System Design
#index3166009
#%79278
#%79788
#%142282
#%143512
#%406435
#%448522
#%625022
#%771309
#%858032
#%952090
#%1053335
#%1118063
#%1123449
#%1167279
#%1241081
#%1241360
#%1305593
#%3080441
#!
  
#*Exploring structural symmetry automatically in symbolic trajectory evaluation.
#@Yongjian Li,William N. N. Hung,Xiaoyu Song,Naiju Zeng
#t2011
#cFormal Methods in System Design
#index3166006
#%79278
#%79644
#%131212
#%133464
#%209282
#%878976
#%878840
#%878921
#%1056997
#%1123906
#%1135671
#!
  
#*Cuts from proofs: a complete and practical technique for solving linear inequalities over integers.
#@Isil Dillig,Thomas Dillig,Alex Aiken
#t2011
#cFormal Methods in System Design
#index3270605
#%79951
#%79897
#%79939
#%131257
#%209223
#%449705
#%546076
#%572946
#%625454
#%644936
#%3007117
#!
  
#*Antichains and compositional algorithms for LTL synthesis.
#@Emmanuel Filiot,Naiyong Jin,Jean-François Raskin
#t2011
#cFormal Methods in System Design
#index3270606
#%58969
#%66708
#%114201
#%114072
#%209268
#%211205
#%211711
#%267163
#%268580
#%269424
#%487226
#%546637
#%625497
#%869842
#%1206099
#%1240160
#%2782377
#%2897976
#!
  
#*Priority scheduling of distributed systems based on model checking.
#@Ananda Basu,Saddek Bensalem,Doron Peled,Joseph Sifakis
#t2011
#cFormal Methods in System Design
#index3270604
#%213549
#%267891
#%546502
#%553006
#%888890
#%934159
#%950577
#%1164750
#%1206120
#%2897970
#!
  
#*Verification of STM on relaxed memory models.
#@Rachid Guerraoui,Thomas A. Henzinger,Vasu Singh
#t2011
#cFormal Methods in System Design
#index3270603
#%9768
#%79968
#%114732
#%360170
#%418901
#%523891
#%542532
#%542802
#%542989
#%543005
#%543024
#%543037
#%543058
#%544061
#%544454
#%546187
#%546505
#%546970
#%546982
#%548417
#%548478
#%548554
#%548549
#%805593
#%951389
#%1080337
#%1080380
#%1128403
#%1206119
#%1212935
#!
  
#*Interrupt Timed Automata: verification and expressiveness.
#@Béatrice Bérard,Serge Haddad,Mathieu Sassolas
#t2012
#cFormal Methods in System Design
#index3321902
#%79330
#%79265
#%79654
#%114146
#%114203
#%211625
#%212852
#%213945
#%221024
#%257862
#%257762
#%553006
#%559529
#%621921
#%625035
#%878797
#%878890
#%881409
#%886899
#%888497
#%889896
#%889996
#%949654
#%951612
#%972199
#%994213
#%1053124
#%1088803
#%1088805
#%1088965
#%1095658
#%3017394
#%3028549
#%3065647
#!
  
#*Transparent partial order reduction.
#@Stephen F. Siegel
#t2012
#cFormal Methods in System Design
#index3321901
#%79716
#%79718
#%213063
#%646803
#%878819
#%879042
#%879063
#%879100
#!
  
#*Explaining counterexamples using causality.
#@Ilan Beer,Shoham Ben-David,Hana Chockler,Avigail Orni,Richard J. Trefler
#t2012
#cFormal Methods in System Design
#index3321904
#%86825
#%131832
#%143015
#%202168
#%211625
#%234493
#%388290
#%486435
#%546006
#%553006
#%573306
#%625241
#%625530
#%815927
#%869484
#%878853
#%950948
#%1076664
#!
  
#*Synthesis of opaque systems with static and dynamic masks.
#@Franck Cassez,Jérémy Dubreil,Hervé Marchand
#t2012
#cFormal Methods in System Design
#index3321903
#%213609
#%267211
#%484469
#%555370
#%623088
#%861765
#%911332
#%970562
#%1095429
#%1103570
#%1164727
#%1237942
#!
  
#*Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation.
#@Silvia Crafa,Francesco Ranzato
#t2012
#cFormal Methods in System Design
#index3400566
#%114735
#%210909
#%213868
#%268083
#%485335
#%546062
#%546057
#%572679
#%887611
#%888651
#%971427
#%1025778
#%1060205
#%1273131
#%3017395
#!
  
#*Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics.
#@Satrajit Chatterjee,Michael Kishinevsky
#t2012
#cFormal Methods in System Design
#index3400568
#%2022
#%79554
#%209251
#%772823
#%1089421
#%2951746
#%2951749
#!
  
#*Symbolic bounded synthesis.
#@Rüdiger Ehlers
#t2012
#cFormal Methods in System Design
#index3400565
#%58969
#%58950
#%79270
#%79330
#%79346
#%79591
#%79599
#%124545
#%143698
#%209268
#%211205
#%211625
#%268862
#%487222
#%544470
#%646765
#%869842
#%889644
#%1078407
#%1088898
#%1206099
#%2778287
#%2897976
#%3006115
#%3017173
#%79819
#!
  
#*Preface.
#@Tayssir Touili
#t2012
#cFormal Methods in System Design
#index3400567
#% 
#!
  
#*Efficient emptiness check for timed Büchi automata.
#@Frédéric Herbreteau,B. Srivathsan,Igor Walukiewicz
#t2012
#cFormal Methods in System Design
#index3400562
#% 
#!
  
#*Fences in weak memory models (extended version).
#@Jade Alglave,Luc Maranget,Susmit Sarkar,Peter Sewell
#t2012
#cFormal Methods in System Design
#index3400571
#%79946
#%418530
#%418876
#%419138
#%543037
#%546505
#%546970
#%614151
#%614016
#%805593
#%811001
#%1080339
#%1123901
#%1124552
#%1256620
#%1321721
#%2778299
#%2850743
#%3006618
#%3026443
#%3563724
#!
  
#*Achieving distributed control through model checking.
#@Susanne Graf,Doron Peled,Sophie Quinton
#t2012
#cFormal Methods in System Design
#index3400561
#%773279
#%810733
#%888890
#%934159
#%1164750
#%1206120
#%2817513
#%2897970
#%3224040
#!
  
#*2010 CAV award announcement.
#@Orna Grumberg,Moshe Y. Vardi,Joseph Sifakis,Rajeev Alur
#t2012
#cFormal Methods in System Design
#index3400570
#%79663
#%79655
#%79658
#%79662
#%86853
#!
  
#*Constructive Boolean circuits and the exactness of timed ternary simulation.
#@Michael Mendler,Thomas R. Shiple,Gérard Berry
#t2012
#cFormal Methods in System Design
#index3400564
#%3391
#%24962
#%77603
#%79693
#%86832
#%133631
#%281781
#%283748
#%285788
#%841422
#%870443
#%887806
#%888930
#%951868
#%1078411
#%1080653
#%1081285
#%1082447
#%3003905
#!
  
#*A concurrency-preserving translation from time Petri nets to networks of timed automata.
#@Sandie Balaguer,Thomas Chatain,Stefan Haar
#t2012
#cFormal Methods in System Design
#index3400569
#%79446
#%79311
#%114738
#%212855
#%220071
#%268234
#%620822
#%824398
#%882102
#%1076700
#%1088805
#%1093142
#%1096176
#%1126611
#%1127508
#%1164819
#%1247126
#%3028550
#!
  
#*Bounded underapproximations.
#@Pierre Ganty,Rupak Majumdar,Benjamin Monmege
#t2012
#cFormal Methods in System Design
#index3400563
#%58874
#%79252
#%219517
#%267404
#%545984
#%615722
#%625473
#%625366
#%909031
#%1123846
#%2778298
#%2950446
#%2972526
#%3224019
#!
  
#*2011 CAV award announcement.
#@Moshe Y. Vardi,Thomas A. Henzinger,Rajeev Alur,Marta Z. Kwiatkowska
#t2012
#cFormal Methods in System Design
#index3485132
#% 
#!
  
#*Forest automata for verification of heap manipulation.
#@Peter Habermehl,Lukás Holík,Adam Rogalewicz,Jirí Simácek,Tomás Vojnar
#t2012
#cFormal Methods in System Design
#index3485129
#%79252
#%79924
#%79948
#%79876
#%485149
#%542750
#%542984
#%543011
#%546991
#%572645
#%625174
#%646852
#%866652
#%1123880
#%2950455
#%3224027
#!
  
#*A formal hierarchy of weak memory models.
#@Jade Alglave
#t2012
#cFormal Methods in System Design
#index3485131
#%79946
#%418530
#%418876
#%419138
#%543037
#%546505
#%546970
#%546982
#%614151
#%614016
#%805593
#%811001
#%1080339
#%1124552
#%1127930
#%1256620
#%2778299
#%2778475
#%2786212
#%2850765
#%3006618
#%3026443
#%3028422
#%3224030
#%3295387
#!
  
#*Counterexample-guided abstraction refinement for symmetric concurrent programs.
#@Alastair F. Donaldson,Alexander Kaiser,Daniel Kroening,Michael Tautschnig,Thomas Wahl
#t2012
#cFormal Methods in System Design
#index3485134
#%53869
#%79474
#%484602
#%542627
#%542317
#%615659
#%625107
#%833266
#%950049
#%955261
#%1095897
#%1117576
#%1123644
#%1214395
#%2778278
#%2778275
#%2900925
#%2921136
#%2950462
#%3014480
#%3169250
#%3224032
#%3224021
#!
  
#*Probabilistic contracts for component-based design.
#@Gregor Gößler,Dana N. Xu,Alain Girault
#t2012
#cFormal Methods in System Design
#index3485135
#%114050
#%181456
#%221164
#%615651
#%1056823
#%1123772
#%1243918
#%1309628
#%2774808
#%2817501
#%2897982
#%2950618
#%2968451
#!
  
#*A divide-and-conquer approach for analysing overlaid data structures.
#@Oukseh Lee,Hongseok Yang,Rasmus Petersen
#t2012
#cFormal Methods in System Design
#index3485125
#%79948
#%485149
#%542398
#%546062
#%546688
#%546991
#%625096
#%625178
#%646727
#%1123880
#%1129995
#%1310050
#%2812579
#%2897457
#%3148361
#%3224033
#!
  
#*Unified QBF certification and its applications.
#@Valeriy Balabanov,Jie-Hong R. Jiang
#t2012
#cFormal Methods in System Design
#index3485126
#%53177
#%53951
#%143698
#%283442
#%387555
#%573094
#%573306
#%573291
#%887427
#%952254
#%952375
#%954611
#%2792775
#%2847361
#%3224003
#!
  
#*Deadlock-freedom in component systems with architectural constraints.
#@Moritz Martens,Mila E. Majster-Cederbaum
#t2012
#cFormal Methods in System Design
#index3485130
#%2597
#%79336
#%79409
#%79455
#%79716
#%131520
#%181484
#%202165
#%211625
#%366724
#%484554
#%486435
#%546057
#%581642
#%601059
#%612353
#%612304
#%612300
#%646731
#%832306
#%832435
#%869716
#%878885
#%888440
#%1056823
#%1060205
#%1078407
#%1123333
#%1123339
#%1123303
#%1123407
#%1123647
#%1123449
#%1124216
#%1128058
#%1130059
#%1258371
#%1262228
#%1262223
#%1262226
#%3005514
#%3408430
#!
  
#*Temporal property verification as a program analysis task - Extended Version.
#@Byron Cook,Eric Koskinen,Moshe Y. Vardi
#t2012
#cFormal Methods in System Design
#index3485128
#% 
#!
  
#*Preface.
#@Ganesh Gopalakrishnan,Shaz Qadeer
#t2012
#cFormal Methods in System Design
#index3485133
#% 
#!
  
#*Recognizing malicious software behaviors with tree automata inference.
#@Domagoj Babic,Daniel Reynaud,Dawn Song
#t2012
#cFormal Methods in System Design
#index3485127
#%2023
#%53759
#%84057
#%156486
#%192497
#%450841
#%499133
#%542588
#%542739
#%601428
#%613436
#%613453
#%613791
#%613935
#%773331
#%973153
#%1031636
#%1131626
#%2816330
#%2951686
#%3055221
#%3224022
#!
  
#*Introduction to the special issue on runtime verification.
#@Oleg Sokolsky,Grigore Rosu
#t2012
#cFormal Methods in System Design
#index3597170
#%173332
#%202578
#%448733
#%521809
#%625157
#%878967
#%1129776
#%2852416
#%2910246
#%2925803
#%3398728
#!
  
#*InterAspect: aspect-oriented instrumentation with GCC.
#@Justin Seyster,Ketan Dixit,Xiaowan Huang,Radu Grosu,Klaus Havelund,Scott A. Smolka,Scott D. Stoller,Erez Zadok
#t2012
#cFormal Methods in System Design
#index3597174
#%43161
#%43124
#%81414
#%172929
#%173081
#%451065
#%521992
#%521809
#%522960
#%601166
#%691531
#%1004534
#%2910245
#%3398721
#%3398728
#%601332
#!
  
#*Optimized temporal monitors for SystemC.
#@Deian Tabakov,Kristin Y. Rozier,Moshe Y. Vardi
#t2012
#cFormal Methods in System Design
#index3597172
#%58970
#%79122
#%79381
#%142571
#%202562
#%219344
#%471498
#%487357
#%489458
#%555036
#%615547
#%615707
#%625454
#%832306
#%858115
#%868834
#%878842
#%878979
#%878793
#%889644
#%1078407
#%1083218
#%1117742
#%1243877
#%3026465
#%3398728
#%2925775
#!
  
#*Safer asynchronous runtime monitoring using compensations.
#@Christian Colombo,Gordon J. Pace,Patrick Abela
#t2012
#cFormal Methods in System Design
#index3597171
#%65694
#%365225
#%472053
#%546009
#%588606
#%598693
#%625157
#%628121
#%628073
#%628263
#%642677
#%761025
#%1016678
#%1116417
#%1127394
#%1259255
#%1309626
#%2910226
#%2910240
#!
  
#*Efficient data race detection for async-finish parallelism.
#@Raghavan Raman,Jisheng Zhao,Vivek Sarkar,Martin T. Vechev,Eran Yahav
#t2012
#cFormal Methods in System Design
#index3597173
#%77273
#%189125
#%466761
#%521983
#%533804
#%542575
#%548304
#%548521
#%614245
#%614717
#%805851
#%949812
#%951702
#%1212935
#%1250599
#%1253605
#%1253581
#%1308976
#%2906174
#%2910234
#%3433649
#!
  
#*Symbolic backward reachability with effectively propositional logic - Applications to security policy analysis.
#@Silvio Ranise
#t2013
#cFormal Methods in System Design
#index3624501
#% 
#!
  
#*Efficiently solving quantified bit-vector formulas.
#@Christoph M. Wintersteiger,Youssef Hamadi,Leonardo Mendon?a de Moura
#t2013
#cFormal Methods in System Design
#index3624502
#%72110
#%79397
#%79914
#%79897
#%209268
#%486641
#%543020
#%546637
#%573119
#%573306
#%573117
#%625454
#%625471
#%646924
#%1086737
#%1206133
#%1212914
#%1213306
#%1268174
#%1321691
#%2798461
#%2812642
#%2817499
#%2939817
#!
  
#*SMT proof checking using a logical framework.
#@Aaron Stump,Duckki Oe,Andrew Reynolds,Liana Hadarean,Cesare Tinelli
#t2013
#cFormal Methods in System Design
#index3624500
#%3449
#%71406
#%71975
#%79897
#%209406
#%452729
#%485118
#%542559
#%546430
#%546566
#%546564
#%546921
#%615542
#%625231
#%625230
#%625457
#%878784
#%950598
#%951931
#%1206009
#%1206007
#%1212909
#%1243881
#%1256321
#%2810523
#%2842660
#%2976538
#%3180240
#%3206768
#!
  
#*Preface to the special issue "SI: Satisfiability Modulo Theories".
#@Ofer Strichman,Daniel Kroening
#t2013
#cFormal Methods in System Design
#index3624499
#%71183
#%79157
#%79429
#%79813
#%133250
#%2939817
#%3001301
#!
  
#*SMT-based scenario verification for hybrid systems.
#@Alessandro Cimatti,Sergio Mover,Stefano Tonetta
#t2013
#cFormal Methods in System Design
#index3624497
#%62076
#%72142
#%79330
#%79474
#%79839
#%114047
#%114078
#%212773
#%212962
#%220071
#%484790
#%487425
#%625277
#%646723
#%818509
#%866391
#%867387
#%878803
#%879104
#%1086922
#%1126586
#%1129769
#%1206103
#%1243864
#%1326250
#%2787772
#%2968444
#%3224031
#%3239219
#%3449903
#%3496152
#!
  
#*Being careful about theory combination.
#@Dejan Jovanovic,Clark Barrett
#t2013
#cFormal Methods in System Design
#index3624498
#%79897
#%216934
#%390617
#%487052
#%625454
#%625471
#%646905
#%869932
#%889886
#%1123789
#%1332063
#%2905304
#%3212183
#!
  
#*A Simplex-Based Tabu Search Method for Capacitated Network Design.
#@Teodor Gabriel Crainic,Michel Gendreau,Judith M. Farvolden
#t2000
#cINFORMS Journal on Computing
#index924021
#% 
#!
  
#*Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
#@Karen Aardal,Robert E. Bixby,Cor A. J. Hurkens,Arjen K. Lenstra,Job W. Smeltink
#t2000
#cINFORMS Journal on Computing
#index924022
#% 
#!
  
#*Meta-Heuristics for a Class of Demand-Responsive Transit Systems.
#@Teodor Gabriel Crainic,Federico Malucelli,Maddalena Nonato,François Guertin
#t2005
#cINFORMS Journal on Computing
#index924023
#%12023
#!
  
#*An Improved Augmented Neural-Network Approach for Scheduling Problems.
#@Anurag Agarwal,Varghese S. Jacob,Hasan Pirkul
#t2006
#cINFORMS Journal on Computing
#index924024
#%769484
#%885473
#%1080064
#%1127700
#!
  
#*A New Genetic Algorithm for the Quadratic Assignment Problem.
#@Zvi Drezner
#t2003
#cINFORMS Journal on Computing
#index924025
#% 
#!
  
#*Developing Fitter Genetic Algorithms.
#@Ravindra K. Ahuja,James B. Orlin
#t1997
#cINFORMS Journal on Computing
#index924026
#% 
#!
  
#*Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron.
#@José H. Dulá,Francisco J. López
#t2006
#cINFORMS Journal on Computing
#index924027
#%3482
#!
  
#*GRASP with Path Relinking for Three-Index Assignment.
#@Renata M. Aiex,Mauricio G. C. Resende,Panos M. Pardalos,Gerardo Toraldo
#t2005
#cINFORMS Journal on Computing
#index924028
#% 
#!
  
#*How Much Communication Does Parallel Branch and Bound Need?
#@Jonathan Eckstein
#t1997
#cINFORMS Journal on Computing
#index924029
#% 
#!
  
#*Time-Indexed Formulations for Machine Scheduling Problems: Column Generation.
#@Marjan van den Akker,Cor A. J. Hurkens,Martin W. P. Savelsbergh
#t2000
#cINFORMS Journal on Computing
#index924030
#% 
#!
  
#*A New Formulation and Resolution Method for the p-Center Problem.
#@Sourour Elloumi,Martine Labbé,Yves Pochet
#t2004
#cINFORMS Journal on Computing
#index924031
#% 
#!
  
#*Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem.
#@Marjan van den Akker,Han Hoogeveen,Steef L. van de Velde
#t2002
#cINFORMS Journal on Computing
#index924032
#% 
#!
  
#*Statistical Analysis of Computational Tests of Algorithms and Heuristics.
#@Marie Coffin,Matthew J. Saltzman
#t2000
#cINFORMS Journal on Computing
#index924033
#% 
#!
  
#*Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment.
#@Eva K. Lee
#t2004
#cINFORMS Journal on Computing
#index924034
#% 
#!
  
#*Properties of Batched Quadratic-Form Variance Parameter Estimators for Simulations.
#@Christos Alexopoulos,David Goldsman,Gamze Tokol
#t2001
#cINFORMS Journal on Computing
#index924035
#% 
#!
  
#*The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping.
#@Diane L. Evans,Lawrence Leemis,John H. Drew
#t2006
#cINFORMS Journal on Computing
#index924036
#% 
#!
  
#*Vector Quantization for Arbitrary Distance Function Estimation.
#@I. Kuban Altinel,B. John Oommen,Necati Aras
#t1997
#cINFORMS Journal on Computing
#index924037
#% 
#!
  
#*Guided Local Search for the Three-Dimensional Bin-Packing Problem.
#@Oluf Faroe,David Pisinger,Martin Zachariasen
#t2003
#cINFORMS Journal on Computing
#index924038
#% 
#!
  
#*Protein Threading: From Mathematical Models to Parallel Implementations.
#@Rumen Andonov,Stefan Balev,Nicola Yanev
#t2004
#cINFORMS Journal on Computing
#index924039
#%411261
#%892139
#%1088697
#!
  
#*A MINSAT Approach for Learning in Logic Domains.
#@Giovanni Felici,Klaus Truemper
#t2002
#cINFORMS Journal on Computing
#index924040
#% 
#!
  
#*Simulation Optimization: Integrating Research and Practice.
#@Sigrún Andradóttir
#t2002
#cINFORMS Journal on Computing
#index924041
#% 
#!
  
#*An Implementation of the Batch Means Method.
#@George S. Fishman,L. Stephen Yarberry
#t1997
#cINFORMS Journal on Computing
#index924042
#% 
#!
  
#*A New Mathematical-Programming Framework for Facility-Layout Design.
#@Miguel F. Anjos,Anthony Vannelli
#t2006
#cINFORMS Journal on Computing
#index924043
#%813037
#%836004
#%1290039
#!
  
#*A Parallel Implementation of the GTH Algorithm.
#@David M. Cohen,Daniel P. Heyman,Asya Rabinovitch,Danit Brown
#t1997
#cINFORMS Journal on Computing
#index924044
#% 
#!
  
#*Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming.
#@Minghe Sun
#t2005
#cINFORMS Journal on Computing
#index924045
#%812324
#%813716
#%814039
#%813869
#%951226
#%1288595
#%3006562
#!
  
#*Solution of a Min-Max Vehicle Routing Problem.
#@David Applegate,William J. Cook,Sanjeeb Dash,André Rohe
#t2002
#cINFORMS Journal on Computing
#index924046
#% 
#!
  
#*A Hybrid Exact Algorithm for the TSPTW.
#@Filippo Focacci,Andrea Lodi,Michela Milano
#t2002
#cINFORMS Journal on Computing
#index924047
#% 
#!
  
#*Chained Lin-Kernighan for Large Traveling Salesman Problems.
#@David Applegate,William J. Cook,André Rohe
#t2003
#cINFORMS Journal on Computing
#index924048
#% 
#!
  
#*A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints.
#@John J. H. Forrest,Jayant Kalagnanam,Laszlo Ladányi
#t2006
#cINFORMS Journal on Computing
#index924049
#%3007117
#!
  
#*On a New Collection of Stochastic Linear Programming Test Problems.
#@K. A. Ariyawansa,Andrew J. Felt
#t2004
#cINFORMS Journal on Computing
#index924050
#% 
#!
  
#*Extending an Algebraic Modeling Language to Support Constraint Programming.
#@Robert Fourer,David M. Gay
#t2002
#cINFORMS Journal on Computing
#index924051
#% 
#!
  
#*Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints.
#@Abdullah N. Arslan,Ömer Egecioglu
#t2004
#cINFORMS Journal on Computing
#index924052
#%522
#%118689
#%932705
#!
  
#*LPFML: A W3C XML Schema for Linear and Integer Programming.
#@Robert Fourer,Leo Lopes,R. Kipp Martin
#t2005
#cINFORMS Journal on Computing
#index924053
#% 
#!
  
#*Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems.
#@Pasquale Avella,Maurizio Boccia,Bernardo D'Auria
#t2005
#cINFORMS Journal on Computing
#index924054
#% 
#!
  
#*A Computational Study of Cost Reoptimization for Min-Cost Flow Problems.
#@Antonio Frangioni,Antonio Manca
#t2006
#cINFORMS Journal on Computing
#index924055
#%836524
#%953002
#%1275172
#%3004712
#%3005546
#!
  
#*The Minmax Relative Regret Median Problem on Networks.
#@Igor Averbakh
#t2005
#cINFORMS Journal on Computing
#index924056
#%832216
#%835959
#%924059
#%950099
#%951147
#!
  
#*Feature Article: Optimization for simulation: Theory vs. Practice.
#@Michael C. Fu
#t2002
#cINFORMS Journal on Computing
#index924057
#% 
#!
  
#*Subject Classification and Key Word Index to Volume 12.
#@
#t2000
#cINFORMS Journal on Computing
#index924058
#% 
#!
  
#*Minmax Regret Median Location on a Network Under Uncertainty.
#@Igor Averbakh,Oded Berman
#t2000
#cINFORMS Journal on Computing
#index924059
#% 
#!
  
#*Simulation Optimization in the Future: Evolution or Revolution?
#@Michael C. Fu
#t2002
#cINFORMS Journal on Computing
#index924060
#% 
#!
  
#*Institute for Operations Research and the Management Sciences.
#@
#t2003
#cINFORMS Journal on Computing
#index924061
#% 
#!
  
#*A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination.
#@Djangir A. Babayev,Fred Glover,Jennifer Ryan
#t1997
#cINFORMS Journal on Computing
#index924062
#% 
#!
  
#*A Genetic Algorithm-Based Approach for Building Accurate Decision Trees.
#@Zhiwei Fu,Bruce L. Golden,Shreevardhan Lele,S. Raghavan,Edward A. Wasil
#t2003
#cINFORMS Journal on Computing
#index924063
#% 
#!
  
#*A Mathematical Programming Approach to Data Base Normalization.
#@Mohan Bala,R. Kipp Martin
#t1997
#cINFORMS Journal on Computing
#index924064
#% 
#!
  
#*An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem.
#@Luca Maria Gambardella,Marco Dorigo
#t2000
#cINFORMS Journal on Computing
#index924065
#% 
#!
  
#*Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.
#@Egon Balas,Neil Simonetti
#t2001
#cINFORMS Journal on Computing
#index924066
#% 
#!
  
#*In Memoriam: Carl M. Harris.
#@Saul I. Gass,Donald Gross
#t2000
#cINFORMS Journal on Computing
#index924067
#% 
#!
  
#*Fault-Tolerant Virtual Path Layout in ATM Networks.
#@Michael O. Ball,Andrew Vakhutinsky
#t2001
#cINFORMS Journal on Computing
#index924068
#% 
#!
  
#*Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
#@Celia A. Glass,Chris N. Potts,Vitaly A. Strusevich
#t2001
#cINFORMS Journal on Computing
#index924069
#% 
#!
  
#*A Parametric Optimization Method for Machine Learning.
#@Kristin P. Bennett,Erin J. Bredensteiner
#t1997
#cINFORMS Journal on Computing
#index924070
#% 
#!
  
#*A Generalized Univariate Change-of-Variable Transformation Technique.
#@Andrew G. Glen,Lawrence Leemis,John H. Drew
#t1997
#cINFORMS Journal on Computing
#index924071
#% 
#!
  
#*The Filtered Nearest Neighbor Method for Generating Low-Discrepancy Sequences.
#@Mihoko V. Bennett,Thomas R. Willemain
#t2004
#cINFORMS Journal on Computing
#index924072
#% 
#!
  
#*Additional Perspectives on Simulation for Optimization.
#@Peter W. Glynn
#t2002
#cINFORMS Journal on Computing
#index924073
#% 
#!
  
#*Art Gallery Problems for Convex Nested Polygons.
#@Joy Bhadury,V. Chandru,A. Maheshwari,Ramaswamy Chandrasekaran
#t1997
#cINFORMS Journal on Computing
#index924074
#% 
#!
  
#*Heuristic Search for the Generalized Minimum Spanning Tree Problem.
#@Bruce L. Golden,S. Raghavan,Daliborka Stanojevic
#t2005
#cINFORMS Journal on Computing
#index924075
#%140
#%950692
#%3005546
#!
  
#*Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem.
#@Alain Billionnet,Éric Soutif
#t2004
#cINFORMS Journal on Computing
#index924076
#% 
#!
  
#*Ranking and Selection for Steady-State Simulation: Procedures and Perspectives.
#@David Goldsman,Seong-Hee Kim,William S. Marshall,Barry L. Nelson
#t2002
#cINFORMS Journal on Computing
#index924077
#% 
#!
  
#*Stochastic Programming Computation and Applications.
#@John R. Birge
#t1997
#cINFORMS Journal on Computing
#index924078
#% 
#!
  
#*Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method.
#@Jacek Gondzio
#t1997
#cINFORMS Journal on Computing
#index924079
#% 
#!
  
#*Computing Gradients in Large-Scale Optimization Using Automatic Differentiation.
#@Christian H. Bischof,Ali Bouaricha,Peyvand M. Khademi,Jorge J. Moré
#t1997
#cINFORMS Journal on Computing
#index924080
#% 
#!
  
#*Cascade Graphs: Design, Analysis and Algorithms for Relational Joins.
#@Ram D. Gopal,Ram Ramesh,Stanley Zionts
#t2001
#cINFORMS Journal on Computing
#index924081
#% 
#!
  
#*Parallelizing the Dual Simplex Method.
#@Robert E. Bixby,Alexander Martin
#t2000
#cINFORMS Journal on Computing
#index924082
#% 
#!
  
#*Technical Note on "Optimal Integer Solutions to Industrial Cutting Stock Problems" by Degraeve and Schrage.
#@Constantine N. Goulimis
#t2001
#cINFORMS Journal on Computing
#index924083
#% 
#!
  
#*DNA Sequencing - Tabu and Scatter Search Combined.
#@Jacek Blazewicz,Fred Glover,Marta Kasprzak
#t2004
#cINFORMS Journal on Computing
#index924084
#% 
#!
  
#*The Use of Eigenvalues for Finding Equilibrium Probabilities of Certain Markovian Two-Dimensional Queueing Problems.
#@Winfried K. Grassmann
#t2003
#cINFORMS Journal on Computing
#index924085
#% 
#!
  
#*The Online TSP Against Fair Adversaries.
#@Michiel Blom,Sven Oliver Krumke,Willem de Paepe,Leen Stougie
#t2001
#cINFORMS Journal on Computing
#index924086
#% 
#!
  
#*Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination.
#@Genetha Anne Gray,Tamara G. Kolda,Ken Sale,Malin M. Young
#t2004
#cINFORMS Journal on Computing
#index924087
#%530481
#%1034701
#%1121779
#%2892126
#%2892197
#!
  
#*A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows.
#@Olli Bräysy
#t2003
#cINFORMS Journal on Computing
#index924088
#% 
#!
  
#*An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem.
#@Richard K. Congram,Chris N. Potts,Steef L. van de Velde
#t2002
#cINFORMS Journal on Computing
#index924089
#% 
#!
  
#*Institute for Operations Research and the Management Sciences.
#@
#t2003
#cINFORMS Journal on Computing
#index924090
#% 
#!
  
#*Minimax Models for Diverse Routing.
#@James P. Brumbaugh-Smith,Douglas R. Shier
#t2002
#cINFORMS Journal on Computing
#index924091
#% 
#!
  
#*From the Guest Editor for the Special Issue on Computational Molecular Biology/Bioinformatics.
#@Harvey J. Greenberg
#t2004
#cINFORMS Journal on Computing
#index924092
#% 
#!
  
#*A General Purpose Algorithm for Three-Dimensional Packing.
#@Lorenzo Brunetta,Philippe Grégoire
#t2005
#cINFORMS Journal on Computing
#index924093
#%924038
#!
  
#*Opportunities for Combinatorial Optimization in Computational Biology.
#@Harvey J. Greenberg,William E. Hart,Giuseppe Lancia
#t2004
#cINFORMS Journal on Computing
#index924094
#% 
#!
  
#*Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models.
#@Peter Buchholz,Gianfranco Ciardo,Susanna Donatelli,Peter Kemper
#t2000
#cINFORMS Journal on Computing
#index924095
#% 
#!
  
#*Selecting Scheduling Heuristics Using Neural Networks.
#@Jatinder N. D. Gupta,Randall S. Sexton,Enar A. Tunc
#t2000
#cINFORMS Journal on Computing
#index924096
#% 
#!
  
#*MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming.
#@Michael R. Bussieck,Arne Stolbjerg Drud,Alexander Meeraus
#t2003
#cINFORMS Journal on Computing
#index924097
#% 
#!
  
#*K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau.
#@Gérard Cornuéjols,Yanjun Li,Dieter Vandenbussche
#t2003
#cINFORMS Journal on Computing
#index924098
#% 
#!
  
#*Designing Communication Networks to Decompose Network Control Problems.
#@Eduardo Camponogara,Sarosh Talukdar
#t2005
#cINFORMS Journal on Computing
#index924099
#% 
#!
  
#*The Fine Structure of Galls in Phylogenetic Networks.
#@Dan Gusfield,Satish Eddhu,Charles H. Langley
#t2004
#cINFORMS Journal on Computing
#index924100
#%522
#%120952
#%836645
#%837385
#!
  
#*Context-Independent Scatter and Tabu Search for Permutation Problems.
#@Vicente Campos,Manuel Laguna,Rafael Martí
#t2005
#cINFORMS Journal on Computing
#index924101
#%28124
#%813318
#%836942
#!
  
#*A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management.
#@Walter J. Gutjahr,Christine Strauss,Eric Wagner
#t2000
#cINFORMS Journal on Computing
#index924102
#% 
#!
  
#*Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems.
#@Paola Cappanera,Antonio Frangioni
#t2003
#cINFORMS Journal on Computing
#index924103
#% 
#!
  
#*Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis.
#@Carl M. Harris,Percy H. Brill,Martin J. Fischer
#t2000
#cINFORMS Journal on Computing
#index924104
#% 
#!
  
#*A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem.
#@Paola Cappanera,Marco Trubian
#t2005
#cINFORMS Journal on Computing
#index924105
#%14938
#%836336
#%885431
#!
  
#*Constraint and Integer Programming in OPL.
#@Pascal Van Hentenryck
#t2002
#cINFORMS Journal on Computing
#index924106
#% 
#!
  
#*The Reversal Median Problem.
#@Alberto Caprara
#t2003
#cINFORMS Journal on Computing
#index924107
#% 
#!
  
#*Planar Branch Decompositions I: The Ratcatcher.
#@Illya V. Hicks
#t2005
#cINFORMS Journal on Computing
#index924108
#%267430
#%481074
#%493212
#%610092
#%622994
#%887537
#%924110
#%924114
#%952621
#%952731
#%952733
#%974396
#%975823
#%977718
#%977721
#%977717
#%977921
#%978210
#%1058651
#%1061748
#!
  
#*Sorting Permutations by Reversals Through Branch-and-Price.
#@Alberto Caprara,Giuseppe Lancia,See-Kiong Ng
#t2001
#cINFORMS Journal on Computing
#index924109
#% 
#!
  
#*Planar Branch Decompositions II: The Cycle Method.
#@Illya V. Hicks
#t2005
#cINFORMS Journal on Computing
#index924110
#%610092
#%924108
#%924114
#%952621
#%975823
#%977721
#%977717
#!
  
#*Laying Out Sparse Graphs with Provably Minimum Bandwidth.
#@Alberto Caprara,Juan José Salazar González
#t2005
#cINFORMS Journal on Computing
#index924111
#%211907
#%556712
#%809450
#%851240
#%971902
#%1060570
#%1089475
#%1121352
#!
  
#*The Bounded Cycle-Cover Problem.
#@Dorit S. Hochbaum,Eli V. Olinick
#t2001
#cINFORMS Journal on Computing
#index924112
#% 
#!
  
#*Using Extra Dual Cuts to Accelerate Column Generation.
#@José M. Valério de Carvalho
#t2005
#cINFORMS Journal on Computing
#index924113
#% 
#!
  
#*Tour Merging via Branch-Decomposition.
#@William Cook,Paul D. Seymour
#t2003
#cINFORMS Journal on Computing
#index924114
#% 
#!
  
#*From the Editor.
#@
#t2003
#cINFORMS Journal on Computing
#index924115
#% 
#!
  
#*A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services.
#@Srinivasan R. Chakravarthy,Lan Bin
#t1997
#cINFORMS Journal on Computing
#index924116
#% 
#!
  
#*Early Estimates of the Size of Branch-and-Bound Trees.
#@Gérard Cornuéjols,Miroslav Karamanov,Yanjun Li
#t2006
#cINFORMS Journal on Computing
#index924117
#%13867
#%988418
#%1058885
#%3007117
#!
  
#*On the Design Problem of Multitechnology Networks.
#@Steven Chamberland,Brunilde Sansò
#t2001
#cINFORMS Journal on Computing
#index924118
#% 
#!
  
#*An Ejection Chain Approach for the Generalized Assignment Problem.
#@Mutsunori Yagiura,Toshihide Ibaraki,Fred Glover
#t2004
#cINFORMS Journal on Computing
#index924119
#% 
#!
  
#*Institute for Operations Research and the Management Sciences.
#@
#t2003
#cINFORMS Journal on Computing
#index924120
#% 
#!
  
#*Isotonic Separation.
#@Ramaswamy Chandrasekaran,Young U. Ryu,Varghese S. Jacob,Sungchul Hong
#t2005
#cINFORMS Journal on Computing
#index924121
#%2360
#%310653
#%310823
#%326607
#%334563
#%744923
#%798722
#%839546
#%1009652
#%1009807
#%1045866
#%1113225
#%1275197
#!
  
#*A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation.
#@Kaj Holmberg,Di Yuan
#t2003
#cINFORMS Journal on Computing
#index924122
#% 
#!
  
#*An Integrated Modeling System for Structured Modeling Using Model Graphs.
#@Kaushal Chari,Tarun K. Sen
#t1997
#cINFORMS Journal on Computing
#index924123
#% 
#!
  
#*Non-Approximability Results for Scheduling Problems with Minsum Criteria.
#@Han Hoogeveen,Petra Schuurman,Gerhard J. Woeginger
#t2001
#cINFORMS Journal on Computing
#index924124
#% 
#!
  
#*Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m.
#@Mohan L. Chaudhry,Umesh Chandra Gupta,V. Goswami
#t2001
#cINFORMS Journal on Computing
#index924125
#% 
#!
  
#*Earliness-Tardiness Scheduling Around Almost Equal Due Dates.
#@Han Hoogeveen,Steef L. van de Velde
#t1997
#cINFORMS Journal on Computing
#index924126
#% 
#!
  
#*A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies.
#@Bernard Chazelle,Carl Kingsford,Mona Singh
#t2004
#cINFORMS Journal on Computing
#index924127
#%210580
#%558704
#%623256
#%624227
#%798622
#%811846
#%818078
#%861924
#%949573
#%949575
#%950456
#%950840
#%1025693
#!
  
#*Logic, Optimization, and Constraint Programming.
#@John N. Hooker
#t2002
#cINFORMS Journal on Computing
#index924128
#% 
#!
  
#*Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations.
#@Huifen Chen
#t2001
#cINFORMS Journal on Computing
#index924129
#% 
#!
  
#*A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization.
#@David G. Humphrey,James R. Wilson
#t2000
#cINFORMS Journal on Computing
#index924130
#% 
#!
  
#*Palindromes in SARS and Other Coronaviruses.
#@David S. H. Chew,Kwok Pui Choi,Hans Heidner,Ming-Ying Leung
#t2004
#cINFORMS Journal on Computing
#index924131
#% 
#!
  
#*Execution Conditions: A Formalization of Event Cancellation in Simulation Graphs.
#@Ricki G. Ingalls,Douglas J. Morrice,Enver Yücesan,Andrew B. Whinston
#t2003
#cINFORMS Journal on Computing
#index924132
#% 
#!
  
#*A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows.
#@Wen-Chyuan Chiang,Robert A. Russell
#t1997
#cINFORMS Journal on Computing
#index924133
#% 
#!
  
#*Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems.
#@Vipul Jain,Ignacio E. Grossmann
#t2001
#cINFORMS Journal on Computing
#index924134
#% 
#!
  
#*Fast Heuristics for the Maximum Feasible Subsystem Problem.
#@John W. Chinneck
#t2001
#cINFORMS Journal on Computing
#index924135
#% 
#!
  
#*Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition.
#@Ellis L. Johnson,George L. Nemhauser,Martin W. P. Savelsbergh
#t2000
#cINFORMS Journal on Computing
#index924136
#% 
#!
  
#*From the Guest Editor: Special Issue on the Merging of Mathematical Programming and Constraint Programming.
#@John W. Chinneck
#t2002
#cINFORMS Journal on Computing
#index924137
#% 
#!
  
#*A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions.
#@Joni L. Jones,Gary J. Koehler
#t2005
#cINFORMS Journal on Computing
#index924138
#%13213
#%15203
#%592912
#%592899
#%745808
#%857168
#%857653
#%924261
#%924136
#%2884542
#!
  
#*The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs.
#@John W. Chinneck
#t2004
#cINFORMS Journal on Computing
#index924139
#% 
#!
  
#*Multiple Sequence Alignment as a Facility-Location Problem.
#@Winfried Just,Gianluca Della Vedova
#t2004
#cINFORMS Journal on Computing
#index924140
#%92852
#%952980
#%953199
#%972490
#%1060654
#%1089071
#%1089549
#%1093314
#%1341888
#!
  
#*Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program.
#@John W. Chinneck
#t1997
#cINFORMS Journal on Computing
#index924141
#% 
#!
  
#*A Tabu-Search Heuristic for the Dynamic Plant Layout Problem.
#@Bharat K. Kaku,Joseph B. Mazzola
#t1997
#cINFORMS Journal on Computing
#index924142
#% 
#!
  
#*A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem.
#@Geon Cho,Dong X. Shaw
#t1997
#cINFORMS Journal on Computing
#index924143
#% 
#!
  
#*Solving Graph Bisection Problems with Semidefinite Programming.
#@Stefan E. Karisch,Franz Rendl,Jens Clausen
#t2000
#cINFORMS Journal on Computing
#index924144
#% 
#!
  
#*A Two-Moment Approximation for the Queue with Finite Capacity.
#@Dae W. Choi,Nam K. Kim,Kyung C. Chae
#t2005
#cINFORMS Journal on Computing
#index924145
#% 
#!
  
#*Simulation Optimization is Evolving.
#@James P. Kelly
#t2002
#cINFORMS Journal on Computing
#index924146
#% 
#!
  
#*Probabilistic Scaling for the Numerical Inversion of Nonprobability Transforms.
#@Gagan L. Choudhury,Ward Whitt
#t1997
#cINFORMS Journal on Computing
#index924147
#% 
#!
  
#*Toward a Taxonomy of Parallel Tabu Search Heuristics.
#@Teodor Gabriel Crainic,Michel Toulouse,Michel Gendreau
#t1997
#cINFORMS Journal on Computing
#index924148
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2001
#cINFORMS Journal on Computing
#index924149
#% 
#!
  
#*Estimating Waiting Times from Transactional Data.
#@Daryl J. Daley,Leslie D. Servi
#t1997
#cINFORMS Journal on Computing
#index924150
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2001
#cINFORMS Journal on Computing
#index924151
#% 
#!
  
#*Handling Sensor Data in Rapidly Changing Environments to Support Soft Real-Time Requirements.
#@Anindya Datta,Igor R. Viguier
#t2000
#cINFORMS Journal on Computing
#index924152
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2001
#cINFORMS Journal on Computing
#index924153
#% 
#!
  
#*Efficient Intelligent Backtracking Using Linear Programming.
#@Bruce Davey,Natashia Boland,Peter J. Stuckey
#t2002
#cINFORMS Journal on Computing
#index924154
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2002
#cINFORMS Journal on Computing
#index924155
#% 
#!
  
#*Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results.
#@Zeger Degraeve,Marc Peeters
#t2003
#cINFORMS Journal on Computing
#index924156
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2002
#cINFORMS Journal on Computing
#index924157
#% 
#!
  
#*Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem.
#@Sophie Demassey,Christian Artigues,Philippe Michelon
#t2005
#cINFORMS Journal on Computing
#index924158
#%406918
#%839414
#%2884818
#!
  
#*From the Editor.
#@W. David Kelton
#t2002
#cINFORMS Journal on Computing
#index924159
#% 
#!
  
#*The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach.
#@Michel Denault,Jean-Louis Goffin
#t2005
#cINFORMS Journal on Computing
#index924160
#% 
#!
  
#*Appreciation to Referees.
#@W. David Kelton
#t2002
#cINFORMS Journal on Computing
#index924161
#% 
#!
  
#*Symbolic Computation of Moments in Priority Queues.
#@Steve Derkic,James E. Stafford
#t2002
#cINFORMS Journal on Computing
#index924162
#% 
#!
  
#*Calculating the Distribution of a Linear Combination of Uniform Order Statistics.
#@Morganna C. Diniz,Edmundo de Souza e Silva,H. Richard Gail
#t2002
#cINFORMS Journal on Computing
#index924163
#% 
#!
  
#*Appreciation to Referees.
#@
#t2003
#cINFORMS Journal on Computing
#index924164
#% 
#!
  
#*An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems.
#@Bryan L. Deuermeyer,Guy L. Curry,Andrew T. Duchowski,Srilakshmi Venkatesh
#t1997
#cINFORMS Journal on Computing
#index924165
#% 
#!
  
#*Global Optimization of Morse Clusters by Potential Energy Transformations.
#@Jonathan P. K. Doye,Robert H. Leary,Marco Locatelli,Fabio Schoen
#t2004
#cINFORMS Journal on Computing
#index924166
#%3457845
#%3457847
#!
  
#*Author Index.
#@
#t2003
#cINFORMS Journal on Computing
#index924167
#% 
#!
  
#*Approximation of Point Sets by 1-Corner Polygonal Chains.
#@José Miguel Díaz-Báñez,Francisco Gómez,Ferran Hurtado
#t2000
#cINFORMS Journal on Computing
#index924168
#% 
#!
  
#*Key Word Index.
#@
#t2003
#cINFORMS Journal on Computing
#index924169
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2003
#cINFORMS Journal on Computing
#index924170
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2003
#cINFORMS Journal on Computing
#index924171
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2004
#cINFORMS Journal on Computing
#index924172
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2004
#cINFORMS Journal on Computing
#index924173
#% 
#!
  
#*From the Editor.
#@W. David Kelton
#t2004
#cINFORMS Journal on Computing
#index924174
#% 
#!
  
#*Appreciation to Referees.
#@W. David Kelton
#t2004
#cINFORMS Journal on Computing
#index924175
#% 
#!
  
#*The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis.
#@Jeffery L. Kennington,Mark W. Lewis
#t2001
#cINFORMS Journal on Computing
#index924176
#% 
#!
  
#*Generalized Networks: The Theory of Preprocessing and an Empirical Analysis.
#@Jeffery L. Kennington,Karen R. Lewis
#t2004
#cINFORMS Journal on Computing
#index924177
#% 
#!
  
#*Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures.
#@Jeffery L. Kennington,Eli V. Olinick
#t2004
#cINFORMS Journal on Computing
#index924178
#% 
#!
  
#*A New Pricing Model for Competitive Telecommunications Services Using Congestion Discounts.
#@Neil J. Keon,G. Anandalingam
#t2005
#cINFORMS Journal on Computing
#index924179
#% 
#!
  
#*When Genetic Algorithms Work Best.
#@Aaron Kershenbaum
#t1997
#cINFORMS Journal on Computing
#index924180
#% 
#!
  
#*Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors.
#@B. A. Kijowski,Udatta S. Palekar
#t1997
#cINFORMS Journal on Computing
#index924181
#% 
#!
  
#*Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification, and Population Stratification.
#@Gad Kimmel,Roded Sharan,Ron Shamir
#t2004
#cINFORMS Journal on Computing
#index924182
#%2022
#%558742
#%558914
#%951352
#!
  
#*State-of-the-Art Review: A User's Guide to the Brave New World of Designing Simulation Experiments.
#@Jack P. C. Kleijnen,Susan M. Sanchez,Thomas W. Lucas,Thomas M. Cioppa
#t2005
#cINFORMS Journal on Computing
#index924183
#%667799
#%667540
#%668146
#%668207
#%669064
#%669399
#%669401
#%669308
#%670003
#%670406
#%670587
#%670589
#%670578
#%671094
#%924057
#%924077
#%1120627
#%1120844
#!
  
#*Practical Piecewise-Linear Approximation for Monotropic Optimization.
#@Spyros Kontogiorgis
#t2000
#cINFORMS Journal on Computing
#index924184
#% 
#!
  
#*On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net.
#@Ger Koole
#t1997
#cINFORMS Journal on Computing
#index924185
#% 
#!
  
#*Scheduling Periodic Tasks with Slack.
#@Jan H. M. Korst,Emile H. L. Aarts,Jan Karel Lenstra
#t1997
#cINFORMS Journal on Computing
#index924186
#% 
#!
  
#*An Automated Multiresolution Procedure for Modeling Complex Arrival Processes.
#@Michael E. Kuhl,Sachin G. Sumant,James R. Wilson
#t2006
#cINFORMS Journal on Computing
#index924187
#%669411
#%670084
#!
  
#*Exploiting Tabu Search Memory in Constrained Problems.
#@Sadan Kulturel-Konak,Bryan A. Norman,David W. Coit,Alice E. Smith
#t2004
#cINFORMS Journal on Computing
#index924188
#% 
#!
  
#*Assembly-Line Scheduling with Concurrent Operations and Parallel Machines.
#@George J. Kyparisis,Christos Koulamas
#t2002
#cINFORMS Journal on Computing
#index924189
#% 
#!
  
#*Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences.
#@Pierre L'Ecuyer
#t1997
#cINFORMS Journal on Computing
#index924190
#% 
#!
  
#*An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators.
#@Pierre L'Ecuyer,Raymond Couture
#t1997
#cINFORMS Journal on Computing
#index924191
#% 
#!
  
#*Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.
#@Giuseppe Lancia,Maria Cristina Pinotti,Romeo Rizzi
#t2004
#cINFORMS Journal on Computing
#index924192
#%438329
#%558977
#%650636
#%952767
#%962074
#!
  
#*Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks.
#@Amy Nicole Langville,William J. Stewart
#t2004
#cINFORMS Journal on Computing
#index924193
#% 
#!
  
#*A Linear Programming Approach to Discriminant Analysis with a Reserved-Judgment Region.
#@Eva K. Lee,Richard J. Gallagher,David A. Patterson
#t2003
#cINFORMS Journal on Computing
#index924194
#% 
#!
  
#*Genetic Algorithms: A Practitioner's View.
#@David Levine
#t1997
#cINFORMS Journal on Computing
#index924195
#% 
#!
  
#*A Dynamic Programming Based Pruning Method for Decision Trees.
#@Xiao-Bai Li,James R. Sweigart,James T. C. Teng,Joan M. Donohue,Lori A. Thombs
#t2001
#cINFORMS Journal on Computing
#index924196
#% 
#!
  
#*A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes.
#@Zong-Zhi Lin,James C. Bean,Chelsea C. White III
#t2004
#cINFORMS Journal on Computing
#index924197
#% 
#!
  
#*A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems.
#@Jeff T. Linderoth,Eva K. Lee,Martin W. P. Savelsbergh
#t2001
#cINFORMS Journal on Computing
#index924198
#% 
#!
  
#*A New Pricing Scheme for Airline Crew Scheduling.
#@Alexandra Makri,Diego Klabjan
#t2004
#cINFORMS Journal on Computing
#index924199
#% 
#!
  
#*An Exact Approach to the Strip-Packing Problem.
#@Silvano Martello,Michele Monaci,Daniele Vigo
#t2003
#cINFORMS Journal on Computing
#index924200
#% 
#!
  
#*Implementing an LU Factorization for the Embedded Network Simplex Algorithm.
#@Richard D. McBride,John W. Mamer
#t2004
#cINFORMS Journal on Computing
#index924201
#% 
#!
  
#*Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm.
#@Richard D. McBride,John W. Mamer
#t1997
#cINFORMS Journal on Computing
#index924202
#% 
#!
  
#*Primal-Dual-Based Algorithms for a Directed Network Design Problem.
#@Vardges Melkonian,Éva Tardos
#t2005
#cINFORMS Journal on Computing
#index924203
#% 
#!
  
#*Optimal Solutions for the Closest-String Problem via Integer Programming.
#@Cláudio Nogueira de Meneses,Zhaosong Lu,Carlos A. S. Oliveira,Panos M. Pardalos
#t2004
#cINFORMS Journal on Computing
#index924204
#%118575
#%610582
#%622635
#%651519
#%774915
#%888642
#%951064
#!
  
#*Scheduling Banner Advertisements on the Web.
#@Syam Menon,Ali Amiri
#t2004
#cINFORMS Journal on Computing
#index924205
#% 
#!
  
#*Addendum to "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method".
#@Csaba Mészáros,Jacek Gondzio
#t2001
#cINFORMS Journal on Computing
#index924206
#% 
#!
  
#*A Modeling Layer for Constraint-Programming Libraries.
#@Laurent Michel,Pascal Van Hentenryck
#t2005
#cINFORMS Journal on Computing
#index924207
#%548069
#%770780
#%1117233
#%3003855
#!
  
#*The Role of Integer Programming Techniques in Constraint Programming's Global Constraints.
#@Michela Milano,Greger Ottosson,Philippe Refalo,Erlendur S. Thorsteinsson
#t2002
#cINFORMS Journal on Computing
#index924208
#% 
#!
  
#*A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.
#@Michele Monaci,Paolo Toth
#t2006
#cINFORMS Journal on Computing
#index924209
#%814139
#%818030
#%836341
#%924038
#%934465
#%951884
#%1013199
#%1013485
#%1275185
#%1275175
#!
  
#*The Semismooth Algorithm for Large Scale Complementarity Problems.
#@Todd S. Munson,Francisco Facchinei,Michael C. Ferris,Andreas Fischer,Christian Kanzow
#t2001
#cINFORMS Journal on Computing
#index924210
#% 
#!
  
#*Adding Value to Induced Decision Trees for Time-Sensitive Data.
#@Catherine K. Murphy,Michel Benaroch
#t1997
#cINFORMS Journal on Computing
#index924211
#% 
#!
  
#*Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach.
#@Robert M. Nauss
#t2003
#cINFORMS Journal on Computing
#index924212
#% 
#!
  
#*The infinity Queueing System: Part I - The Single Node.
#@Barry L. Nelson,Michael R. Taaffe
#t2004
#cINFORMS Journal on Computing
#index924213
#% 
#!
  
#*The [infinity] Queueing System: Part II - The Multiclass Network.
#@Barry L. Nelson,Michael R. Taaffe
#t2004
#cINFORMS Journal on Computing
#index924214
#% 
#!
  
#*Intelligent Partitioning for Feature Selection.
#@Sigurdur Ólafsson,Jaekyung Yang
#t2005
#cINFORMS Journal on Computing
#index924215
#%172381
#%334952
#%472914
#%670131
#%1009807
#%1164754
#%1275197
#%1275179
#!
  
#*Computer-Aided Complexity Classification of Dial-a-Ride Problems.
#@Willem de Paepe,Jan Karel Lenstra,Jiri Sgall,René A. Sitters,Leen Stougie
#t2004
#cINFORMS Journal on Computing
#index924216
#% 
#!
  
#*A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem.
#@Gintaras Palubeckis
#t1997
#cINFORMS Journal on Computing
#index924217
#% 
#!
  
#*On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies.
#@Gyana R. Parija,Shabbir Ahmed,Alan J. King
#t2004
#cINFORMS Journal on Computing
#index924218
#% 
#!
  
#*Searching for Multiple Words in a Markov Sequence.
#@Yonil Park,John L. Spouge
#t2004
#cINFORMS Journal on Computing
#index924219
#%837989
#%1036408
#!
  
#*A Branch and Cut Approach for Workload Smoothing on Assembly Lines.
#@Anulark Pinnoi,Wilbert E. Wilhelm
#t1997
#cINFORMS Journal on Computing
#index924220
#% 
#!
  
#*A Minimal Algorithm for the Bounded Knapsack Problem.
#@David Pisinger
#t2000
#cINFORMS Journal on Computing
#index924221
#% 
#!
  
#*A General Heuristic for Production Planning Problems.
#@Yves Pochet,Mathieu Van Vyve
#t2004
#cINFORMS Journal on Computing
#index924222
#% 
#!
  
#*Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment.
#@Marcelo Prais,Celso C. Ribeiro
#t2000
#cINFORMS Journal on Computing
#index924223
#% 
#!
  
#*An Evolutionary Approach to Group Decision Making.
#@Jackie Rees,Gary J. Koehler
#t2002
#cINFORMS Journal on Computing
#index924224
#% 
#!
  
#*Genetic Algorithms for the Operations Researcher.
#@Colin R. Reeves
#t1997
#cINFORMS Journal on Computing
#index924225
#% 
#!
  
#*Genetic Algorithms: No Panacea, but a Valuable Tool for the Operations Researcher.
#@Colin R. Reeves
#t1997
#cINFORMS Journal on Computing
#index924226
#% 
#!
  
#*A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs.
#@Celso C. Ribeiro,Eduardo Uchoa,Renato Fonseca F. Werneck
#t2002
#cINFORMS Journal on Computing
#index924227
#% 
#!
  
#*Capacitated Network Design with Uncertain Demand.
#@Morten Riis,Kim Allan Andersen
#t2002
#cINFORMS Journal on Computing
#index924228
#% 
#!
  
#*A GRASP for Parallel Machine Scheduling with Time Windows.
#@Siwate Rojanasoonthon,Jonathan Bard
#t2005
#cINFORMS Journal on Computing
#index924229
#%812316
#%839403
#!
  
#*Algorithms for Path-Based Placement of Inspection Stations on Networks.
#@Daniel J. Rosenkrantz,Giri Kumar Tayi,S. S. Ravi
#t2000
#cINFORMS Journal on Computing
#index924230
#% 
#!
  
#*What Are Genetic Algorithms Good at?
#@Peter Ross
#t1997
#cINFORMS Journal on Computing
#index924231
#% 
#!
  
#*On the Generality of Event-Graph Models.
#@Eric L. Savage,Lee Schruben,Enver Yücesan
#t2005
#cINFORMS Journal on Computing
#index924232
#%543493
#%667975
#%670706
#%670704
#%670629
#%671377
#%774861
#%775850
#%832946
#%924132
#%1120869
#!
  
#*An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
#@Martin W. P. Savelsbergh,R. N. Uma,Joel Wein
#t2005
#cINFORMS Journal on Computing
#index924233
#%186480
#%406818
#%406975
#%557851
#%610702
#%836359
#%839254
#%839414
#%924030
#%1014284
#%1014115
#%1059750
#%1061395
#!
  
#*SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing.
#@Armin Scholl,Robert Klein
#t1997
#cINFORMS Journal on Computing
#index924234
#% 
#!
  
#*Efficient and Anonymous Web-Usage Mining for Web Personalization.
#@Cyrus Shahabi,Farnoush Banaei Kashani
#t2003
#cINFORMS Journal on Computing
#index924235
#% 
#!
  
#*A Metastrategy for Large-Scale Resource Management Based on Informational Decomposition.
#@Joel A. Shapiro,Warren B. Powell
#t2006
#cINFORMS Journal on Computing
#index924236
#%1288745
#%3006912
#!
  
#*A Flexible Java Representation for Uncertainty in Online Operations-Research Models.
#@Joel A. Shapiro,Warren B. Powell,David Bernstein
#t2001
#cINFORMS Journal on Computing
#index924237
#% 
#!
  
#*Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting.
#@Hanif D. Sherali,Jonathan Cole Smith,Youngho Lee
#t2000
#cINFORMS Journal on Computing
#index924238
#% 
#!
  
#*An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue.
#@John Shortle,Percy H. Brill,Martin J. Fischer,Donald Gross,Denise M. Bevilacqua Masi
#t2004
#cINFORMS Journal on Computing
#index924239
#% 
#!
  
#*An Analysis of the Alias Method for Discrete Random-Variate Generation.
#@J. Cole Smith,Sheldon H. Jacobson
#t2005
#cINFORMS Journal on Computing
#index924240
#%1121728
#!
  
#*The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions.
#@Francis Sourd
#t2004
#cINFORMS Journal on Computing
#index924241
#% 
#!
  
#*Multiple-Machine Lower Bounds for Shop-Scheduling Problems.
#@Francis Sourd,Wim Nuijten
#t2000
#cINFORMS Journal on Computing
#index924242
#% 
#!
  
#*A Framework for the Evaluation of Session Reconstruction Heuristics in Web-Usage Analysis.
#@Myra Spiliopoulou,Bamshad Mobasher,Bettina Berendt,Miki Nakagawa
#t2003
#cINFORMS Journal on Computing
#index924243
#% 
#!
  
#*Web Business Intelligence: Mining the Web for Actionable Knowledge.
#@Jaideep Srivastava,Robert Cooley
#t2003
#cINFORMS Journal on Computing
#index924244
#% 
#!
  
#*Steiner Trees and 3-D Macromolecular Conformation.
#@Courtney Stanton,J. MacGregor Smith
#t2004
#cINFORMS Journal on Computing
#index924245
#%838175
#%949569
#%977947
#!
  
#*Convergence Properties of the Batch Means Method for Simulation Output Analysis.
#@Natalie M. Steiger,James R. Wilson
#t2001
#cINFORMS Journal on Computing
#index924246
#% 
#!
  
#*Oblique Multicategory Decision Trees Using Nonlinear Programming.
#@W. Nick Street
#t2005
#cINFORMS Journal on Computing
#index924247
#%2140
#%2360
#%1009807
#%1013508
#%1275197
#%1275179
#!
  
#*Relationship-Based Clustering and Visualization for High-Dimensional Data Mining.
#@Alexander Strehl,Joydeep Ghosh
#t2003
#cINFORMS Journal on Computing
#index924248
#% 
#!
  
#*Optimal Processing Policies for an e-Commerce Web Server.
#@Yong Tan,Kamran Moinzadeh,Vijay S. Mookerjee
#t2005
#cINFORMS Journal on Computing
#index924249
#%950888
#!
  
#*Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm.
#@Hui-Chin Tang,Chiang Kao
#t2004
#cINFORMS Journal on Computing
#index924250
#% 
#!
  
#*Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems.
#@Huseyin Topaloglu,Warren B. Powell
#t2006
#cINFORMS Journal on Computing
#index924251
#%1013251
#%1288752
#%1288745
#!
  
#*Numerical Solutions of Renewal-Type Integral Equations.
#@Michael Tortorella
#t2005
#cINFORMS Journal on Computing
#index924252
#% 
#!
  
#*Minimizing the Average Query Complexity of Learning Monotone Boolean Functions.
#@Vetle I. Torvik,Evangelos Triantaphyllou
#t2002
#cINFORMS Journal on Computing
#index924253
#% 
#!
  
#*The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.
#@Paolo Toth,Daniele Vigo
#t2003
#cINFORMS Journal on Computing
#index924254
#% 
#!
  
#*From the Guest Co-Editors.
#@Alexander Tuzhilin,Louiqa Raschid
#t2003
#cINFORMS Journal on Computing
#index924255
#% 
#!
  
#*Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.
#@Ann Vandevelde,Han Hoogeveen,Cor A. J. Hurkens,Jan Karel Lenstra
#t2005
#cINFORMS Journal on Computing
#index924256
#%837306
#%837996
#!
  
#*Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems.
#@Diane E. Vaughan,Sheldon H. Jacobson,Shane N. Hall,Laura A. McLay
#t2005
#cINFORMS Journal on Computing
#index924257
#%621778
#%837283
#%885424
#!
  
#*Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems.
#@Felisa J. Vázquez-Abad,Sheldon H. Jacobson
#t2001
#cINFORMS Journal on Computing
#index924258
#% 
#!
  
#*Placing Text Labels an Maps and Diagrams using Genetic Algorithms with Masking.
#@Oleg V. Verner,Roger L. Wainwright,Dale A. Schoenefeld
#t1997
#cINFORMS Journal on Computing
#index924259
#% 
#!
  
#*Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines.
#@Tjark Vredeveld,Cor A. J. Hurkens
#t2002
#cINFORMS Journal on Computing
#index924260
#% 
#!
  
#*Combinatorial Auctions: A Survey.
#@Sven de Vries,Rakesh V. Vohra
#t2003
#cINFORMS Journal on Computing
#index924261
#% 
#!
  
#*General Open and Closed Queueing Networks with Blocking: A Unified Framework for Approximation.
#@Mark Vroblefski,Ram Ramesh,Stanley Zionts
#t2000
#cINFORMS Journal on Computing
#index924262
#% 
#!
  
#*Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance.
#@Jean-Paul Watson,Laura Barbulescu,L. Darrell Whitley,Adele E. Howe
#t2002
#cINFORMS Journal on Computing
#index924263
#% 
#!
  
#*A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem.
#@Wilbert E. Wilhelm,Radu Gadidov
#t2004
#cINFORMS Journal on Computing
#index924264
#% 
#!
  
#*Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming.
#@H. Paul Williams,Hong Yan
#t2001
#cINFORMS Journal on Computing
#index924265
#% 
#!
  
#*When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
#@Gerhard J. Woeginger
#t2000
#cINFORMS Journal on Computing
#index924266
#% 
#!
  
#*OR/SM: A Prototype Integrated Modeling Environment Based on Structured Modeling.
#@Gordon P. Wright,N. Dan Worobetz,Myong Kang,Radha V. Mookerjee,Radha Chandrasekharan
#t1997
#cINFORMS Journal on Computing
#index924267
#% 
#!
  
#*Institute for Operations Research and the Management Sciences.
#@
#t2004
#cINFORMS Journal on Computing
#index924268
#% 
#!
  
#*Institute for Operations Research and the Management Sciences.
#@
#t2004
#cINFORMS Journal on Computing
#index924269
#% 
#!
  
#*Institute for Operations Research and the Management Sciences.
#@
#t2004
#cINFORMS Journal on Computing
#index924270
#% 
#!
  
#*From the Editor.
#@
#t2005
#cINFORMS Journal on Computing
#index924271
#% 
#!
  
#*Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005.
#@
#t2005
#cINFORMS Journal on Computing
#index924272
#% 
#!
  
#*From the Editor.
#@
#t2005
#cINFORMS Journal on Computing
#index924273
#% 
#!
  
#*Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005.
#@
#t2005
#cINFORMS Journal on Computing
#index924274
#% 
#!
  
#*From the Editor.
#@
#t2006
#cINFORMS Journal on Computing
#index924275
#% 
#!
  
#*Effective Role Resolution in Workflow Management.
#@Daniel Dajun Zeng,J. Leon Zhao
#t2005
#cINFORMS Journal on Computing
#index924276
#%326446
#%364639
#%567611
#%650828
#%775099
#%805615
#%832832
#%857648
#%943592
#%952554
#%1289130
#%3005125
#!
  
#*On the Existence and Significance of Data Preprocessing Biases in Web-Usage Mining.
#@Zhiqiang Zheng,Balaji Padmanabhan,Steven Orla Kimbrough
#t2003
#cINFORMS Journal on Computing
#index924277
#% 
#!
  
#*Evaluation of the ARTAFIT Method for Fitting Time-Series Input Processes for Simulation.
#@Bahar Biller,Barry L. Nelson
#t2008
#cINFORMS Journal on Computing
#index924278
#% 
#!
  
#*Monitoring an Information Source Under a Politeness Constraint.
#@Jonathan Eckstein,Avigdor Gal,Sarit Reiner
#t2008
#cINFORMS Journal on Computing
#index924279
#% 
#!
  
#*Disk Packing in a Square: A New Global Optimization Approach.
#@Bernardetta Addis,Marco Locatelli,Fabio Schoen
#t2008
#cINFORMS Journal on Computing
#index924280
#% 
#!
  
#*An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems.
#@Shivaram Subramanian,Hanif D. Sherali
#t2008
#cINFORMS Journal on Computing
#index924281
#% 
#!
  
#*A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics.
#@Stefan Irnich
#t2008
#cINFORMS Journal on Computing
#index924282
#% 
#!
  
#*A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.
#@Juan Pablo Vielma,Shabbir Ahmed,George L. Nemhauser
#t2008
#cINFORMS Journal on Computing
#index924283
#% 
#!
  
#*Time-Indexed Formulations and the Total Weighted Tardiness Problem.
#@Louis-Philippe Bigras,Michel Gamache,Gilles Savard
#t2008
#cINFORMS Journal on Computing
#index924284
#% 
#!
  
#*Extreme Point-Based Heuristics for Three-Dimensional Bin Packing.
#@Teodor Gabriel Crainic,Guido Perboli,Roberto Tadei
#t2008
#cINFORMS Journal on Computing
#index924285
#% 
#!
  
#*A Market Design for Grid Computing.
#@Ravi Bapna,Sanjukta Das,Robert S. Garfinkel,Jan Stallaert
#t2008
#cINFORMS Journal on Computing
#index924286
#% 
#!
  
#*Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem.
#@Mauro Birattari,Prasanna Balaprakash,Thomas Stützle,Marco Dorigo
#t2008
#cINFORMS Journal on Computing
#index924287
#% 
#!
  
#*A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem.
#@Gerardo Minella,Rubén Ruiz,Michele Ciavotta
#t2008
#cINFORMS Journal on Computing
#index924288
#% 
#!
  
#*Tabu Search-Enhanced Graphical Models for Classification in High Dimensions.
#@Xue Bai,Rema Padman,Joseph Ramsey,Peter Spirtes
#t2008
#cINFORMS Journal on Computing
#index924289
#% 
#!
  
#*A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems.
#@Huseyin Topaloglu
#t2008
#cINFORMS Journal on Computing
#index924290
#% 
#!
  
#*Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights.
#@Ravi Bapna,Paulo B. Goes,Alok Gupta,Gilbert G. Karuga
#t2008
#cINFORMS Journal on Computing
#index924291
#% 
#!
  
#*Risk Minimization and Minimum Description for Linear Discriminant Functions.
#@Haldun Aytug,Gary J. Koehler,Ling He
#t2008
#cINFORMS Journal on Computing
#index924292
#% 
#!
  
#*A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem.
#@Jörg Homberger
#t2008
#cINFORMS Journal on Computing
#index924293
#% 
#!
  
#*A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand.
#@Ruibin Bai,Graham Kendall
#t2008
#cINFORMS Journal on Computing
#index924294
#% 
#!
  
#*A Noniterative Algorithm for the Linear-Quadratic Profit-Maximization Model for Smoothing Multiproduct Production.
#@Jaya Singhal,Kalyan Singhal
#t2008
#cINFORMS Journal on Computing
#index924295
#% 
#!
  
#*Matchings in Node-Weighted Convex Bipartite Graphs.
#@Irit Katriel
#t2008
#cINFORMS Journal on Computing
#index924296
#% 
#!
  
#*Estimating Cycle Time Percentile Curves for Manufacturing Systems via Simulation.
#@Feng Yang,Bruce E. Ankenman,Barry L. Nelson
#t2008
#cINFORMS Journal on Computing
#index924297
#% 
#!
  
#*Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
#@Mauro Dell'Amico,Manuel Iori,Silvano Martello,Michele Monaci
#t2008
#cINFORMS Journal on Computing
#index924298
#% 
#!
  
#*Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem.
#@Mhand Hifi,Rym M'Hallah,Toufik Saadi
#t2008
#cINFORMS Journal on Computing
#index924299
#% 
#!
  
#*An Algorithm for Computing Minimal % Coxian Representations.
#@Qi-Ming He,Hanqin Zhang
#t2008
#cINFORMS Journal on Computing
#index924300
#% 
#!
  
#*Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.
#@Miguel F. Anjos,Anthony Vannelli
#t2008
#cINFORMS Journal on Computing
#index924301
#% 
#!
  
#*Discovering Generalized Profile-Association Rules for the Targeted Advertising of New Products.
#@San-Yih Hwang,Wan-Shiou Yang
#t2008
#cINFORMS Journal on Computing
#index924302
#% 
#!
  
#*Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm.
#@Sumit Kunnumkal,Huseyin Topaloglu
#t2008
#cINFORMS Journal on Computing
#index924303
#% 
#!
  
#*Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price.
#@Syam Menon,Rakesh Gupta
#t2008
#cINFORMS Journal on Computing
#index924304
#% 
#!
  
#*Edge Finding for Cumulative Scheduling.
#@Luc Mercier,Pascal Van Hentenryck
#t2008
#cINFORMS Journal on Computing
#index924305
#% 
#!
  
#*Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations.
#@April K. Andreas,J. Cole Smith
#t2008
#cINFORMS Journal on Computing
#index924306
#% 
#!
  
#*Top-k Correlation Computation.
#@Hui Xiong,Wenjun Zhou,Mark Brodie,Sheng Ma
#t2008
#cINFORMS Journal on Computing
#index924307
#% 
#!
  
#*A Tensor Sum Preconditioner for Stochastic Automata Networks.
#@Abderezak Touzene
#t2008
#cINFORMS Journal on Computing
#index924308
#% 
#!
  
#*Kestrel: An Interface from Optimization Modeling Systems to the NEOS Server.
#@Elizabeth D. Dolan,Robert Fourer,Jean-Pierre Goux,Todd S. Munson,Jason Sarich
#t2008
#cINFORMS Journal on Computing
#index924309
#% 
#!
  
#*Efficient Jump Ahead for 2-Linear Random Number Generators.
#@Hiroshi Haramoto,Makoto Matsumoto,Takuji Nishimura,François Panneton,Pierre L'Ecuyer
#t2008
#cINFORMS Journal on Computing
#index924310
#% 
#!
  
#*Scatter Search for the Point-Matching Problem in 3D Image Registration.
#@Oscar Cordón,Sergio Damas,Jose Santamaría,Rafael Martí
#t2008
#cINFORMS Journal on Computing
#index924311
#% 
#!
  
#*Approximation to the Transient Solution of the M/Ek/1 Queue.
#@J. D. Griffiths,G. M. Leonenko,J. E. Williams
#t2008
#cINFORMS Journal on Computing
#index924312
#% 
#!
  
#*The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results.
#@Christian Roed Pedersen,Lars Relund Nielsen,Kim Allan Andersen
#t2008
#cINFORMS Journal on Computing
#index924313
#% 
#!
  
#*A Maximal-Space Algorithm for the Container Loading Problem.
#@Francisco Parreño,Ramón Alvarez-Valdés,José Manuel Tamarit,J. F. Oliveira
#t2008
#cINFORMS Journal on Computing
#index924314
#% 
#!
  
#*Improving Intrusion Prevention Models: Dual-Threshold and Dual-Filter Approaches.
#@Young U. Ryu,Hyeun-Suk Rhee
#t2008
#cINFORMS Journal on Computing
#index924315
#% 
#!
  
#*Novel Local-Search-Based Approaches to University Examination Timetabling.
#@Massimiliano Caramia,Paolo Dell'Olmo,Giuseppe F. Italiano
#t2008
#cINFORMS Journal on Computing
#index924316
#% 
#!
  
#*A Metaheuristic Approach for the Vertex Coloring Problem.
#@Enrico Malaguti,Michele Monaci,Paolo Toth
#t2008
#cINFORMS Journal on Computing
#index924317
#% 
#!
  
#*A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem.
#@Francis Sourd,Olivier Spanjaard
#t2008
#cINFORMS Journal on Computing
#index924318
#% 
#!
  
#*Solving the Capacitated Local Access Network Design Problem.
#@F. Sibel Salman,R. Ravi,John N. Hooker
#t2008
#cINFORMS Journal on Computing
#index924319
#% 
#!
  
#*Intrusion-Detection Policies for IT Security Breaches.
#@Hulisi Ogut,Huseyin Cavusoglu,Srinivasan Raghunathan
#t2008
#cINFORMS Journal on Computing
#index924320
#% 
#!
  
#*The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints.
#@Konstantin Artiouchine,Philippe Baptiste,Juliette Mattioli
#t2008
#cINFORMS Journal on Computing
#index924321
#% 
#!
  
#*Beam-ACO for Simple Assembly Line Balancing.
#@Christian Blum
#t2008
#cINFORMS Journal on Computing
#index924322
#% 
#!
  
#*A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities.
#@Christos D. Tarantilis,Emmanouil E. Zachariadis,Chris T. Kiranoudis
#t2008
#cINFORMS Journal on Computing
#index924323
#% 
#!
  
#*Reactive Tabu Search in a Team-Learning Problem.
#@Yuelin Shen
#t2008
#cINFORMS Journal on Computing
#index924324
#% 
#!
  
#*Decision-Tree-Based Knowledge Discovery: Single- vs. Multi-Decision-Tree Induction.
#@Namsik Chang,Olivia R. Liu Sheng
#t2008
#cINFORMS Journal on Computing
#index924325
#% 
#!
  
#*Speeding Up Dynamic Shortest-Path Algorithms.
#@Luciana S. Buriol,Mauricio G. C. Resende,Mikkel Thorup
#t2008
#cINFORMS Journal on Computing
#index924326
#% 
#!
  
#*A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs.
#@José Niño-Mora
#t2008
#cINFORMS Journal on Computing
#index924327
#% 
#!
  
#*The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan.
#@H. Neil Geismar,Gilbert Laporte,Lei Lei,Chelliah Sriskandarajah
#t2008
#cINFORMS Journal on Computing
#index924328
#% 
#!
  
#*A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing.
#@Fernando S. Oliveira
#t2008
#cINFORMS Journal on Computing
#index924329
#% 
#!
  
#*Efficient Simulation Budget Allocation for Selecting an Optimal Subset.
#@Chun-Hung Chen,Donghai He,Michael C. Fu,Loo Hay Lee
#t2008
#cINFORMS Journal on Computing
#index924330
#% 
#!
  
#*Solving Beam-Angle Selection and Dose Optimization Simultaneously via High-Throughput Computing.
#@Hao Howard Zhang,Leyuan Shi,Robert R. Meyer,Daryl Nazareth,Warren D. D'Souza
#t2009
#cINFORMS Journal on Computing
#index1275029
#%813998
#%838994
#%1014095
#%1289663
#%2892221
#!
  
#*Dimension Reduction Techniques in Quasi-Monte Carlo Methods for Option Pricing.
#@Xiaoqun Wang
#t2009
#cINFORMS Journal on Computing
#index1275030
#%669125
#%669471
#%960422
#%960424
#%960553
#%960736
#%1164124
#%1164387
#%1164257
#%1289617
#!
  
#*A Response Surface Approach to Beam Orientation Optimization in Intensity-Modulated Radiation Therapy Treatment Planning.
#@Dionne M. Aleman,H. Edwin Romeijn,James F. Dempsey
#t2009
#cINFORMS Journal on Computing
#index1275031
#%1233897
#!
  
#*Synthetic Optimization Problem Generation: Show Us the Correlations!
#@Charles H. Reilly
#t2009
#cINFORMS Journal on Computing
#index1275032
#%669931
#%670340
#%670344
#%670335
#%813122
#!
  
#*Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation.
#@Assefaw Hadish Gebremedhin,Arijit Tarafdar,Alex Pothen,Andrea Walther
#t2009
#cINFORMS Journal on Computing
#index1275033
#%1014327
#%1061638
#%1121387
#%1121807
#%1164345
#!
  
#*Transparent Parallelization of Constraint Programming.
#@Laurent Michel,Andrew See,Pascal Van Hentenryck
#t2009
#cINFORMS Journal on Computing
#index1275034
#%117307
#%117700
#%210162
#%328440
#%811800
#%924106
#%1117178
#%3002454
#%3545675
#!
  
#*Accelerating Benders Decomposition by Local Branching.
#@Walter Rei,Jean-François Cordeau,Michel Gendreau,Patrick Soriano
#t2009
#cINFORMS Journal on Computing
#index1275035
#%812552
#%836524
#%1013828
#!
  
#*Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems.
#@Lars Magnus Hvattum,Arne Løkketangen,Gilbert Laporte
#t2009
#cINFORMS Journal on Computing
#index1275036
#%924223
#%1288551
#%1288563
#%1288643
#%1289944
#%3457874
#!
  
#*A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators.
#@Davaatseren Baatar,Natashia Boland,Robert Johnston,Horst W. Hamacher
#t2009
#cINFORMS Journal on Computing
#index1275037
#%815055
#%835981
#%837318
#%1024213
#!
  
#*Reinforcement Learning: A Tutorial Survey and Recent Advances.
#@Abhijit Gosavi
#t2009
#cINFORMS Journal on Computing
#index1275038
#%14978
#%335124
#%335261
#%335678
#%516594
#%517266
#%632663
#%745180
#%746023
#%746028
#%885408
#%924197
#%985058
#%985110
#%984974
#%1009226
#%1009489
#%1009381
#%1009611
#%1009716
#%1009686
#%1009939
#%1009885
#%1009921
#%1009947
#%1009976
#%1009929
#%1009807
#%1013139
#%1026493
#%1279766
#%1290013
#%2889449
#%2889404
#%2890068
#%3006933
#%29838
#!
  
#*Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms.
#@Santanu S. Dey,Jean-Philippe P. Richard
#t2009
#cINFORMS Journal on Computing
#index1275039
#%835825
#%837699
#%924136
#%1013494
#%1014465
#%1289974
#%3007117
#!
  
#*From the Editor.
#@John W. Chinneck
#t2009
#cINFORMS Journal on Computing
#index1275040
#% 
#!
  
#*Efficient Correlation Matching for Fitting Discrete Multivariate Distributions with Arbitrary Marginals and Normal-Copula Dependence.
#@Athanassios N. Avramidis,Nabil Channouf,Pierre L'Ecuyer
#t2009
#cINFORMS Journal on Computing
#index1275041
#%924129
#%1120672
#%1120638
#%1156058
#%1275232
#%2884587
#!
  
#*A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem.
#@Edmund K. Burke,Graham Kendall,Glenn Whitwell
#t2009
#cINFORMS Journal on Computing
#index1275042
#%310891
#%814761
#%971729
#%1289598
#%1289929
#!
  
#*Exact and Asymptotically Exact Solutions for a Class of Assortment Problems.
#@Claudio Arbib,Fabrizio Marinelli
#t2009
#cINFORMS Journal on Computing
#index1275043
#%851675
#%1289874
#!
  
#*A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems.
#@Sven Leyffer
#t2009
#cINFORMS Journal on Computing
#index1275044
#%813591
#%1013268
#%2892016
#%2891960
#%2892107
#%2891962
#%2892252
#%3458361
#%3458568
#!
  
#*Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization.
#@Sigrún Andradóttir,Andrei A. Prudius
#t2009
#cINFORMS Journal on Computing
#index1275045
#%668116
#%668613
#%670334
#%924057
#%1014100
#%1120631
#%1120679
#%1120816
#%1120880
#%1289606
#%2892338
#!
  
#*New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling.
#@Francis Sourd
#t2009
#cINFORMS Journal on Computing
#index1275046
#%406918
#%812240
#%812770
#%839414
#%924030
#%924054
#%924241
#%924032
#%1014284
#%1054504
#%1054409
#%3458617
#!
  
#*The Time-Series Link Prediction Problem with Applications in Communication Surveillance.
#@Zan Huang,Dennis K. J. Lin
#t2009
#cINFORMS Journal on Computing
#index1275047
#%166
#%95661
#%122001
#%467557
#%472433
#%472622
#%516854
#%793498
#%984935
#%1063456
#%1063616
#%1063660
#%1120200
#%1120192
#%1167768
#!
  
#*Extending Algebraic Modelling Languages for Stochastic Programming.
#@Christian Valente,Gautam Mitra,Mustapha Sadki,Robert Fourer
#t2009
#cINFORMS Journal on Computing
#index1275048
#%924053
#%2871163
#!
  
#*A Superior Representation Method for Piecewise Linear Functions.
#@Han-Lin Li,Hao-Chun Lu,Chia-Hui Huang,Nian-Ze Hu
#t2009
#cINFORMS Journal on Computing
#index1275049
#%924184
#%2884761
#!
  
#*StAMPL: A Filtration-Oriented Modeling Tool for Multistage Stochastic Recourse Problems.
#@Robert Fourer,Leo Lopes
#t2009
#cINFORMS Journal on Computing
#index1275050
#%790805
#%924050
#%1013689
#%1013787
#!
  
#*Grid-Enabled Optimization with GAMS.
#@Michael R. Bussieck,Michael C. Ferris,Alexander Meeraus
#t2009
#cINFORMS Journal on Computing
#index1275051
#%140
#%255123
#%924198
#%1112833
#%1275062
#%2892300
#%3007117
#%3006912
#!
  
#*Advanced Scatter Search for the Max-Cut Problem.
#@Rafael Martí,Abraham Duarte,Manuel Laguna
#t2009
#cINFORMS Journal on Computing
#index1275052
#%836943
#%950456
#%988953
#%1079490
#%1275189
#%2892060
#%3458018
#!
  
#*A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling.
#@Jingpeng Li,Uwe Aickelin,Edmund K. Burke
#t2009
#cINFORMS Journal on Computing
#index1275053
#%3005546
#%812094
#%1054481
#%885408
#%754813
#%1054404
#!
  
#*An Optimal Constrained Pruning Strategy for Decision Trees.
#@Hanif D. Sherali,Antoine G. Hobeika,Chawalit Jeenanunta
#t2009
#cINFORMS Journal on Computing
#index1275054
#%367007
#%643579
#%814396
#%839587
#%889151
#%924063
#%924196
#%936240
#%1290027
#%3005546
#%3007117
#!
  
#*Pareto Optima of Multicriteria Integer Linear Programs.
#@Jesús A. De Loera,Raymond Hemmecke,Matthias Köppe
#t2009
#cINFORMS Journal on Computing
#index1275055
#%931986
#%1278842
#!
  
#*A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures.
#@Enock Chisonge Mofya,Jonathan Cole Smith
#t2009
#cINFORMS Journal on Computing
#index1275056
#%588901
#%588816
#%793911
#%806463
#!
  
#*A Set-Covering Approach with Column Generation for Parsimony Haplotyping.
#@Giuseppe Lancia,Paolo Serafini
#t2009
#cINFORMS Journal on Computing
#index1275057
#%63270
#%438329
#%567453
#%924192
#%962512
#%1087080
#%1087077
#!
  
#*Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints.
#@Raf Jans
#t2009
#cINFORMS Journal on Computing
#index1275058
#%104938
#%117340
#%811806
#%811905
#%811850
#%811808
#%811907
#%812604
#%924106
#%924238
#%924134
#%924128
#%1275137
#%1275196
#%1289691
#%1290039
#%1290067
#%2884732
#!
  
#*Single-Machine Scheduling Problems with Generalized Preemption.
#@Alessandro Agnetis,Arianna Alfieri,Gaia Nicosia
#t2009
#cINFORMS Journal on Computing
#index1275059
#%211796
#%406918
#%836338
#%1054362
#!
  
#*From the Editor - Special Cluster on High-Throughput Optimization.
#@John W. Chinneck
#t2009
#cINFORMS Journal on Computing
#index1275060
#% 
#!
  
#*Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study.
#@Richard Laundy,Michael Perregaard,Gabriel Tavares,Horia Tipi,Alkis Vazacopoulos
#t2009
#cINFORMS Journal on Computing
#index1275061
#%814410
#%836006
#%924222
#%1013437
#%1014401
#%1014534
#!
  
#*Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid.
#@Michael C. Ferris,Christos T. Maravelias,Arul Sundaramoorthy
#t2009
#cINFORMS Journal on Computing
#index1275062
#%1275051
#!
  
#*Parallel Stochastic Global Optimization Using Radial Basis Functions.
#@Rommel G. Regis,Christine A. Shoemaker
#t2009
#cINFORMS Journal on Computing
#index1275063
#%28124
#%1013591
#%1275070
#%1275077
#%1344297
#%2871079
#%2892197
#%3363305
#!
  
#*Computational Experience with a Software Framework for Parallel Integer Programming.
#@Y. Xu,Ted K. Ralphs,Laszlo Ladányi,Matthew J. Saltzman
#t2009
#cINFORMS Journal on Computing
#index1275064
#%578516
#%807872
#%810843
#%890599
#%989148
#%1034169
#%1112038
#%2892300
#%3306982
#%3603572
#!
  
#*Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs.
#@Yang Yuan,Suvrajeet Sen
#t2009
#cINFORMS Journal on Computing
#index1275065
#%1013339
#%1014227
#%3458608
#!
  
#*Minimax Regret Single-Facility Ordered Median Location Problems on Networks.
#@Justo Puerto,Antonio M. Rodríguez-Chía,Arie Tamir
#t2009
#cINFORMS Journal on Computing
#index1275066
#%835959
#%924056
#%924059
#%934584
#%950099
#%951147
#%952805
#%953102
#%972200
#%1077256
#!
  
#*Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing.
#@Jeff Linderoth,François Margot,Greg Thain
#t2009
#cINFORMS Journal on Computing
#index1275067
#%792798
#%837658
#%953319
#%977428
#%978459
#%993572
#!
  
#*Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
#@Francesco Carrabs,Jean-François Cordeau,Gilbert Laporte
#t2007
#cINFORMS Journal on Computing
#index1275068
#% 
#!
  
#*Waiting-Time Distribution of Queues Through Numerical Laplace Inversion.
#@John F. Shortle,Martin J. Fischer,Percy H. Brill
#t2007
#cINFORMS Journal on Computing
#index1275069
#% 
#!
  
#*A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions.
#@Rommel G. Regis,Christine A. Shoemaker
#t2007
#cINFORMS Journal on Computing
#index1275070
#% 
#!
  
#*Conditions that Obviate the No-Free-Lunch Theorems for Optimization.
#@Gary J. Koehler
#t2007
#cINFORMS Journal on Computing
#index1275071
#% 
#!
  
#*A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary Queueing Systems with Exhaustive Discipline.
#@Armann Ingolfsson,Elvira Akhmetshina,Susan Budge,Yongyue Li,Xudong Wu
#t2007
#cINFORMS Journal on Computing
#index1275072
#% 
#!
  
#*Computational Assessment of Nested Benders and Augmented Lagrangian Decomposition for Mean-Variance Multistage Stochastic Problems.
#@Panos Parpas,Berç Rustem
#t2007
#cINFORMS Journal on Computing
#index1275073
#% 
#!
  
#*Improving Linkage of Web Pages.
#@Rakesh Gupta,Amitava Bagchi,Sumit Sarkar
#t2007
#cINFORMS Journal on Computing
#index1275074
#%495228
#%616908
#%775068
#%795839
#%807937
#%832454
#%839585
#%891703
#%924243
#%1120538
#%2884815
#%505776
#!
  
#*Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability.
#@Hanif D. Sherali,Churlzu Lim
#t2007
#cINFORMS Journal on Computing
#index1275075
#%839308
#%1013315
#%1014067
#%3457967
#%3458277
#!
  
#*On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification.
#@Emilio Carrizosa,Belen Martin-Barragan,Frank Plastria,Dolores Romero Morales
#t2007
#cINFORMS Journal on Computing
#index1275076
#% 
#!
  
#*Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization.
#@Zsolt Ugray,Leon S. Lasdon,John C. Plummer,Fred Glover,James P. Kelly,Rafael Martí
#t2007
#cINFORMS Journal on Computing
#index1275077
#% 
#!
  
#*Denser Packings Obtained in ( log log ) Time.
#@David Pisinger
#t2007
#cINFORMS Journal on Computing
#index1275078
#% 
#!
  
#*Rescheduling for Multiple New Orders.
#@Nicholas G. Hall,Zhixin Liu,Chris N. Potts
#t2007
#cINFORMS Journal on Computing
#index1275079
#% 
#!
  
#*Efficient Computations for the Discrete GI/G/1 System.
#@Attahiru Sule Alfa,Jungong Xue
#t2007
#cINFORMS Journal on Computing
#index1275080
#% 
#!
  
#*A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints.
#@Ravindra K. Ahuja,Wei Huang,H. Edwin Romeijn,Dolores Romero Morales
#t2007
#cINFORMS Journal on Computing
#index1275081
#%835883
#%837971
#%885508
#%3005546
#!
  
#*A Study on the Cross-Entropy Method for Rare-Event Probability Estimation.
#@Tito Homem-de-Mello
#t2007
#cINFORMS Journal on Computing
#index1275082
#% 
#!
  
#*Constructing Ensembles from Data Envelopment Analysis.
#@Zhiqiang Zheng,Balaji Padmanabhan
#t2007
#cINFORMS Journal on Computing
#index1275083
#% 
#!
  
#*Tariff Optimization in Networks.
#@Mustapha Bouhtou,Stan P. M. van Hoesel,Anton F. van der Kraaij,Jean-Luc Lutton
#t2007
#cINFORMS Journal on Computing
#index1275084
#% 
#!
  
#*A Decomposition and Guided Simulation Methodology for Large-Scale System Design: A Study in QoS-Capable Intranets with Fixed and Mobile Components.
#@Sudip Bhattacharjee,Hong Zhang,Ram Ramesh,Dee H. Andrews
#t2007
#cINFORMS Journal on Computing
#index1275085
#% 
#!
  
#*GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem.
#@Ramón Alvarez-Valdés,Rafael Martí,José Manuel Tamarit,Antonio Parajón
#t2007
#cINFORMS Journal on Computing
#index1275086
#% 
#!
  
#*Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction.
#@David Pisinger,Anders Bo Rasmussen,Rune Sandvik
#t2007
#cINFORMS Journal on Computing
#index1275087
#% 
#!
  
#*An Evolutionary Random Policy Search Algorithm for Solving Markov Decision Processes.
#@Jiaqiao Hu,Michael C. Fu,Vahid Reza Ramezani,Steven I. Marcus
#t2007
#cINFORMS Journal on Computing
#index1275088
#% 
#!
  
#*An Evolutionary Metaheuristic for Approximating Preference-Nondominated Solutions.
#@Murat Köksalan,Selcen (Pamuk) Phelps
#t2007
#cINFORMS Journal on Computing
#index1275089
#% 
#!
  
#*Multi-Issue Automated Negotiations Using Agents.
#@Kaushal Chari,Manish Agrawal
#t2007
#cINFORMS Journal on Computing
#index1275090
#% 
#!
  
#*A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks.
#@Milind Dawande,Rakesh Gupta,Sanjeewa Naranpanawe,Chelliah Sriskandarajah
#t2007
#cINFORMS Journal on Computing
#index1275091
#% 
#!
  
#*Toward Automated Intelligent Manufacturing Systems (AIMS).
#@Hoi-Ming Chi,Okan K. Ersoy,Herbert Moskowitz,Kemal Altinkemer
#t2007
#cINFORMS Journal on Computing
#index1275092
#% 
#!
  
#*Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.
#@Pierre Hansen,Jack Brimberg,Dragan Urosevic,Nenad Mladenovic
#t2007
#cINFORMS Journal on Computing
#index1275093
#% 
#!
  
#*Simulation Allocation for Determining the Best Design in the Presence of Correlated Sampling.
#@Michael C. Fu,Jian-Qiang Hu,Chun-Hung Chen,Xiaoping Xiong
#t2007
#cINFORMS Journal on Computing
#index1275094
#%668116
#%668120
#%668123
#%668375
#%1120719
#!
  
#*Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.
#@Gleb Belov,Guntram Scheithauer
#t2007
#cINFORMS Journal on Computing
#index1275095
#%924156
#!
  
#*On a Binary-Encoded ILP Coloring Formulation.
#@Jon Lee,François Margot
#t2007
#cINFORMS Journal on Computing
#index1275096
#% 
#!
  
#*Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria.
#@Vincent T'Kindt,Federico Della Croce,Jean-Louis Bouquard
#t2007
#cINFORMS Journal on Computing
#index1275097
#%812024
#%1275162
#!
  
#*SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization.
#@Julián Molina Luque,Manuel Laguna,Rafael Martí,Rafael Caballero
#t2007
#cINFORMS Journal on Computing
#index1275098
#%310867
#%836942
#%860948
#%860990
#%885364
#%885483
#!
  
#*Efficient Computation of Overlapping Variance Estimators for Simulation.
#@Christos Alexopoulos,Nilay Tanik Argon,David Goldsman,Natalie M. Steiger,Gamze Tokol,James R. Wilson
#t2007
#cINFORMS Journal on Computing
#index1275099
#% 
#!
  
#*Power Algorithms for Inverting Laplace Transforms.
#@Efstathios Avdis,Ward Whitt
#t2007
#cINFORMS Journal on Computing
#index1275100
#% 
#!
  
#*Linear Complementarity as a General Solution Method to Combinatorial Problems.
#@Laura Di Giacomo,Giacomo Patrizi,Emanuele Argento
#t2007
#cINFORMS Journal on Computing
#index1275101
#%3007117
#!
  
#*Performance of a Wavelet-Based Spectral Procedure for Steady-State Simulation Analysis.
#@Emily K. Lada,James R. Wilson,Natalie M. Steiger,Jeffrey A. Joines
#t2007
#cINFORMS Journal on Computing
#index1275102
#% 
#!
  
#*A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows.
#@Andrew Lim,Xingwen Zhang
#t2007
#cINFORMS Journal on Computing
#index1275103
#% 
#!
  
#*Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem.
#@David Pisinger,Mikkel Sigurd
#t2007
#cINFORMS Journal on Computing
#index1275104
#%117302
#%117526
#%133422
#%836593
#%837528
#%924038
#%924209
#%1074418
#%1121770
#%1275185
#%1275223
#%3002073
#%3457920
#!
  
#*From the Editor.
#@John W. Chinneck
#t2007
#cINFORMS Journal on Computing
#index1275105
#% 
#!
  
#*Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem.
#@Johannes O. Royset,R. Kevin Wood
#t2007
#cINFORMS Journal on Computing
#index1275106
#% 
#!
  
#*A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables.
#@Jordi Castro
#t2007
#cINFORMS Journal on Computing
#index1275107
#% 
#!
  
#*Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the Retrial Queue.
#@Jesus R. Artalejo,Antonis Economou,Maria Jesus Lopez-Herrero
#t2007
#cINFORMS Journal on Computing
#index1275108
#% 
#!
  
#*From the Interim Editor.
#@W. David Kelton
#t2007
#cINFORMS Journal on Computing
#index1275109
#% 
#!
  
#*An Optimization Framework for Conformal Radiation Treatment Planning.
#@Gino J. Lim,Michael C. Ferris,Stephen J. Wright,David M. Shepard,Matthew A. Earl
#t2007
#cINFORMS Journal on Computing
#index1275110
#% 
#!
  
#*Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.
#@Ravindra K. Ahuja,Krishna C. Jha,James B. Orlin,Dushyant Sharma
#t2007
#cINFORMS Journal on Computing
#index1275111
#% 
#!
  
#*On the Distributed Bellman-Ford Algorithm and the Looping Problem.
#@Kevin R. Hutson,Terri L. Schlosser,Douglas R. Shier
#t2007
#cINFORMS Journal on Computing
#index1275112
#% 
#!
  
#*Improving Web-Catalog Design for Easy Product Search.
#@I. Robert Chiang,Manuel A. Nunez
#t2007
#cINFORMS Journal on Computing
#index1275113
#% 
#!
  
#*Performance Guarantees of Local Search for Multiprocessor Scheduling.
#@Petra Schuurman,Tjark Vredeveld
#t2007
#cINFORMS Journal on Computing
#index1275114
#%210344
#%211517
#%622206
#%836280
#%929759
#%950677
#%950456
#%952913
#%953262
#%1013553
#%1013938
#%1059555
#!
  
#*Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study.
#@Giuseppe Andreello,Alberto Caprara,Matteo Fischetti
#t2007
#cINFORMS Journal on Computing
#index1275115
#% 
#!
  
#*A (2/3) Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain.
#@José Niño-Mora
#t2007
#cINFORMS Journal on Computing
#index1275116
#% 
#!
  
#*A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows.
#@Jeffrey W. Ohlmann,Barrett W. Thomas
#t2007
#cINFORMS Journal on Computing
#index1275117
#%812409
#%885447
#%924047
#%1013240
#%1288700
#%1288743
#!
  
#*Pricing Communication Services with Delay Guarantee.
#@Zhongju Zhang,Debabrata Dey,Yong Tan
#t2007
#cINFORMS Journal on Computing
#index1275118
#% 
#!
  
#*Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem.
#@Dario Landa Silva,Edmund K. Burke
#t2007
#cINFORMS Journal on Computing
#index1275119
#% 
#!
  
#*A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.
#@Ravindra K. Ahuja,Jon Goodstein,Amit Mukherjee,James B. Orlin,Dushyant Sharma
#t2007
#cINFORMS Journal on Computing
#index1275120
#% 
#!
  
#*An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions.
#@Edward Rothberg
#t2007
#cINFORMS Journal on Computing
#index1275121
#% 
#!
  
#*ETAQA Solutions for Infinite Markov Processes with Repetitive Structure.
#@Alma Riska,Evgenia Smirni
#t2007
#cINFORMS Journal on Computing
#index1275122
#% 
#!
  
#*Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms.
#@Juan Feng,Hemant K. Bhargava,David M. Pennock
#t2007
#cINFORMS Journal on Computing
#index1275123
#% 
#!
  
#*Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP).
#@William J. Cook,Daniel G. Espinoza,Marcos Goycoolea
#t2007
#cINFORMS Journal on Computing
#index1275124
#% 
#!
  
#*Validation Sequence Optimization: A Theoretical Approach.
#@Gediminas Adomavicius,Alexander Tuzhilin
#t2007
#cINFORMS Journal on Computing
#index1275125
#% 
#!
  
#*Dynamic Programming to Minimize the Maximum Number of Open Stacks.
#@Maria Garcia de la Banda,Peter J. Stuckey
#t2007
#cINFORMS Journal on Computing
#index1275126
#% 
#!
  
#*From the Editor.
#@John W. Chinneck
#t2007
#cINFORMS Journal on Computing
#index1275127
#% 
#!
  
#*FBP: A Frontier-Based Tree-Pruning Algorithm.
#@Xiaoming Huo,Seoung Bum Kim,Kwok-Leung Tsui,Shuchun Wang
#t2006
#cINFORMS Journal on Computing
#index1275128
#%472507
#%924196
#!
  
#*A Unified Framework for Numerically Inverting Laplace Transforms.
#@Joseph Abate,Ward Whitt
#t2006
#cINFORMS Journal on Computing
#index1275129
#%950026
#%950222
#%1036359
#%1048467
#%1121620
#%1122056
#%2870933
#%3617116
#!
  
#*Analyzing Document-Duplication Effects on Policies for Browser and Proxy Caching.
#@Yong Tan,Yonghua Ji,Vijay S. Mookerjee
#t2006
#cINFORMS Journal on Computing
#index1275130
#%523751
#%597749
#%613128
#%613400
#%795385
#%795792
#%807043
#%857660
#%928567
#%949600
#%1112351
#%1113454
#%1117372
#%1122126
#%1122644
#%1122639
#%1290097
#%2884755
#!
  
#*Integer Linear Programming Models for Global Routing.
#@Laleh Behjat,Anthony Vannelli,William Rosehart
#t2006
#cINFORMS Journal on Computing
#index1275131
#%282096
#%446533
#%446400
#%622442
#%798317
#%2892312
#%3006755
#%3417747
#%3418189
#!
  
#*Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The Queue with Setup Times.
#@Seok Ho Chang,Dae Won Choi
#t2006
#cINFORMS Journal on Computing
#index1275132
#%924125
#%1036610
#%1290143
#!
  
#*A Projection-Based Reduction Approach to Computing Sensitivity of Steady-State Response of Nonlinear Circuits.
#@Praveen Pai,Emad Gad,Ramachandra Achar,Michel S. Nakhla,Roni Khazaka
#t2006
#cINFORMS Journal on Computing
#index1275133
#%282140
#%1289864
#!
  
#*The Multilevel Capacitated Minimum Spanning Tree Problem.
#@Ioannis Gamvros,Bruce L. Golden,S. Raghavan
#t2006
#cINFORMS Journal on Computing
#index1275134
#%885386
#%950399
#%1013380
#%1013994
#%1275204
#!
  
#*Exact Algorithms for a Loading Problem with Bounded Clique Width.
#@Linda S. Moonen,Frits C. R. Spieksma
#t2006
#cINFORMS Journal on Computing
#index1275135
#%660576
#%836522
#%838139
#%888370
#%971764
#%1015284
#%1089092
#!
  
#*Base Station Location and Service Assignments in W - CDMA Networks.
#@Joakim Kalvenes,Jeffery L. Kennington,Eli V. Olinick
#t2006
#cINFORMS Journal on Computing
#index1275136
#%155353
#%155405
#%1141361
#!
  
#*Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates.
#@Ruslan Sadykov,Laurence A. Wolsey
#t2006
#cINFORMS Journal on Computing
#index1275137
#%117526
#%924134
#%1275168
#!
  
#*Maximally Violated Mod- Cuts for the Capacitated Vehicle-Routing Problem.
#@Gerhard Reinelt,Klaus Michael Wenger
#t2006
#cINFORMS Journal on Computing
#index1275138
#% 
#!
  
#*A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem.
#@Guidong Zhu,Jonathan F. Bard,Gang Yu
#t2006
#cINFORMS Journal on Computing
#index1275139
#%812981
#%1275182
#%1275224
#%1288647
#!
  
#*Tonal Description of Polyphonic Audio for Music Content Processing.
#@Emilia Gómez
#t2006
#cINFORMS Journal on Computing
#index1275140
#%1228307
#!
  
#*Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks.
#@Ramesh Bollapragada,Yanjun Li,Uday S. Rao
#t2006
#cINFORMS Journal on Computing
#index1275141
#%932137
#%1290127
#!
  
#*Using Eigenvectors to Partition Circuits.
#@Dorothy Kucar,Anthony Vannelli
#t2006
#cINFORMS Journal on Computing
#index1275142
#%132652
#%133635
#%245323
#%446385
#%835950
#%931858
#!
  
#*A Data-Mining-Based Prefetching Approach to Caching for Network Storage Systems.
#@Xiao Fang,Olivia R. Liu Sheng,Wei Gao,Balakrishna R. Iyer
#t2006
#cINFORMS Journal on Computing
#index1275143
#%53724
#%95629
#%256249
#%296451
#%299947
#%597080
#%613379
#%636769
#%636728
#%772138
#%1078465
#%1112795
#%1120485
#%1122628
#!
  
#*Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method.
#@Jie Sun,Xinwei Liu
#t2006
#cINFORMS Journal on Computing
#index1275144
#%1014192
#%1290124
#%3003391
#%3005017
#!
  
#*Methodologies for Evaluation of Note-Based Music-Retrieval Systems.
#@Alexandra L. Uitdenbogerd,Abhijit Chattaraj,Justin Zobel
#t2006
#cINFORMS Journal on Computing
#index1275145
#%24744
#%157541
#%465274
#%501897
#%502235
#%502890
#%503047
#%559775
#%594557
#%595804
#%596016
#%893758
#%955509
#!
  
#*Discrepancy-Based Additive Bounding Procedures.
#@Andrea Lodi,Michela Milano,Louis-Martin Rousseau
#t2006
#cINFORMS Journal on Computing
#index1275146
#%15566
#%117338
#%117652
#%924047
#%1013648
#%1288743
#!
  
#*A Memetic Heuristic for the Generalized Quadratic Assignment Problem.
#@Jean-François Cordeau,Manlio Gaudioso,Gilbert Laporte,Luigi Moccia
#t2006
#cINFORMS Journal on Computing
#index1275147
#%812882
#%813608
#%924025
#!
  
#*Task Scheduling in a Finite-Resource, Reconfigurable Hardware/Software Codesign Environment.
#@Sin Ming Loo,B. Earl Wells
#t2006
#cINFORMS Journal on Computing
#index1275148
#%106024
#%106204
#%160928
#%282063
#%499074
#%542368
#%646157
#%808565
#%988702
#%1135468
#!
  
#*Stockout Compensation: Joint Inventory and Price Optimization in Electronic Retailing.
#@Hemant K. Bhargava,Daewon Sun,Susan H. Xu
#t2006
#cINFORMS Journal on Computing
#index1275149
#% 
#!
  
#*Optimization in Object Caching.
#@Kaushik Dutta,Samit Soni,Sridhar Narasimhan,Anindya Datta
#t2006
#cINFORMS Journal on Computing
#index1275150
#%140
#%533833
#%636728
#%832959
#%928564
#%1122639
#%1128575
#!
  
#*From the Editor.
#@W. David Kelton
#t2006
#cINFORMS Journal on Computing
#index1275151
#% 
#!
  
#*A Discrete Adjoint Variable Method for Printed-Circuit Board Computer-Aided Design.
#@Shirook M. Ali,Natalia K. Nikolova,Mohamed H. Bakr
#t2006
#cINFORMS Journal on Computing
#index1275152
#% 
#!
  
#*Recurrent Neural Networks for Music Computation.
#@Judy A. Franklin
#t2006
#cINFORMS Journal on Computing
#index1275153
#%271610
#%1022945
#!
  
#*Slicing It All Ways: Mathematical Models for Tonal Induction, Approximation, and Segmentation Using the Spiral Array.
#@Elaine Chew
#t2006
#cINFORMS Journal on Computing
#index1275154
#%329034
#%502115
#%1275140
#!
  
#*From the Guest Editor - Special Cluster on Operations Research in Electrical and Computer Engineering.
#@John W. Chinneck
#t2006
#cINFORMS Journal on Computing
#index1275155
#% 
#!
  
#*The Shortest-Path Problem with Resource Constraints and -Cycle Elimination for 3.
#@Stefan Irnich,Daniel Villeneuve
#t2006
#cINFORMS Journal on Computing
#index1275156
#% 
#!
  
#*Optimal Synchronization Policies for Data Warehouses.
#@Debabrata Dey,Zhongju Zhang,Prabuddha De
#t2006
#cINFORMS Journal on Computing
#index1275157
#%140048
#%159908
#%159914
#%326298
#%533900
#%545460
#%597924
#%598001
#%598314
#%598426
#%598842
#%598735
#%599117
#%599513
#%641893
#%642662
#%644063
#%769776
#%845918
#%950403
#%1064735
#%1112699
#%1113427
#%1117636
#%1118153
#%1118561
#%1122087
#%1122422
#%1122628
#%1196562
#!
  
#*Segmental Pattern Discovery in Music.
#@Darrell Conklin,Christina Anagnostopoulou
#t2006
#cINFORMS Journal on Computing
#index1275158
#%329035
#!
  
#*Semantics-Based Transaction Processing for Real-Time Databases: The Case of Automated Stock Trading.
#@Prabhudev Konana,Sudha Ram
#t1999
#cINFORMS Journal on Computing
#index1275159
#% 
#!
  
#*Optimal Integer Solutions to Industrial Cutting Stock Problems.
#@Zeger Degraeve,Linus Schrage
#t1999
#cINFORMS Journal on Computing
#index1275160
#% 
#!
  
#*An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine.
#@Gerhard J. Woeginger
#t1999
#cINFORMS Journal on Computing
#index1275161
#% 
#!
  
#*A Computational Study of Search Strategies for Mixed Integer Programming.
#@Jeff T. Linderoth,Martin W. P. Savelsbergh
#t1999
#cINFORMS Journal on Computing
#index1275162
#% 
#!
  
#*Propagation of Interval Values in Simple Processing Networks.
#@Brett W. Schug,Matthew J. Realff
#t1999
#cINFORMS Journal on Computing
#index1275163
#% 
#!
  
#*Feature Selection for Financial Credit-Risk Evaluation Decisions.
#@Selwyn Piramuthu
#t1999
#cINFORMS Journal on Computing
#index1275164
#% 
#!
  
#*Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory.
#@Charles Fleurent,Fred Glover
#t1999
#cINFORMS Journal on Computing
#index1275165
#% 
#!
  
#*Analysis of Stochastic Assembly with GI-Distributed Assembly Time.
#@W. E. Wilhelm,Pradip Som
#t1999
#cINFORMS Journal on Computing
#index1275166
#% 
#!
  
#*Packet Routing in Telecommunication Networks with Path and Flow Restrictions.
#@Larry J. LeBlanc,Jerome Chifflet,Philippe Mahey
#t1999
#cINFORMS Journal on Computing
#index1275167
#% 
#!
  
#*Solving Parallel Machine Scheduling Problems by Column Generation.
#@Zhi-Long Chen,Warren B. Powell
#t1999
#cINFORMS Journal on Computing
#index1275168
#% 
#!
  
#*Optimizing Expert Systems: Heuristics for Efficiently Generating Low-Cost Information Acquisition Strategies.
#@Michael V. Mannino,Vijay S. Mookerjee
#t1999
#cINFORMS Journal on Computing
#index1275169
#% 
#!
  
#*Computing Minimum-Weight Perfect Matchings.
#@William Cook,André Rohe
#t1999
#cINFORMS Journal on Computing
#index1275170
#% 
#!
  
#*A Class of Hard Small 0-1 Programs.
#@Gérard Cornuéjols,Milind Dawande
#t1999
#cINFORMS Journal on Computing
#index1275171
#% 
#!
  
#*A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems.
#@Antonio Frangioni,Giorgio Gallo
#t1999
#cINFORMS Journal on Computing
#index1275172
#% 
#!
  
#*Exact Solution of the Quadratic Knapsack Problem.
#@Alberto Caprara,David Pisinger,Paolo Toth
#t1999
#cINFORMS Journal on Computing
#index1275173
#% 
#!
  
#*Matrix Sensitivity Analysis from an Interior Solution of a Linear Program.
#@Harvey J. Greenberg
#t1999
#cINFORMS Journal on Computing
#index1275174
#% 
#!
  
#*A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem.
#@James P. Kelly,Jiefeng Xu
#t1999
#cINFORMS Journal on Computing
#index1275175
#% 
#!
  
#*Direct Marketing Performance Modeling Using Genetic Algorithms.
#@Siddhartha Bhattacharyya
#t1999
#cINFORMS Journal on Computing
#index1275176
#% 
#!
  
#*Analyzing Infeasible Mixed-Integer and Integer Linear Programs.
#@Olivier Guieu,John W. Chinneck
#t1999
#cINFORMS Journal on Computing
#index1275177
#% 
#!
  
#*Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem.
#@Vittorio Maniezzo
#t1999
#cINFORMS Journal on Computing
#index1275178
#% 
#!
  
#*Mathematical Programming for Data Mining: Formulations and Challenges.
#@Paul S. Bradley,Usama M. Fayyad,Olvi L. Mangasarian
#t1999
#cINFORMS Journal on Computing
#index1275179
#% 
#!
  
#*A Study of Composite or Hybrid Classifiers for Knowledge Discovery.
#@Akhil Kumar,Ignacio Olmeda
#t1999
#cINFORMS Journal on Computing
#index1275180
#% 
#!
  
#*Improvement Procedures for the Undirected Rural Postman Problem.
#@Alain Hertz,Gilbert Laporte,Pierrette Nanchen Hugo
#t1999
#cINFORMS Journal on Computing
#index1275181
#% 
#!
  
#*Lifted Cover Inequalities for 0-1 Integer Programs: Complexity.
#@Zonghao Gu,George L. Nemhauser,Martin W. P. Savelsbergh
#t1999
#cINFORMS Journal on Computing
#index1275182
#% 
#!
  
#*An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network.
#@Jeffery L. Kennington,Jason E. Whitler
#t1999
#cINFORMS Journal on Computing
#index1275183
#% 
#!
  
#*On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming.
#@Erling D. Andersen
#t1999
#cINFORMS Journal on Computing
#index1275184
#% 
#!
  
#*Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.
#@Andrea Lodi,Silvano Martello,Daniele Vigo
#t1999
#cINFORMS Journal on Computing
#index1275185
#% 
#!
  
#*Computing Laplace Transforms for Numerical Inversion Via Continued Fractions.
#@Joseph Abate,Ward Whitt
#t1999
#cINFORMS Journal on Computing
#index1275186
#% 
#!
  
#*Localizer: A Modeling Language for Local Search.
#@Laurent D. Michel,Pascal Van Hentenryck
#t1999
#cINFORMS Journal on Computing
#index1275187
#% 
#!
  
#*Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results.
#@Mark A. Fleischer,Sheldon H. Jacobson
#t1999
#cINFORMS Journal on Computing
#index1275188
#% 
#!
  
#*GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization.
#@Manuel Laguna,Rafael Martí
#t1999
#cINFORMS Journal on Computing
#index1275189
#% 
#!
  
#*Parallel Complexity of Additive Location Problems.
#@Igor Averbakh,Oded Berman
#t1999
#cINFORMS Journal on Computing
#index1275190
#% 
#!
  
#*A Fuzzy Hopfield-Tank Traveling Salesman Problem Model.
#@William J. Wolfe
#t1999
#cINFORMS Journal on Computing
#index1275191
#% 
#!
  
#*Data Mining by Decomposition: Adaptive Search for Hypothesis Generation.
#@Hemant K. Bhargava
#t1999
#cINFORMS Journal on Computing
#index1275192
#% 
#!
  
#*Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research.
#@Kate A. Smith
#t1999
#cINFORMS Journal on Computing
#index1275193
#% 
#!
  
#*]ary - The World Wide Web: It's the Customers.
#@Michael Trick
#t1998
#cINFORMS Journal on Computing
#index1275194
#% 
#!
  
#*Solving the Orienteering Problem through Branch-and-Cut.
#@Matteo Fischetti,Juan José Salazar González,Paolo Toth
#t1998
#cINFORMS Journal on Computing
#index1275195
#% 
#!
  
#*Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem.
#@Les G. Proll,Barbara Smith
#t1998
#cINFORMS Journal on Computing
#index1275196
#% 
#!
  
#*Feature Selection via Mathematical Programming.
#@Paul S. Bradley,Olvi L. Mangasarian,W. Nick Street
#t1998
#cINFORMS Journal on Computing
#index1275197
#% 
#!
  
#*Partitioning the Attribute Set for a Probabilistic Reasoning System.
#@Sumit Sarkar,Deb Ghosh
#t1998
#cINFORMS Journal on Computing
#index1275198
#% 
#!
  
#*On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem.
#@Pablo Moscato,Michael G. Norman
#t1998
#cINFORMS Journal on Computing
#index1275199
#% 
#!
  
#*On Formal Semantics and Analysis of Typed Modeling Languages: An Analysis of Ascend.
#@Hemant K. Bhargava,Ramayya Krishnan,Peter Piela
#t1998
#cINFORMS Journal on Computing
#index1275200
#% 
#!
  
#*Appreciation to Referees.
#@Bruce L. Golden
#t1998
#cINFORMS Journal on Computing
#index1275201
#% 
#!
  
#*Online Scheduling with Lookahead: Multipass Assembly Lines.
#@Rajeev Motwani,Vijay A. Saraswat,Eric Torng
#t1998
#cINFORMS Journal on Computing
#index1275202
#% 
#!
  
#*Distribution Estimation Using Laplace Transforms.
#@Carl M. Harris,William G. Marchal
#t1998
#cINFORMS Journal on Computing
#index1275203
#% 
#!
  
#*A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems.
#@Geir Dahl,Mechthild Stoer
#t1998
#cINFORMS Journal on Computing
#index1275204
#% 
#!
  
#*A Virtual Clustering Approach for Routing Problems in Telecommunication Networks.
#@Michael R. Bartolacci,S. David Wu
#t1998
#cINFORMS Journal on Computing
#index1275205
#% 
#!
  
#*Rejoinder - OR/MS, Electronic Commerce, and the Virtual INFORMS Community.
#@Hemant K. Bhargava,Ramayya Krishnan
#t1998
#cINFORMS Journal on Computing
#index1275206
#% 
#!
  
#*An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System.
#@E. Andrew Boyd,Rusty Burlingame,Kenneth Lindsay
#t1998
#cINFORMS Journal on Computing
#index1275207
#% 
#!
  
#*Sparse Matrix Ordering Methods for Interior Point Linear Programming.
#@Edward Rothberg,Bruce Hendrickson
#t1998
#cINFORMS Journal on Computing
#index1275208
#% 
#!
  
#*Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems.
#@Yu-Li Chou,H. Edwin Romeijn,Robert L. Smith
#t1998
#cINFORMS Journal on Computing
#index1275209
#% 
#!
  
#*A Branch and Bound Algorithm for the Stability Number of a Sparse Graph.
#@E. C. Sewell
#t1998
#cINFORMS Journal on Computing
#index1275210
#% 
#!
  
#*Interval Graph Problems on Reconfigurable Meshes.
#@Stephan Olariu,James L. Schwing,Jingyuan Zhang
#t1995
#cINFORMS Journal on Computing
#index1275211
#% 
#!
  
#*Commentary - Dynamic, Distributed, Platform Independent OR/MS Applications - A Network Perspective.
#@Gordon H. Bradley,Arnold H. Buss
#t1998
#cINFORMS Journal on Computing
#index1275212
#% 
#!
  
#*On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms.
#@Matthew J. Realff,George Stephanopoulos
#t1998
#cINFORMS Journal on Computing
#index1275213
#% 
#!
  
#*An Incremental Branch-and-Bound Method for the Satisfiability Problem.
#@Hachemi Bennaceur,Idir Gouachi,Gérard Plateau
#t1998
#cINFORMS Journal on Computing
#index1275214
#% 
#!
  
#*Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control.
#@Jonathan Eckstein,Michael C. Ferris
#t1998
#cINFORMS Journal on Computing
#index1275215
#% 
#!
  
#*Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming.
#@Ken Darby-Dowman,James Little
#t1998
#cINFORMS Journal on Computing
#index1275216
#% 
#!
  
#*Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem.
#@H. A. J. Crauwels,C. N. Potts,Luk N. Van Wassenhove
#t1998
#cINFORMS Journal on Computing
#index1275217
#% 
#!
  
#*Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints.
#@Luis Gouveia
#t1998
#cINFORMS Journal on Computing
#index1275218
#% 
#!
  
#*Commentary - Predictions for Web Technologies in Optimization.
#@Robert Fourer
#t1998
#cINFORMS Journal on Computing
#index1275219
#% 
#!
  
#*An Efficient Algorithm for a Class of Two-Resource Allocation Problems.
#@R. Armstrong,S. Gu,L. Lei
#t1998
#cINFORMS Journal on Computing
#index1275220
#% 
#!
  
#*Connections Between Integer Linear Programming and Constraint Logic Programming - An Overview and Introduction to the Cluster of Articles.
#@H. Paul Williams,John M. Wilson
#t1998
#cINFORMS Journal on Computing
#index1275221
#% 
#!
  
#*An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull.
#@José H. Dulá,Richard V. Helgason,N. Venugopal
#t1998
#cINFORMS Journal on Computing
#index1275222
#% 
#!
  
#*Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming.
#@Alexander Bockmayr,Thomas Kasper
#t1998
#cINFORMS Journal on Computing
#index1275223
#% 
#!
  
#*Lifted Cover Inequalities for 0-1 Integer Programs: Computation.
#@Zonghao Gu,George L. Nemhauser,Martin W. P. Savelsbergh
#t1998
#cINFORMS Journal on Computing
#index1275224
#% 
#!
  
#*A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies.
#@Sabyasachi Mitra,Ishwar Murthy
#t1998
#cINFORMS Journal on Computing
#index1275225
#% 
#!
  
#*Commentary - A New Horizon for OR/MS.
#@Arthur M. Geoffrion
#t1998
#cINFORMS Journal on Computing
#index1275226
#% 
#!
  
#*An Approximate Analysis of a UNIX Macro Process Scheduler.
#@Robert A. Benhenni
#t1998
#cINFORMS Journal on Computing
#index1275227
#% 
#!
  
#*Complexity of Simulation Models: A Graph Theoretic Approach.
#@Enver Yücesan,Lee W. Schruben
#t1998
#cINFORMS Journal on Computing
#index1275228
#% 
#!
  
#*Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms.
#@Frederick Kaefer,June S. Park
#t1998
#cINFORMS Journal on Computing
#index1275229
#% 
#!
  
#*Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems.
#@István Maros,Gautam Mitra
#t1998
#cINFORMS Journal on Computing
#index1275230
#% 
#!
  
#*Feature Article - The World Wide Web: Opportunities for Operations Research and Management Science.
#@Hemant K. Bhargava,Ramayya Krishnan
#t1998
#cINFORMS Journal on Computing
#index1275231
#% 
#!
  
#*Numerical Methods for Fitting and Simulating Autoregressive-to-Anything Processes.
#@Marne C. Cario,Barry L. Nelson
#t1998
#cINFORMS Journal on Computing
#index1275232
#% 
#!
  
#*Distributed State Space Generation of Discrete-State Stochastic Models.
#@Gianfranco Ciardo,Joshua Gluckman,David M. Nicol
#t1998
#cINFORMS Journal on Computing
#index1275233
#% 
#!
  
#*Interval Protection of Confidential Information in a Database.
#@Ram D. Gopal,Paulo B. Goes,Robert S. Garfinkel
#t1998
#cINFORMS Journal on Computing
#index1275234
#% 
#!
  
#*Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs.
#@Julia L. Higle
#t1998
#cINFORMS Journal on Computing
#index1275235
#% 
#!
  
#*SSS: Subrouting Set for Experimenting in Simulation Research.
#@A. M. Pollatschek
#t1994
#cINFORMS Journal on Computing
#index1275236
#% 
#!
  
#*Error Bound of a Heuristic for the Common Due Date Scheduling Problem.
#@Surya Danusaputro Liman,Chung-Yee Lee
#t1993
#cINFORMS Journal on Computing
#index1275237
#% 
#!
  
#*An Exact Solution Approach Based on Shortest-Paths for -Hub Median Problems.
#@Andreas T. Ernst,Mohan Krishnamoorthy
#t1998
#cINFORMS Journal on Computing
#index1275238
#% 
#!
  
#*Scheduling Periodic Tasks.
#@Jan H. M. Korst,Emile H. L. Aarts,Jan Karel Lenstra
#t1996
#cINFORMS Journal on Computing
#index1275239
#% 
#!
  
#*An Implementation of LPFORM.
#@Pai-Chun Ma,Frederic H. Murphy,Edward A. Stohr
#t1996
#cINFORMS Journal on Computing
#index1275240
#% 
#!
  
#*Use of Representative Operation Counts in Computational Testing of Algorithms.
#@Ravindra K. Ahuja,James B. Orlin
#t1996
#cINFORMS Journal on Computing
#index1275241
#% 
#!
  
#*Isomorphic Routing on a Toroidal Mesh.
#@Weizhen Mao,David M. Nicol
#t1996
#cINFORMS Journal on Computing
#index1275242
#% 
#!
  
#*Rejoinder - Challenges in Algorithm Simulation.
#@Catherine C. McGeoch
#t1996
#cINFORMS Journal on Computing
#index1275243
#% 
#!
  
#*The Multi-Tier Tree Problem.
#@Prakash Mirchandani
#t1996
#cINFORMS Journal on Computing
#index1275244
#% 
#!
  
#*The Vehicle Routing Problem with Time Windows Part II: Genetic Search.
#@Jean-Yves Potvin,Samy Bengio
#t1996
#cINFORMS Journal on Computing
#index1275245
#% 
#!
  
#*Commentary - On Experimental Methods for Algorithm Simulation.
#@James B. Orlin
#t1996
#cINFORMS Journal on Computing
#index1275246
#% 
#!
  
#*Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors.
#@Minghe Sun,Ralph E. Steuer
#t1996
#cINFORMS Journal on Computing
#index1275247
#% 
#!
  
#*An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.
#@Abraham P. Punnen,K. P. K. Nair
#t1996
#cINFORMS Journal on Computing
#index1275248
#% 
#!
  
#*A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time.
#@J. A. Hoogeveen,Steef L. van de Velde
#t1996
#cINFORMS Journal on Computing
#index1275249
#% 
#!
  
#*Selecting Ingot Sizes for Joint Production of Sheet Products.
#@Anantaram Balakrishnan,Srimathy Gopalakrishnan
#t1996
#cINFORMS Journal on Computing
#index1275250
#% 
#!
  
#*A Self-Organizing Approach to Managerial Nonlinear Discriminant Analysis: A Hybrid Method of Linear Discriminant Analysis and Neural Networks.
#@Shouhong Wang
#t1996
#cINFORMS Journal on Computing
#index1275251
#% 
#!
  
#*A Comparison of Alternative Approaches for Numerical Solutions of GI/PH/1 Queues.
#@Edward P. C. Kao
#t1996
#cINFORMS Journal on Computing
#index1275252
#% 
#!
  
#*Inventory Management in Catalog Sales Companies.
#@Gabriel R. Bitran,Susana V. Mondschein
#t1996
#cINFORMS Journal on Computing
#index1275253
#% 
#!
  
#*Application of an Annealed Neural Network to a Timetabling Problem.
#@Helmut E. Mausser,Michael J. Magazine,John B. Moore
#t1996
#cINFORMS Journal on Computing
#index1275254
#% 
#!
  
#*An ( log ) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds.
#@C. P. M. van Hoesel,Albert P. M. Wagelmans,M. van Vliet
#t1996
#cINFORMS Journal on Computing
#index1275255
#% 
#!
  
#*Stopping Criteria for Finite Length Genetic Algorithms.
#@Haldun Aytug,Gary J. Koehler
#t1996
#cINFORMS Journal on Computing
#index1275256
#% 
#!
  
#*A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem.
#@Jacques Renaud,Fayez F. Boctor,Gilbert Laporte
#t1996
#cINFORMS Journal on Computing
#index1275257
#% 
#!
  
#*Job Shop Scheduling by Local Search.
#@Rob J. M. Vaessens,Emile H. L. Aarts,Jan Karel Lenstra
#t1996
#cINFORMS Journal on Computing
#index1275258
#% 
#!
  
#*Bottleneck Steiner Subnetwork Problems with -Connectivity Constraints.
#@Igor Averbakh,Oded Berman
#t1996
#cINFORMS Journal on Computing
#index1275259
#% 
#!
  
#*Methodology for Stochastic Graph Completion-Time Problems.
#@T. Jayawardena,Sidney Yakowitz
#t1996
#cINFORMS Journal on Computing
#index1275260
#% 
#!
  
#*Feature Article - Toward an Experimental Method for Algorithm Simulation.
#@Catherine C. McGeoch
#t1996
#cINFORMS Journal on Computing
#index1275261
#% 
#!
  
#*A Branch and Cut Algorithm for a Steiner Tree-Star Problem.
#@Youngho Lee,Steve Y. Chiu,Jennifer Ryan
#t1996
#cINFORMS Journal on Computing
#index1275262
#% 
#!
  
#*Multicommodity Flows in Ring Networks.
#@Rita Vachani,Alexander Shulman,Peter Kubat,Julie Ward
#t1996
#cINFORMS Journal on Computing
#index1275263
#% 
#!
  
#*On the Two-Level Uncapacitated Facility Location Problem.
#@Karen Aardal,Martine Labbé,Janny Leung,Maurice Queyranne
#t1996
#cINFORMS Journal on Computing
#index1275264
#% 
#!
  
#*An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks.
#@James P. Jarvis,Douglas R. Shier
#t1996
#cINFORMS Journal on Computing
#index1275265
#% 
#!
  
#*Computation of Derivatives by Means of the Power-Series Algorithm.
#@J. P. C. Blanc,Robert D. van der Mei
#t1996
#cINFORMS Journal on Computing
#index1275266
#% 
#!
  
#*Commentary - On Algorithm Analysis.
#@Douglas R. Shier
#t1996
#cINFORMS Journal on Computing
#index1275267
#% 
#!
  
#*Localizing and Diagnosing Infeasibilities in Networks.
#@John W. Chinneck
#t1996
#cINFORMS Journal on Computing
#index1275268
#% 
#!
  
#*Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems.
#@David W. Coit,Alice E. Smith,David M. Tate
#t1996
#cINFORMS Journal on Computing
#index1275269
#% 
#!
  
#*Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem.
#@Laura A. Sanchis,Arun Jagota
#t1996
#cINFORMS Journal on Computing
#index1275270
#% 
#!
  
#*Constraint Propagation Based Scheduling of Job Shops.
#@Erwin Pesch,Ulrich A. W. Tetzlaff
#t1996
#cINFORMS Journal on Computing
#index1275271
#% 
#!
  
#*Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.
#@Bruno Codenotti,Giovanni Manzini,Luciano Margara,Giovanni Resta
#t1996
#cINFORMS Journal on Computing
#index1275272
#% 
#!
  
#*Capacitated Network Design - Polyhedral Structure and Computation.
#@Daniel Bienstock,Oktay Günlük
#t1996
#cINFORMS Journal on Computing
#index1275273
#% 
#!
  
#*A Column Generation Approach for Graph Coloring.
#@Anuj Mehrotra,Michael A. Trick
#t1996
#cINFORMS Journal on Computing
#index1275274
#% 
#!
  
#*The Vehicle Routing Problem with Time Windows Part I: Tabu Search.
#@Jean-Yves Potvin,Tanguy Kervahut,Bruno-Laurent Garcia,Jean-Marc Rousseau
#t1996
#cINFORMS Journal on Computing
#index1275275
#% 
#!
  
#*Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances.
#@David P. Williamson,Michel X. Goemans
#t1996
#cINFORMS Journal on Computing
#index1275276
#% 
#!
  
#*Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem.
#@Leslie Hall
#t1996
#cINFORMS Journal on Computing
#index1275277
#% 
#!
  
#*On the Laguerre Method for Numerically Inverting Laplace Transforms.
#@Joseph Abate,Gagan L. Choudhury,Ward Whitt
#t1996
#cINFORMS Journal on Computing
#index1275278
#% 
#!
  
#*Commentary - Simulation of Algorithms for Performance Analysis.
#@Pierre L'Ecuyer
#t1996
#cINFORMS Journal on Computing
#index1275279
#% 
#!
  
#*A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains.
#@R. Bruce Mattingly
#t1995
#cINFORMS Journal on Computing
#index1275280
#% 
#!
  
#*Ghost Image Processing for Minimum Covariance Determinants.
#@David L. Woodruff
#t1995
#cINFORMS Journal on Computing
#index1275281
#% 
#!
  
#*A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods.
#@Joseph Czyzyk,Robert Fourer,Sanjay Mehrotra
#t1995
#cINFORMS Journal on Computing
#index1275282
#% 
#!
  
#*Bounds and Approximations for Overheads in the Time to Join Parallel Forks.
#@Peter J. Downey
#t1995
#cINFORMS Journal on Computing
#index1275283
#% 
#!
  
#*Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2.
#@Jonathan Eckstein,I. Ilkay Boduroglu,Lazaros C. Polymenakos,Donald Goldfarb
#t1995
#cINFORMS Journal on Computing
#index1275284
#% 
#!
  
#*A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems.
#@Kurt M. Bretthauer,Bala Shetty,Siddhartha Syam
#t1995
#cINFORMS Journal on Computing
#index1275285
#% 
#!
  
#*Access Path Optimization in Relational Joins.
#@Ram D. Gopal,Ram Ramesh,Stanley Zionts
#t1995
#cINFORMS Journal on Computing
#index1275286
#% 
#!
  
#*Incorporating the Majority Consensus Concurrency Control Mechanism into the Database Allocation Problem.
#@Sudha Ram,Sridhar Narasimhan
#t1995
#cINFORMS Journal on Computing
#index1275287
#% 
#!
  
#*A Graph Theory-Based Approach for Partitioning Knowledge Bases.
#@Rajan Srikanth
#t1995
#cINFORMS Journal on Computing
#index1275288
#% 
#!
  
#*Optimal Scheduling of Tasks on Identical Parallel Processors.
#@Mauro Dell'Amico,Silvano Martello
#t1995
#cINFORMS Journal on Computing
#index1275289
#% 
#!
  
#*Problem and Heuristic Space Search Strategies for Job Shop Scheduling.
#@Robert H. Storer,S. David Wu,Renzo Vaccari
#t1995
#cINFORMS Journal on Computing
#index1275290
#% 
#!
  
#*Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming.
#@Robert Fourer,David M. Gay
#t1995
#cINFORMS Journal on Computing
#index1275291
#% 
#!
  
#*A GRASP for the Vehicle Routing Problem with Time Windows.
#@George Kontoravdis,Jonathan F. Bard
#t1995
#cINFORMS Journal on Computing
#index1275292
#% 
#!
  
#*Tabu Thresholding: Improved Search by Nonmonotonic Trajectories.
#@Fred Glover
#t1995
#cINFORMS Journal on Computing
#index1275293
#% 
#!
  
#*The Distribution Problem with Carrier Service: A Dual Based Penalty Approach.
#@Moustapha Diaby,R. Ramesh
#t1995
#cINFORMS Journal on Computing
#index1275294
#% 
#!
  
#*A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities.
#@Donald L. Miller,Joseph F. Pekny
#t1995
#cINFORMS Journal on Computing
#index1275295
#% 
#!
  
#*Load Balancing in Hypercube Solution of Stochastic Optimization Problems.
#@Nils Jacob Berland
#t1995
#cINFORMS Journal on Computing
#index1275296
#% 
#!
  
#*Spectral Analysis of Basic TES Processes.
#@David L. Jagerman,Benjamin Melamed
#t1995
#cINFORMS Journal on Computing
#index1275297
#% 
#!
  
#*Hulls and Efficient Sets for the Rectilinear Norm.
#@Dilip Chhajed,Vijay Chandru
#t1995
#cINFORMS Journal on Computing
#index1275298
#% 
#!
  
#*Scheduling Independent Jobs on Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis.
#@S. Thomas McCormick,Michael L. Pinedo
#t1995
#cINFORMS Journal on Computing
#index1275299
#% 
#!
  
#*Single Machine Scheduling to Minimize Total Weighted Late Work.
#@A. M. A. Hariri,C. N. Potts,Luk N. Van Wassenhove
#t1995
#cINFORMS Journal on Computing
#index1275300
#% 
#!
  
#*Preprocessing in Stochastic Programming: The Case of Capacitated Networks.
#@Stein W. Wallace,Roger J.-B. Wets
#t1995
#cINFORMS Journal on Computing
#index1275301
#% 
#!
  
#*Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs.
#@Leon S. Lasdon,John C. Plummer,Gang Yu
#t1995
#cINFORMS Journal on Computing
#index1275302
#% 
#!
  
#*Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods.
#@T. C. Hu,Andrew B. Kahng,Chung-Wen Albert Tsao
#t1995
#cINFORMS Journal on Computing
#index1275303
#% 
#!
  
#*Parallel Algorithms for Stochastic Dynamic Programming with Continuous State and Control Variables.
#@Elizabeth A. Eschenbach,Christine A. Shoemaker,Hugh M. Caffey
#t1995
#cINFORMS Journal on Computing
#index1275304
#% 
#!
  
#*Feature Article - Parallel Discrete Event Simulation: Will the Field Survive?
#@Richard M. Fujimoto
#t1993
#cINFORMS Journal on Computing
#index1275305
#% 
#!
  
#*Stability of -Persistent CSMA/CD.
#@June S. Park,Robert Bartoszynski,Walter A. Rosenkrantz
#t1995
#cINFORMS Journal on Computing
#index1275306
#% 
#!
  
#*Introduction to the Cluster on Knowledge and Data Management.
#@Amit Basu
#t1995
#cINFORMS Journal on Computing
#index1275307
#% 
#!
  
#*Parallel Search Algorithms for Discrete Optimization Problems.
#@Ananth Grama,Vipin Kumar
#t1995
#cINFORMS Journal on Computing
#index1275308
#% 
#!
  
#*Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference.
#@Lee K. Jones,Richard C. Larson
#t1995
#cINFORMS Journal on Computing
#index1275309
#% 
#!
  
#*Numerical Inversion of Laplace Transforms of Probability Distributions.
#@Joseph Abate,Ward Whitt
#t1995
#cINFORMS Journal on Computing
#index1275310
#% 
#!
  
#*A Matching Identification Problem: A Knowledge Acquisition Approach.
#@Abraham Mehrez,Geoffrey Steinberg
#t1995
#cINFORMS Journal on Computing
#index1275311
#% 
#!
  
#*A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups.
#@Carsten Jordan,Andreas Drexl
#t1995
#cINFORMS Journal on Computing
#index1275312
#% 
#!
  
#*Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain.
#@Daniel P. Heyman,Meredith J. Goldsmith
#t1995
#cINFORMS Journal on Computing
#index1275313
#% 
#!
  
#*Analyzing the Pooling Problem.
#@Harvey J. Greenberg
#t1995
#cINFORMS Journal on Computing
#index1275314
#% 
#!
  
#*Solving a Class Scheduling Problem with a Genetic Algorithm.
#@Jeffrey W. Herrmann,Chung-Yee Lee
#t1995
#cINFORMS Journal on Computing
#index1275315
#% 
#!
  
#*A Stochastic Model for Performance Evaluation of Main Memory Resident Database Systems.
#@Paulo B. Goes
#t1995
#cINFORMS Journal on Computing
#index1275316
#% 
#!
  
#*Disjoint Paths in the Plane.
#@Thomas M. Liebling,François Margot,D. Müller,A. Prodon,L. Stauffer
#t1995
#cINFORMS Journal on Computing
#index1275317
#% 
#!
  
#*Performance Issues for the Iterative Solution of Markov Decision Processes on Parallel Computers.
#@Thomas W. Archibald,K. I. M. McKinnon,Lyn C. Thomas
#t1995
#cINFORMS Journal on Computing
#index1275318
#% 
#!
  
#*A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems.
#@Donald L. Miller
#t1995
#cINFORMS Journal on Computing
#index1275319
#% 
#!
  
#*On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem.
#@Sunan Han,Dawei Hong,Joseph Y.-T. Leung
#t1995
#cINFORMS Journal on Computing
#index1275320
#% 
#!
  
#*A Relationship Between CNF and DNF Systems Derivable from Examples.
#@Evangelos Triantaphyllou,Allen L. Soyster
#t1995
#cINFORMS Journal on Computing
#index1275321
#% 
#!
  
#*Perspectives on Simulation Research and Practice.
#@W. David Kelton
#t1994
#cINFORMS Journal on Computing
#index1275322
#% 
#!
  
#*A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph.
#@Joseph F. Pekny,Donald L. Miller
#t1994
#cINFORMS Journal on Computing
#index1275323
#% 
#!
  
#*Commentary - Progress in Linear Programming.
#@Robert E. Bixby
#t1994
#cINFORMS Journal on Computing
#index1275324
#% 
#!
  
#*Primary and Secondary Route Selection in Backbone Computer Networks.
#@Hasan Pirkul,Sridhar Narasimhan
#t1994
#cINFORMS Journal on Computing
#index1275325
#% 
#!
  
#*Commentary - Interior-Point Methods: Algorithms and Formulations.
#@Robert J. Vanderbei
#t1994
#cINFORMS Journal on Computing
#index1275326
#% 
#!
  
#*Convergence Results for Harmonic Gradient Estimators.
#@Sheldon H. Jacobson
#t1994
#cINFORMS Journal on Computing
#index1275327
#% 
#!
  
#*A Double-Layered Learning Approach to Acquiring Rules for Classification: Integrating Genetic Algorithms with Similarity-Based Learning.
#@Riyaz Sikora,Michael J. Shaw
#t1994
#cINFORMS Journal on Computing
#index1275328
#% 
#!
  
#*Optimization of Simulation via Quasi-Newton Methods.
#@M. Hossein Safizadeh,Robert Signorile
#t1994
#cINFORMS Journal on Computing
#index1275329
#% 
#!
  
#*Parallel Taboo Search Techniques for the Job Shop Scheduling Problem.
#@Éric D. Taillard
#t1994
#cINFORMS Journal on Computing
#index1275330
#% 
#!
  
#*Feature Article - Visualization and Optimization.
#@Christopher V. Jones
#t1994
#cINFORMS Journal on Computing
#index1275331
#% 
#!
  
#*Commentary - The Promise of OR is Helping to Solve Problems.
#@Harvey J. Greenberg,Frederic H. Murphy
#t1994
#cINFORMS Journal on Computing
#index1275332
#% 
#!
  
#*Commentary - Visualization and Optimization: The Future Lies Together.
#@Peter C. Bell
#t1994
#cINFORMS Journal on Computing
#index1275333
#% 
#!
  
#*Intelligent Objects in Simulation.
#@Mufit Ozden
#t1994
#cINFORMS Journal on Computing
#index1275334
#% 
#!
  
#*Fast Clustering Algorithms.
#@Ulrich Dorndorf,Erwin Pesch
#t1994
#cINFORMS Journal on Computing
#index1275335
#% 
#!
  
#*Numerical Factorization Methods for Interior Point Algorithms.
#@Ho-Won Jung,Roy E. Marsten,Matthew J. Saltzman
#t1994
#cINFORMS Journal on Computing
#index1275336
#% 
#!
  
#*Complexity of Hierarchical Trees in Evidence Theory.
#@Vincent Dugat,Sandra Sandri
#t1994
#cINFORMS Journal on Computing
#index1275337
#% 
#!
  
#*A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones.
#@Khaled S. Al-Sultan
#t1994
#cINFORMS Journal on Computing
#index1275338
#% 
#!
  
#*Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art.
#@Irvin J. Lustig,Roy E. Marsten,David F. Shanno
#t1994
#cINFORMS Journal on Computing
#index1275339
#% 
#!
  
#*Rejoinder - The Last Word on Interior Point Methods for Linear Programming - For Now.
#@Irvin J. Lustig,Roy E. Marsten,David F. Shanno
#t1994
#cINFORMS Journal on Computing
#index1275340
#% 
#!
  
#*Commentary - Major Cholesky Would Feel Proud.
#@Michael A. Saunders
#t1994
#cINFORMS Journal on Computing
#index1275341
#% 
#!
  
#*Design of Performance Constrained Optic Fiber Multidrop Access Networks.
#@Rajiv M. Dewan
#t1994
#cINFORMS Journal on Computing
#index1275342
#% 
#!
  
#*Commentary - Designing Tools for Visualization and Optimization.
#@Jerry Keiper,Tom Wickham-Jones
#t1994
#cINFORMS Journal on Computing
#index1275343
#% 
#!
  
#*From the Editor.
#@Bruce L. Golden
#t1994
#cINFORMS Journal on Computing
#index1275344
#% 
#!
  
#*An Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane.
#@Constantine N. K. Osiakwan,Selim G. Akl
#t1994
#cINFORMS Journal on Computing
#index1275345
#% 
#!
  
#*Consistency in Valuation-Based Systems.
#@Prakash P. Shenoy
#t1994
#cINFORMS Journal on Computing
#index1275346
#% 
#!
  
#*The Reactive Tabu Search.
#@Roberto Battiti,Giampietro Tecchiolli
#t1994
#cINFORMS Journal on Computing
#index1275347
#% 
#!
  
#*Rejoinder - Anchoring and Cross-Fertilization.
#@Christopher V. Jones
#t1994
#cINFORMS Journal on Computing
#index1275348
#% 
#!
  
#*A Numerical Method for Controlled Routing in Large Trunk Line Networks via Stochastic Control Theory.
#@Harold J. Kushner,Jichuan Yang
#t1994
#cINFORMS Journal on Computing
#index1275349
#% 
#!
  
#*CONOPT - A Large-Scale GRG Code.
#@Arne Stolbjerg Drud
#t1994
#cINFORMS Journal on Computing
#index1275350
#% 
#!
  
#*Preprocessing and Probing Techniques for Mixed Integer Programming Problems.
#@Martin W. P. Savelsbergh
#t1994
#cINFORMS Journal on Computing
#index1275351
#% 
#!
  
#*A Structured Expert System for Model Management in Inventory Control.
#@Nasir Ghiaseddin,Khalil Matta,Diptendu Sinha
#t1994
#cINFORMS Journal on Computing
#index1275352
#% 
#!
  
#*The Application of Metamodeling to Interconnection Network Analysis.
#@Wade H. Shaw Jr.,Nathaniel J. Davis IV,Richard A. Raines
#t1994
#cINFORMS Journal on Computing
#index1275353
#% 
#!
  
#*A Flexible Method for Estimating Inverse Distribution Functions in Simulation Experiments.
#@Athanassios N. Avramidis,James R. Wilson
#t1994
#cINFORMS Journal on Computing
#index1275354
#% 
#!
  
#*From the Editor.
#@Bruce L. Golden
#t1994
#cINFORMS Journal on Computing
#index1275355
#% 
#!
  
#*Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem.
#@Edward J. Anderson,Michael C. Ferris
#t1994
#cINFORMS Journal on Computing
#index1275356
#% 
#!
  
#*Commentary - Theory and Practice for Interior-Point Methods.
#@Michael J. Todd
#t1994
#cINFORMS Journal on Computing
#index1275357
#% 
#!
  
#*Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic.
#@Ronny Aboudi,Kurt Jörnsten
#t1994
#cINFORMS Journal on Computing
#index1275358
#% 
#!
  
#*On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases.
#@Jacek Gondzio
#t1994
#cINFORMS Journal on Computing
#index1275359
#% 
#!
  
#*Genetic Algorithms and Random Keys for Sequencing and Optimization.
#@James C. Bean
#t1994
#cINFORMS Journal on Computing
#index1275360
#% 
#!
  
#*Commentary - Visualization in Vehicle Routing and Scheduling Problems.
#@Lawrence Bodin,Laurence Levy
#t1994
#cINFORMS Journal on Computing
#index1275361
#% 
#!
  
#*A Computational Study of Satisfiability Algorithms for Propositional Logic.
#@Farid Harche,John N. Hooker,Gerald L. Thompson
#t1994
#cINFORMS Journal on Computing
#index1275362
#% 
#!
  
#*On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes.
#@Mary Melekopoglou,Anne Condon
#t1994
#cINFORMS Journal on Computing
#index1275363
#% 
#!
  
#*Experimental Evaluation of a Procedure for Estimating Nonhomogeneous Poisson Processes Having Cyclic Behavior.
#@Mary A. Johnson,Sanghoon Lee,James R. Wilson
#t1994
#cINFORMS Journal on Computing
#index1275364
#% 
#!
  
#*A Computational Study of Local Search Algorithms for Job Shop Scheduling.
#@Emile H. L. Aarts,Peter J. M. van Laarhoven,Jan Karel Lenstra,Nico L. J. Ulder
#t1994
#cINFORMS Journal on Computing
#index1275365
#% 
#!
  
#*A Bayesian Approach to Database Query Optimization.
#@Kevin D. Seppi,J. Wesley Barnes,Carl N. Morris
#t1993
#cINFORMS Journal on Computing
#index1275366
#% 
#!
  
#*Shortening Future-Event Lists.
#@Bennett L. Fox
#t1993
#cINFORMS Journal on Computing
#index1275367
#% 
#!
  
#*ALPO: Another Linear Program Optimizer.
#@Robert J. Vanderbei
#t1993
#cINFORMS Journal on Computing
#index1275368
#% 
#!
  
#*State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming.
#@Pierre Hansen,Brigitte Jaumard,Vincent Mathon
#t1993
#cINFORMS Journal on Computing
#index1275369
#% 
#!
  
#*From the Editor.
#@Bruce L. Golden
#t1993
#cINFORMS Journal on Computing
#index1275370
#% 
#!
  
#*A GRG2-Based System for Training Neural Networks: Design and Computational Experience.
#@Venkat Subramanian,Ming S. Hung
#t1993
#cINFORMS Journal on Computing
#index1275371
#% 
#!
  
#*A Production Scheduling System.
#@Miguel Nussbaum,Eduardo A. Parra
#t1993
#cINFORMS Journal on Computing
#index1275372
#% 
#!
  
#*A Barrier Method for Large-Scale Constrained Optimization.
#@Stephen G. Nash,Ariela Sofer
#t1993
#cINFORMS Journal on Computing
#index1275373
#% 
#!
  
#*Graphical Interfaces for Network Modeling: A Model Management System Perspective.
#@David M. Steiger,Ramesh Sharda,Brian Leclaire
#t1993
#cINFORMS Journal on Computing
#index1275374
#% 
#!
  
#*Parallel Asynchronous Hungarian Methods for the Assignment Problem.
#@Dimitri P. Bertsekas,David A. Castañon
#t1993
#cINFORMS Journal on Computing
#index1275375
#% 
#!
  
#*Commentary - The "Tar Baby" of Computing: Performance Analysis.
#@John L. Gustafson
#t1993
#cINFORMS Journal on Computing
#index1275376
#% 
#!
  
#*Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry.
#@Karl Heinz Borgwardt,Renate Damm,Rudolf Donig,Gabriele Joas
#t1993
#cINFORMS Journal on Computing
#index1275377
#% 
#!
  
#*Learning Algorithms for Neural-Net Decision Support.
#@Selwyn Piramuthu,Chung-Ming Kuan,Michael J. Shaw
#t1993
#cINFORMS Journal on Computing
#index1275378
#% 
#!
  
#*Dimensional Analysis in Mathematical Modeling Systems: A Simple Numerical Method.
#@Hemant K. Bhargava
#t1993
#cINFORMS Journal on Computing
#index1275379
#% 
#!
  
#*Commentary - Parallel Reporting Guidelines Are on Target.
#@David Loshin,Alex Vasilevsky
#t1993
#cINFORMS Journal on Computing
#index1275380
#% 
#!
  
#*Rejoinder - Future Directions in Parallel Simulation Research.
#@Richard M. Fujimoto
#t1993
#cINFORMS Journal on Computing
#index1275381
#% 
#!
  
#*Network Reoptimization Algorithms: A Statistically Designed Comparison.
#@Mohammad M. Amini,Richard S. Barr
#t1993
#cINFORMS Journal on Computing
#index1275382
#% 
#!
  
#*Applying an Architecture for General Intelligence to Reduce Scheduling Effort.
#@Michael J. Prietula,Wen Ling Hsu,David M. Steier,Allen Newell
#t1993
#cINFORMS Journal on Computing
#index1275383
#% 
#!
  
#*Feature Article - Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions.
#@Richard S. Barr,Betty L. Hickman
#t1993
#cINFORMS Journal on Computing
#index1275384
#% 
#!
  
#*The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2.
#@Jonathan Eckstein
#t1993
#cINFORMS Journal on Computing
#index1275385
#% 
#!
  
#*Approximation Algorithms for Three-Machine Open Shop Scheduling.
#@Bo Chen,Vitaly A. Strusevich
#t1993
#cINFORMS Journal on Computing
#index1275386
#% 
#!
  
#*Commentary - Will Parallel Simulation Research Survive?
#@Yi-Bing Lin
#t1993
#cINFORMS Journal on Computing
#index1275387
#% 
#!
  
#*An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming.
#@William Cook,Thomas Rutherford,Herbert E. Scarf,David Shallcross
#t1993
#cINFORMS Journal on Computing
#index1275388
#% 
#!
  
#*Commentary - Parallel Discrete Event Simulation: Fact or Fiction?
#@Marc Abrams
#t1993
#cINFORMS Journal on Computing
#index1275389
#% 
#!
  
#*Duality-Based Algorithms for Scheduling Unrelated Parallel Machines.
#@Steef L. van de Velde
#t1993
#cINFORMS Journal on Computing
#index1275390
#% 
#!
  
#*Commentary - Practical Parallel Discrete Event Simulation.
#@Brian Unger,John G. Cleary
#t1993
#cINFORMS Journal on Computing
#index1275391
#% 
#!
  
#*Commentary - The Role of Performance Metrics for Parallel Mathematical Programming Algorithms.
#@Donald L. Miller,Joseph F. Pekny
#t1993
#cINFORMS Journal on Computing
#index1275392
#% 
#!
  
#*Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure.
#@Tamra J. Carpenter,Irvin J. Lustig,John M. Mulvey,David F. Shanno
#t1993
#cINFORMS Journal on Computing
#index1275393
#% 
#!
  
#*Commentary - The Silver Bullet.
#@Paul F. Reynolds Jr.
#t1993
#cINFORMS Journal on Computing
#index1275394
#% 
#!
  
#*Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows.
#@Winfried K. Grassmann,Daniel P. Heyman
#t1993
#cINFORMS Journal on Computing
#index1275395
#% 
#!
  
#*Optimal Balanced Assignments and a Parallel Database Application.
#@Shahram Ghandeharizadeh,Robert R. Meyer,Gary L. Schultz,Jonathan Yackel
#t1993
#cINFORMS Journal on Computing
#index1275396
#% 
#!
  
#*Mathematical Programming in Neural Networks.
#@O. L. Mangasarian
#t1993
#cINFORMS Journal on Computing
#index1275397
#% 
#!
  
#*Commentary - A Survival Guide for Parallel Simulation.
#@Rajive Bagrodia
#t1993
#cINFORMS Journal on Computing
#index1275398
#% 
#!
  
#*Commentary - Speedups and Insights.
#@Ewing L. Lusk
#t1993
#cINFORMS Journal on Computing
#index1275399
#% 
#!
  
#*Rejoinder - Using Parallel Empirical Testing to Advance Algorithm Research.
#@Richard S. Barr,Betty L. Hickman
#t1993
#cINFORMS Journal on Computing
#index1275400
#% 
#!
  
#*State-of-the-Art Survey - The Traveling Salesman Problem: A Neural Network Perspective.
#@Jean-Yves Potvin
#t1993
#cINFORMS Journal on Computing
#index1275401
#% 
#!
  
#*From the Editor.
#@Bruce L. Golden
#t1993
#cINFORMS Journal on Computing
#index1275402
#% 
#!
  
#*An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.
#@Matteo Fischetti,Paolo Toth
#t1993
#cINFORMS Journal on Computing
#index1275403
#% 
#!
  
#*Selecting Parameters of Phase Distributions: Combining Nonlinear Programming, Heuristics, and Erlang Distributions.
#@Mary A. Johnson
#t1993
#cINFORMS Journal on Computing
#index1275404
#% 
#!
  
#*Feedforward Neural Nets as Models for Time Series Forecasting.
#@Zaiyong Tang,Paul A. Fishwick
#t1993
#cINFORMS Journal on Computing
#index1275405
#% 
#!
  
#*Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations.
#@Giorgio Gallo,Maria Grazia Scutellà
#t1993
#cINFORMS Journal on Computing
#index1275406
#% 
#!
  
#*Measuring Congestion for Dynamic Task Allocation in Distributed Simulation.
#@Murali S. Shanker,W. David Kelton,Rema Padman
#t1993
#cINFORMS Journal on Computing
#index1275407
#% 
#!
  
#*Alternative Approaches to Feasibility in Projective Methods for Linear Programming.
#@Chris Fraley,Jean-Philippe Vial
#t1992
#cINFORMS Journal on Computing
#index1275408
#% 
#!
  
#*Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms.
#@Esther M. Arkin,Klara Kedem,Joseph S. B. Mitchell,Josef Sprinzak,Michael Werman
#t1992
#cINFORMS Journal on Computing
#index1275409
#% 
#!
  
#*Using a Hop-Constrained Model to Generate Alternative Communication Network Design.
#@Anantaram Balakrishnan,Kemal Altinkemer
#t1992
#cINFORMS Journal on Computing
#index1275410
#% 
#!
  
#*Monotone Pieces of Chains.
#@V. Chandru,V. T. Rajan,R. Swaminathan
#t1992
#cINFORMS Journal on Computing
#index1275411
#% 
#!
  
#*Solving the Steiner Tree Problem on a Graph Using Branch and Cut.
#@Sunil Chopra,Edgar R. Gorres,M. R. Rao
#t1992
#cINFORMS Journal on Computing
#index1275412
#% 
#!
  
#*Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem.
#@Weldon A. Lodwick
#t1992
#cINFORMS Journal on Computing
#index1275413
#% 
#!
  
#*A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks.
#@Frank Yeong-Sung Lin,James R. Yee
#t1992
#cINFORMS Journal on Computing
#index1275414
#% 
#!
  
#*Simulated Annealing with a Temperature Dependent Penalty Function.
#@Julio M. Stern
#t1992
#cINFORMS Journal on Computing
#index1275415
#% 
#!
  
#*Scheduling Checks and Saves.
#@Leonid B. Boguslavsky,Edward G. Coffman Jr.,Edgar N. Gilbert,Alexander Y. Kreinin
#t1992
#cINFORMS Journal on Computing
#index1275416
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1992
#cINFORMS Journal on Computing
#index1275417
#% 
#!
  
#*Book Review.
#@Rakesh V. Vohra
#t1992
#cINFORMS Journal on Computing
#index1275418
#% 
#!
  
#*Jackknifing under a Budget Constraint.
#@Peter W. Glynn,Philip Heidelberger
#t1992
#cINFORMS Journal on Computing
#index1275419
#% 
#!
  
#*An Optimal Algorithm for the Orienteering Tour Problem.
#@R. Ramesh,Yong-Seok Yoon,Mark H. Karwan
#t1992
#cINFORMS Journal on Computing
#index1275420
#% 
#!
  
#*Fast Algorithms for Geometric Traveling Salesman Problems.
#@Jon Jouis Bentley
#t1992
#cINFORMS Journal on Computing
#index1275421
#% 
#!
  
#*The Vehicle Routing Problem with Time Windows: Minimizing Route Duration.
#@Martin W. P. Savelsbergh
#t1992
#cINFORMS Journal on Computing
#index1275422
#% 
#!
  
#*Massively Parallel Algorithms for Singly Constrained Convex Programs.
#@Søren S. Nielsen,Stavros A. Zenios
#t1992
#cINFORMS Journal on Computing
#index1275423
#% 
#!
  
#*Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm.
#@Mustafa Ç. Pinar,Stavros A. Zenios
#t1992
#cINFORMS Journal on Computing
#index1275424
#% 
#!
  
#*A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem.
#@Parviz Ghandforoush,John J. Daniels
#t1992
#cINFORMS Journal on Computing
#index1275425
#% 
#!
  
#*The Ca/M/s/m Retrial Queue: A Computational Approach.
#@Tao Yang,Morton J. M. Posner,James G. C. Templeton
#t1992
#cINFORMS Journal on Computing
#index1275426
#% 
#!
  
#*Preprocessing in Stochastic Programming: The Case of Linear Programs.
#@Stein W. Wallace,Roger J.-B. Wets
#t1992
#cINFORMS Journal on Computing
#index1275427
#% 
#!
  
#*Technical Note - On Performance of Path Planning Algorithms in Unknown Terrains.
#@Nageswara S. V. Rao
#t1992
#cINFORMS Journal on Computing
#index1275428
#% 
#!
  
#*Fast Heuristics for Large Geometric Traveling Salesman Problems.
#@Gerhard Reinelt
#t1992
#cINFORMS Journal on Computing
#index1275429
#% 
#!
  
#*Implementing the Simplex Method: The Initial Basis.
#@Robert E. Bixby
#t1992
#cINFORMS Journal on Computing
#index1275430
#% 
#!
  
#*Numerical Experiments with Iteration and Aggregation for Markov Chains.
#@William J. Stewart,Wei Wu
#t1992
#cINFORMS Journal on Computing
#index1275431
#% 
#!
  
#*Efficient Algorithms for the Capacitated 1-Median Problem.
#@Hossam ElGindy,J. Mark Keil
#t1992
#cINFORMS Journal on Computing
#index1275432
#% 
#!
  
#*1-Segment Center Problems.
#@Hiroshi Imai,D. T. Lee,Chung-Do Yang
#t1992
#cINFORMS Journal on Computing
#index1275433
#% 
#!
  
#*From the Editor.
#@Bruce L. Golden
#t1992
#cINFORMS Journal on Computing
#index1275434
#% 
#!
  
#*Exploiting Special Structure in Primal Dual Interior Point Methods.
#@James K. Hurd,Frederic H. Murphy
#t1992
#cINFORMS Journal on Computing
#index1275435
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1992
#cINFORMS Journal on Computing
#index1275436
#% 
#!
  
#*On the Optimal Bisection of a Polygon.
#@Elias Koutsoupias,Christos H. Papadimitriou,Martha Sideri
#t1992
#cINFORMS Journal on Computing
#index1275437
#% 
#!
  
#*Recognizing Voronoi Diagrams with Linear Programming.
#@David Hartvigsen
#t1992
#cINFORMS Journal on Computing
#index1275438
#% 
#!
  
#*"Lion and Man": Upper and Lower Bounds.
#@Laurent Alonso,Arthur S. Goldstein,Edward M. Reingold
#t1992
#cINFORMS Journal on Computing
#index1275439
#% 
#!
  
#*Solving Large Sparse Nonlinear Programs Using GRG.
#@Stuart Smith,Leon S. Lasdon
#t1992
#cINFORMS Journal on Computing
#index1275440
#% 
#!
  
#*The Voronoi Partition of a Network and Its Implications in Location Theory.
#@S. Louis Hakimi,Martine Labbé,Edward F. Schmeichel
#t1992
#cINFORMS Journal on Computing
#index1275441
#% 
#!
  
#*Matroid Applications and Algorithms.
#@Jon Lee,Jennifer Ryan
#t1992
#cINFORMS Journal on Computing
#index1275442
#% 
#!
  
#*Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1.
#@Mohan L. Chaudhry
#t1992
#cINFORMS Journal on Computing
#index1275443
#% 
#!
  
#*Dynamic Three-Dimensional Linear Programming.
#@David Eppstein
#t1992
#cINFORMS Journal on Computing
#index1275444
#% 
#!
  
#*Generalized Networks: Parallel Algorithms and an Empirical Analysis.
#@Robert H. Clark,Jeffery L. Kennington,Robert R. Meyer,Muthukrishnan Ramamurti
#t1992
#cINFORMS Journal on Computing
#index1275445
#% 
#!
  
#*Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods.
#@Sanjay Mehrotra
#t1992
#cINFORMS Journal on Computing
#index1275446
#% 
#!
  
#*Solving Piecewise-Linear Programs: Experiments with a Simplex Approach.
#@Robert Fourer,Roy E. Marsten
#t1992
#cINFORMS Journal on Computing
#index1275447
#% 
#!
  
#*Some Convergence Results for Probabilistic Tabu Search.
#@Ulrich Faigle,Walter Kern
#t1992
#cINFORMS Journal on Computing
#index1275448
#% 
#!
  
#*Guest Editors' Introduction.
#@Joseph S. B. Mitchell,Jan Karel Lenstra
#t1992
#cINFORMS Journal on Computing
#index1275449
#% 
#!
  
#*Column Generation Methods for Probabilistic Logic.
#@Brigitte Jaumard,Pierre Hansen,Marcus Poggi de Aragão
#t1991
#cINFORMS Journal on Computing
#index1275450
#% 
#!
  
#*TSPLIB - A Traveling Salesman Problem Library.
#@Gerhard Reinelt
#t1991
#cINFORMS Journal on Computing
#index1275451
#% 
#!
  
#*Book Reviews.
#@Harvey J. Greenberg,John W. Chinneck,Gerald M. Karam
#t1991
#cINFORMS Journal on Computing
#index1275452
#% 
#!
  
#*An Introduction to Graph-Based Modeling Systems, Part II: Graph-Grammars and the Implementation.
#@Christopher V. Jones
#t1991
#cINFORMS Journal on Computing
#index1275453
#% 
#!
  
#*Generating Markov-Chain Transitions Quickly: II.
#@Bennett L. Fox,Andrew R. Young
#t1991
#cINFORMS Journal on Computing
#index1275454
#% 
#!
  
#*Book Review.
#@Jennifer Ryan
#t1991
#cINFORMS Journal on Computing
#index1275455
#% 
#!
  
#*SQLMP: A Data Sublanguage for Representation and Formulation of Linear Mathematical Models.
#@Joobin Choobineh
#t1991
#cINFORMS Journal on Computing
#index1275456
#% 
#!
  
#*A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem.
#@Zbigniew Michalewicz,George A. Vignaux,Matthew Hobbs
#t1991
#cINFORMS Journal on Computing
#index1275457
#% 
#!
  
#*An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations.
#@Jeffery L. Kennington,Zhiming Wang
#t1991
#cINFORMS Journal on Computing
#index1275458
#% 
#!
  
#*Linear Discriminant Functions Determined by Genetic Search.
#@Gary J. Koehler
#t1991
#cINFORMS Journal on Computing
#index1275459
#% 
#!
  
#*TES: A Class of Methods for Generating Autocorrelated Uniform Variates.
#@Benjamin Melamed
#t1991
#cINFORMS Journal on Computing
#index1275460
#% 
#!
  
#*Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem.
#@J. Ben Rosen,Guoliang Xue
#t1991
#cINFORMS Journal on Computing
#index1275461
#% 
#!
  
#*A Product Automaton Formalism for Hierarchical, Modular, Discrete Simulation.
#@Frederick J. Portier,Robert E. Haymond
#t1991
#cINFORMS Journal on Computing
#index1275462
#% 
#!
  
#*Parallel Implementation of Lemke's Algorithm on the Hypercube.
#@Renato De Leone,Terence T.-H. Ow
#t1991
#cINFORMS Journal on Computing
#index1275463
#% 
#!
  
#*On Finding Primal- and Dual-Optimal Bases.
#@Nimrod Megiddo
#t1991
#cINFORMS Journal on Computing
#index1275464
#% 
#!
  
#*A Pruning Procedure for Exact Graph Coloring.
#@Thomas J. Sager,Shi-Jen Lin
#t1991
#cINFORMS Journal on Computing
#index1275465
#% 
#!
  
#*A Mass Production Technique to Speed Multiple-Query Optimization and Physical Database Design.
#@Paul Helman,Arnon Rosenthal
#t1991
#cINFORMS Journal on Computing
#index1275466
#% 
#!
  
#*SOFTWARE SECTION - RANDMOD: A System for Randomizing Modifications to an Instance of a Linear Program.
#@Harvey J. Greenberg
#t1991
#cINFORMS Journal on Computing
#index1275467
#% 
#!
  
#*Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8.
#@David N. Kempka,Jeffery L. Kennington,Hossam A. Zaki
#t1991
#cINFORMS Journal on Computing
#index1275468
#% 
#!
  
#*Unique Names Violations, a Problem for Model Integration or You Say Tomato, I Say Tomahto.
#@Hemant K. Bhargava,Steven O. Kimbrough,Ramayya Krishnan
#t1991
#cINFORMS Journal on Computing
#index1275469
#% 
#!
  
#*Using State Reduction for Computing Steady State Probabilities of Queues of GI/PH/1 Types.
#@Edward P. C. Kao
#t1991
#cINFORMS Journal on Computing
#index1275470
#% 
#!
  
#*Pattern Classification Using Linear Programming.
#@Asim Roy,Somnath Mukhopadhyay
#t1991
#cINFORMS Journal on Computing
#index1275471
#% 
#!
  
#*Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing.
#@Peter C. Fetterolf,G. Anandalingam
#t1991
#cINFORMS Journal on Computing
#index1275472
#% 
#!
  
#*Book Review.
#@Weldon A. Lodwick
#t1991
#cINFORMS Journal on Computing
#index1275473
#% 
#!
  
#*Discrete Event Simulation Model Decomposition by Principal Components Analysis.
#@Kenneth W. Bauer Jr.,Bipin Kochar,Joseph Talavage
#t1991
#cINFORMS Journal on Computing
#index1275474
#% 
#!
  
#*Technical Note - On the Cancellation Sequence Method of Tabu Search.
#@Frank Dammeyer,Peter Forst,Stefan Voß
#t1991
#cINFORMS Journal on Computing
#index1275475
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1991
#cINFORMS Journal on Computing
#index1275476
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1991
#cINFORMS Journal on Computing
#index1275477
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1991
#cINFORMS Journal on Computing
#index1275478
#% 
#!
  
#*Rule-Based Generation of Model Structures in Multifaceted Modeling and System Design.
#@Jerzy W. Rozenblit,Yueh-Min Huang
#t1991
#cINFORMS Journal on Computing
#index1275479
#% 
#!
  
#*Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut.
#@Karla L. Hoffman,Manfred Padberg
#t1991
#cINFORMS Journal on Computing
#index1275480
#% 
#!
  
#*Bounding Synchronization Overhead for Parallel Iteration.
#@Peter J. Downey
#t1991
#cINFORMS Journal on Computing
#index1275481
#% 
#!
  
#*Approximation of Some Markov-Modulated Poisson Processes.
#@H. Sitaraman
#t1991
#cINFORMS Journal on Computing
#index1275482
#% 
#!
  
#*Locating Minimal Infeasible Constraint Sets in Linear Programs.
#@John W. Chinneck,Erik W. Dravnieks
#t1991
#cINFORMS Journal on Computing
#index1275483
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1991
#cINFORMS Journal on Computing
#index1275484
#% 
#!
  
#*Optimal Partial-Match Hashing Design.
#@Raj Jagannathan
#t1991
#cINFORMS Journal on Computing
#index1275485
#% 
#!
  
#*Technical Note - Least-Squares Image Registration.
#@Karel Zikan
#t1991
#cINFORMS Journal on Computing
#index1275486
#% 
#!
  
#*A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks.
#@Lawrence J. Osborne,Billy E. Gillett
#t1991
#cINFORMS Journal on Computing
#index1275487
#% 
#!
  
#*A Computational Study of the Job-Shop Scheduling Problem.
#@David Applegate,William J. Cook
#t1991
#cINFORMS Journal on Computing
#index1275488
#% 
#!
  
#*Incremental Linear Constraint Solving and Detection of Implicit Equalities.
#@Peter J. Stuckey
#t1991
#cINFORMS Journal on Computing
#index1275489
#% 
#!
  
#*Approaches to Diagnosing Infeasible Linear Programs.
#@Harvey J. Greenberg,Frederic H. Murphy
#t1991
#cINFORMS Journal on Computing
#index1275490
#% 
#!
  
#*Minimizing Total Tardiness on a Single Machine with Precedence Constraints.
#@Joseph Y.-T. Leung,Gilbert H. Young
#t1990
#cINFORMS Journal on Computing
#index1275491
#% 
#!
  
#*The Influence of Computer Language on Computational Comparisons: An Example from Network Optimization.
#@Irvin J. Lustig
#t1990
#cINFORMS Journal on Computing
#index1275492
#% 
#!
  
#*Neural Networks for Selective Vehicle Routing Heuristics.
#@Kendall E. Nygard,Paul Juell,Nagesh Kadaba
#t1990
#cINFORMS Journal on Computing
#index1275493
#% 
#!
  
#*Model Libraries: Knowledge Representation and Reasoning.
#@Michael V. Mannino,Betsy S. Greenberg,Sa Neung Hong
#t1990
#cINFORMS Journal on Computing
#index1275494
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1990
#cINFORMS Journal on Computing
#index1275495
#% 
#!
  
#*Path Planning in 0/1/ Weighted Regions with Applications.
#@Laxmi Gewali,Alex C. Meng,Joseph S. B. Mitchell,Simeon C. Ntafos
#t1990
#cINFORMS Journal on Computing
#index1275496
#% 
#!
  
#*Matrix Balancing on a Massively Parallel Connection Machine.
#@Stavros A. Zenios
#t1990
#cINFORMS Journal on Computing
#index1275497
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1990
#cINFORMS Journal on Computing
#index1275498
#% 
#!
  
#*Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue.
#@Edward P. C. Kao,Kumar S. Narayanan
#t1990
#cINFORMS Journal on Computing
#index1275499
#% 
#!
  
#*Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems.
#@David M. Nicol
#t1990
#cINFORMS Journal on Computing
#index1275500
#% 
#!
  
#*Further Development of a Primal-Dual Interior Point Method.
#@In Chan Choi,Clyde L. Monma,David F. Shanno
#t1990
#cINFORMS Journal on Computing
#index1275501
#% 
#!
  
#*A Decomposition Strategy for Global Optimum Search in the Pooling Problem.
#@Christodoulos A. Floudas,Avanish Aggarwal
#t1990
#cINFORMS Journal on Computing
#index1275502
#% 
#!
  
#*Robustness of Rootfinding in Single-Server Queueing Models.
#@Mohan L. Chaudhry,Carl M. Harris,William G. Marchal
#t1990
#cINFORMS Journal on Computing
#index1275503
#% 
#!
  
#*An Introduction to Graph-Based Modeling Systems, Part I: Overview.
#@Christopher V. Jones
#t1990
#cINFORMS Journal on Computing
#index1275504
#% 
#!
  
#*Book Review.
#@Richard H. Jones
#t1990
#cINFORMS Journal on Computing
#index1275505
#% 
#!
  
#*A Neural Network Implementation of a Data Association Algorithm.
#@Allen L. Barker,Donald E. Brown,Worthy N. Martin
#t1990
#cINFORMS Journal on Computing
#index1275506
#% 
#!
  
#*Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems.
#@Chung-Lun Li,David Simchi-Levi
#t1990
#cINFORMS Journal on Computing
#index1275507
#% 
#!
  
#*Book Reviews.
#@Matthew J. Saltzman,Kevin S. McCurley
#t1990
#cINFORMS Journal on Computing
#index1275508
#% 
#!
  
#*Backbone Network Design Tools with Economic Tradeoffs.
#@Bezalel Gavish,Kemal Altinkemer
#t1990
#cINFORMS Journal on Computing
#index1275509
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1990
#cINFORMS Journal on Computing
#index1275510
#% 
#!
  
#*Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases.
#@Uwe H. Suhl,Leena Suhl
#t1990
#cINFORMS Journal on Computing
#index1275511
#% 
#!
  
#*An Algorithm for Network Reliability Bounds.
#@Che-Liang Yang,Peter Kubat
#t1990
#cINFORMS Journal on Computing
#index1275512
#% 
#!
  
#*Reliability Computations for Planar Networks.
#@David E. Whited,Douglas R. Shier,James P. Jarvis
#t1990
#cINFORMS Journal on Computing
#index1275513
#% 
#!
  
#*Generating Markov-Chain Transitions Quickly: I.
#@Bennett L. Fox
#t1990
#cINFORMS Journal on Computing
#index1275514
#% 
#!
  
#*Knowledge Modularization for Adaptive Decision Modeling.
#@Amiya K. Chakravarty,Diptendu Sinha
#t1990
#cINFORMS Journal on Computing
#index1275515
#% 
#!
  
#*Matrix Visualization in the Design of Numerical Algorithms.
#@Allan Tuchman,Michael W. Berry
#t1990
#cINFORMS Journal on Computing
#index1275516
#% 
#!
  
#*Optimal Preemptive Scheduling of Two Unrelated Processors.
#@Teofilo F. Gonzalez,Eugene L. Lawler,Sartaj Sahni
#t1990
#cINFORMS Journal on Computing
#index1275517
#% 
#!
  
#*Tabu Search - Part II.
#@Fred Glover
#t1990
#cINFORMS Journal on Computing
#index1275518
#% 
#!
  
#*Identifying Minimally Infeasible Subsystems of Inequalities.
#@John Gleeson,Jennifer Ryan
#t1990
#cINFORMS Journal on Computing
#index1275519
#% 
#!
  
#*Tabu Search Applied to the Quadratic Assignment Problem.
#@Jadranka Skorin-Kapov
#t1990
#cINFORMS Journal on Computing
#index1275520
#% 
#!
  
#*On Valuation and Optimization Problems in Fuzzy Graphs: A General Approach and Some Particular Cases.
#@Miguel Delgado,José L. Verdegay,Maria-Amparo Vila
#t1990
#cINFORMS Journal on Computing
#index1275521
#% 
#!
  
#*Using Simulated Annealing to Solve Controlled Rounding Problems.
#@James Kelly,Bruce L. Golden,Arjang A. Assad
#t1990
#cINFORMS Journal on Computing
#index1275522
#% 
#!
  
#*Manipulation and Visualization of Sparse Matrices.
#@Fernando L. Alvarado
#t1990
#cINFORMS Journal on Computing
#index1275523
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1990
#cINFORMS Journal on Computing
#index1275524
#% 
#!
  
#*Computational Testing: Why, How and How Much.
#@Harvey J. Greenberg
#t1990
#cINFORMS Journal on Computing
#index1275525
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1989
#cINFORMS Journal on Computing
#index1275526
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1989
#cINFORMS Journal on Computing
#index1275527
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1989
#cINFORMS Journal on Computing
#index1275528
#% 
#!
  
#*A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem.
#@Eitan Wacholder
#t1989
#cINFORMS Journal on Computing
#index1275529
#% 
#!
  
#*Implementation of a Dual Affine Interior Point Algorithm for Linear Programming.
#@Roy E. Marsten,Matthew J. Saltzman,David F. Shanno,George S. Pierce,J. F. Ballintijn
#t1989
#cINFORMS Journal on Computing
#index1275530
#% 
#!
  
#*Algorithmic Enhancements to the Method of Centers for Linear Programming Problems.
#@Paul T. Boggs,Paul D. Domich,Janet R. Donaldson,Christoph Witzgall
#t1989
#cINFORMS Journal on Computing
#index1275531
#% 
#!
  
#*Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base.
#@Robert G. Jeroslow,Jinchang Wang
#t1989
#cINFORMS Journal on Computing
#index1275532
#% 
#!
  
#*Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks.
#@Larry J. LeBlanc,Ronald V. Simmons
#t1989
#cINFORMS Journal on Computing
#index1275533
#% 
#!
  
#*Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks.
#@Stein W. Wallace,Roger J.-B. Wets
#t1989
#cINFORMS Journal on Computing
#index1275534
#% 
#!
  
#*Approximation Algorithms for the Maximum Concurrent Flow Problem.
#@Farhad Shahrokhi
#t1989
#cINFORMS Journal on Computing
#index1275535
#% 
#!
  
#*Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
#@Ilan Adler,Narendra Karmarkar,Mauricio G. C. Resende,Geraldo Veiga
#t1989
#cINFORMS Journal on Computing
#index1275536
#% 
#!
  
#*Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The ZOOM System.
#@Jaya Singhal,Roy E. Marsten,Thomas L. Morin
#t1989
#cINFORMS Journal on Computing
#index1275537
#% 
#!
  
#*Numerical Solution of Linear Equations Arising in Markov Chain Models.
#@Daniel P. Heyman,Alyson Reeves
#t1989
#cINFORMS Journal on Computing
#index1275538
#% 
#!
  
#*Parallel Numerical Optimization: Current Status and an Annotated Bibliography.
#@Stavros A. Zenios
#t1989
#cINFORMS Journal on Computing
#index1275539
#% 
#!
  
#*Possibilistic Linear Programming with Measurable Multiattribute Value Functions.
#@Masahiro Inuiguchi,Hidetomo Ichihashi,Hideo Tanaka
#t1989
#cINFORMS Journal on Computing
#index1275540
#% 
#!
  
#*A New Estimator of Sensitivity Measures for Simulations Based on Light Traffic Theory.
#@Burton Simon
#t1989
#cINFORMS Journal on Computing
#index1275541
#% 
#!
  
#*Tabu Search - Part I.
#@Fred Glover
#t1989
#cINFORMS Journal on Computing
#index1275542
#% 
#!
  
#*Modeling Networks with Dynamic Topologies.
#@Robert L. Moose Jr.
#t1989
#cINFORMS Journal on Computing
#index1275543
#% 
#!
  
#*Series-Parallel Bounds for the Two-Terminal Reliability Problem.
#@Hosam M. Aboelfotoh,Charles J. Colbourn
#t1989
#cINFORMS Journal on Computing
#index1275544
#% 
#!
  
#*A Formal Development of Event Graphs as an Aid to Structured and Efficient Simulation Programs.
#@Tapas K. Som,Robert G. Sargent
#t1989
#cINFORMS Journal on Computing
#index1275545
#% 
#!
  
#*Editor's Introduction.
#@Harvey J. Greenberg
#t1989
#cINFORMS Journal on Computing
#index1275546
#% 
#!
  
#*Analysis of Stiff Markov Chains.
#@Andrew L. Reibman,Kishor S. Trivedi,Sanjaya Kumar,Gianfranco Ciardo
#t1989
#cINFORMS Journal on Computing
#index1275547
#% 
#!
  
#*On the Greedy Solution of Ordering Problems.
#@Avi Dechter,Rina Dechter
#t1989
#cINFORMS Journal on Computing
#index1275548
#% 
#!
  
#*Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming.
#@Andrew T. Phillips,J. Ben Rosen
#t1989
#cINFORMS Journal on Computing
#index1275549
#% 
#!
  
#*Input Proofs and Rank One Cutting Planes.
#@John N. Hooker
#t1989
#cINFORMS Journal on Computing
#index1275550
#% 
#!
  
#*An Implementation of a Primal-Dual Interior Point Method for Linear Programming.
#@Kevin A. McShane,Clyde L. Monma,David F. Shanno
#t1989
#cINFORMS Journal on Computing
#index1275551
#% 
#!
  
#*Appreciation to Referees.
#@John W. Chinneck
#t2009
#cINFORMS Journal on Computing
#index1338045
#% 
#!
  
#*Transforming Renewal Processes for Simulation of Nonstationary Arrival Processes.
#@Ira Gerhardt,Barry L. Nelson
#t2009
#cINFORMS Journal on Computing
#index1338047
#% 
#!
  
#*On the Integrated Production and Distribution Problem with Bidirectional Flows.
#@Lei Lei,Hua Zhong,Wanpracha Art Chaovalitwongse
#t2009
#cINFORMS Journal on Computing
#index1338050
#% 
#!
  
#*The Knowledge-Gradient Policy for Correlated Normal Beliefs.
#@Peter Frazier,Warren B. Powell,Savas Dayanik
#t2009
#cINFORMS Journal on Computing
#index1338049
#% 
#!
  
#*Numerically Safe Gomory Mixed-Integer Cuts.
#@William Cook,Sanjeeb Dash,Ricardo Fukasawa,Marcos Goycoolea
#t2009
#cINFORMS Journal on Computing
#index1338046
#% 
#!
  
#*From the Editor.
#@John W. Chinneck
#t2009
#cINFORMS Journal on Computing
#index1338048
#% 
#!
  
#*From the Editor.
#@John W. Chinneck
#t2010
#cINFORMS Journal on Computing
#index1338064
#% 
#!
  
#*Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition.
#@Barry McCollum,Andrea Schaerf,Ben Paechter,Paul McMullan,Rhydian Lewis,Andrew J. Parkes,Luca Di Gaspero,Rong Qu,Edmund K. Burke
#t2010
#cINFORMS Journal on Computing
#index1338056
#%521903
#%530445
#%530447
#%748623
#%1054423
#%1280473
#!
  
#*An Inexact Bundle Approach to Cutting-Stock Problems.
#@Krzysztof C. Kiwiel
#t2010
#cINFORMS Journal on Computing
#index1338059
#%924156
#%924113
#%1014399
#%1275095
#%1275160
#%1340607
#%2892380
#%2892002
#%2891928
#!
  
#*An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy.
#@Andreas T. Ernst,Vicky H. Mak,Luke R. Mason
#t2009
#cINFORMS Journal on Computing
#index1338055
#% 
#!
  
#*An Algorithm for Fast Generation of Bivariate Poisson Random Vectors.
#@Kaeyoung Shin,Raghu Pasupathy
#t2010
#cINFORMS Journal on Computing
#index1338063
#%671988
#%924129
#%1120638
#%1156058
#%1275041
#%1275232
#!
  
#*Exact Algorithms for the Quadratic Linear Ordering Problem.
#@Christoph Buchheim,Angelika Wiegele,Lanbo Zheng
#t2010
#cINFORMS Journal on Computing
#index1338068
#%851350
#%1014463
#%3006096
#!
  
#*Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities.
#@Richard J. Caron,Tim Traynor,Shafiu Jibrin
#t2010
#cINFORMS Journal on Computing
#index1338058
#%924139
#%1013363
#!
  
#*Commentary - Perspectives on Stochastic Optimization Over Time.
#@John N. Tsitsiklis
#t2010
#cINFORMS Journal on Computing
#index1338065
#%776434
#%1009226
#%1290013
#%1338067
#!
  
#*Rejoinder - The Languages of Stochastic Optimization.
#@Warren B. Powell
#t2010
#cINFORMS Journal on Computing
#index1338057
#%671008
#%924057
#%1338065
#%1338067
#!
  
#*Nonconvex Robust Optimization for Problems with Constraints.
#@Dimitris Bertsimas,Omid Nohadani,Kwong Meng Teo
#t2010
#cINFORMS Journal on Computing
#index1338066
#%1013364
#%1013928
#%1121441
#%1346551
#!
  
#*State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing.
#@Jean-Yves Potvin
#t2009
#cINFORMS Journal on Computing
#index1338052
#% 
#!
  
#*Sequential Sampling to Myopically Maximize the Expected Value of Information.
#@Stephen E. Chick,Jürgen Branke,Christian Schmidt
#t2010
#cINFORMS Journal on Computing
#index1338060
#%668780
#%671745
#%1289883
#%1348023
#%2884277
#%2889718
#!
  
#*Binarized Support Vector Machines.
#@Emilio Carrizosa,Belen Martin-Barragan,Dolores Romero Morales
#t2010
#cINFORMS Journal on Computing
#index1338071
#%334563
#%389261
#%472462
#%472635
#%517090
#%838790
#%1009397
#%1009507
#%1009356
#%1045472
#%2884748
#%3458594
#!
  
#*A Constraint Programming Approach for Solving a Queueing Design and Control Problem.
#@Daria Terekhov,J. Christopher Beck,Kenneth N. Brown
#t2009
#cINFORMS Journal on Computing
#index1338051
#% 
#!
  
#*An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem.
#@Piyush Kumar,E. Alper Yildirim
#t2009
#cINFORMS Journal on Computing
#index1338054
#% 
#!
  
#*Commentary - Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming.
#@Andrzej Ruszczynski
#t2010
#cINFORMS Journal on Computing
#index1338072
#%1338067
#!
  
#*A Heuristic for Nonlinear Global Optimization.
#@Michel Bierlaire,M. Thémans,Nicolas Zufferey
#t2010
#cINFORMS Journal on Computing
#index1338069
#%28124
#%812882
#%813608
#%836942
#%838911
#%885427
#%1013548
#%1090624
#%1121441
#%1121678
#%2892297
#%3363287
#!
  
#*Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment.
#@Robert Fourer,Chandrakant Maheshwari,Arnold Neumaier,Dominique Orban,Hermann Schichl
#t2010
#cINFORMS Journal on Computing
#index1338062
#%1121375
#%1121373
#%2871079
#!
  
#*An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem.
#@Franz Rothlauf
#t2009
#cINFORMS Journal on Computing
#index1338053
#% 
#!
  
#*A Generalized Wedelin Heuristic for Integer Programming.
#@Oliver Bastert,Benjamin Hummel,Sven de Vries
#t2010
#cINFORMS Journal on Computing
#index1338061
#%890599
#%924198
#%1013647
#%1014493
#%2884515
#%2892320
#%3007117
#!
  
#*Feature Article - Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming.
#@Warren B. Powell
#t2010
#cINFORMS Journal on Computing
#index1338067
#%744316
#%832255
#%924251
#%952145
#%1009929
#%1013251
#%1278945
#%1288491
#%1288427
#%1288736
#%1289944
#!
  
#*Pruning Moves.
#@Matteo Fischetti,Domenico Salvagnin
#t2010
#cINFORMS Journal on Computing
#index1338070
#%2616
#%13434
#%133250
#%383227
#%407005
#%744713
#%813010
#%813814
#%950908
#%950749
#!
  
#*Two-Step MIR Inequalities for Mixed Integer Programs.
#@Sanjeeb Dash,Marcos Goycoolea,Oktay Günlük
#t2010
#cINFORMS Journal on Computing
#index2861946
#% 
#!
  
#*New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers.
#@Wanpracha Art Chaovalitwongse,Chun-An Chou,Tanya Y. Berger-Wolf,Bhaskar DasGupta,Saad I. Sheikh,Mary V. Ashley,Isabel C. Caballero
#t2010
#cINFORMS Journal on Computing
#index2861951
#% 
#!
  
#*Approximate Dynamic Programming for Ambulance Redeployment.
#@Matthew S. Maxwell,Mateo Restrepo,Shane G. Henderson,Huseyin Topaloglu
#t2010
#cINFORMS Journal on Computing
#index2861948
#% 
#!
  
#*Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem.
#@Mike Hewitt,George L. Nemhauser,Martin W. P. Savelsbergh
#t2010
#cINFORMS Journal on Computing
#index2861952
#% 
#!
  
#*The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment.
#@Jeffery L. Kennington,Charles D. Nicholson
#t2010
#cINFORMS Journal on Computing
#index2861956
#% 
#!
  
#*From the Editor.
#@John W. Chinneck
#t2010
#cINFORMS Journal on Computing
#index2861947
#% 
#!
  
#*A Class Representative Model for Pure Parsimony Haplotyping.
#@Daniele Catanzaro,Alessandra Godi,Martine Labbé
#t2010
#cINFORMS Journal on Computing
#index2861957
#% 
#!
  
#*A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion.
#@Samir Elhedhli,Huyu Wu
#t2010
#cINFORMS Journal on Computing
#index2861950
#% 
#!
  
#*A Tree Search Algorithm for Solving the Container Loading Problem.
#@Tobias Fanslau,Andreas Bortfeldt
#t2010
#cINFORMS Journal on Computing
#index2861949
#% 
#!
  
#*The Multidimensional Knapsack Problem: Structure and Algorithms.
#@Jakob Puchinger,Günther R. Raidl,Ulrich Pferschy
#t2010
#cINFORMS Journal on Computing
#index2861955
#% 
#!
  
#*TreeHugger: A New Test for Enrichment of Gene Ontology Terms.
#@Daniel Jupiter,Jessica Sahutoglu,Vincent VanBuren
#t2010
#cINFORMS Journal on Computing
#index2861953
#% 
#!
  
#*Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.
#@Stefan Irnich,Guy Desaulniers,Jacques Desrosiers,Ahmed Hadjar
#t2010
#cINFORMS Journal on Computing
#index2861954
#% 
#!
  
#*Bicriteria -Hub Location Problems and Evolutionary Algorithms.
#@Murat Köksalan,Banu Soylu
#t2010
#cINFORMS Journal on Computing
#index2923408
#% 
#!
  
#*Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems.
#@Ibrahim Muter,S. Ilker Birbil,Güvenç Sahin
#t2010
#cINFORMS Journal on Computing
#index2923413
#%117837
#%832255
#%885431
#%891649
#%924209
#%1288379
#%1289874
#%3007117
#!
  
#*Dual-Based Local Search for the Connected Facility Location and Related Problems.
#@M. Gisela Bardossy,S. Raghavan
#t2010
#cINFORMS Journal on Computing
#index2923407
#%211090
#%252222
#%506437
#%571915
#%611183
#%611529
#%622203
#%622204
#%623147
#%701299
#%932141
#%1024428
#!
  
#*Improving the Efficiency and Efficacy of Controlled Sequential Bifurcation for Simulation Factor Screening.
#@Hong Wan,Bruce E. Ankenman,Barry L. Nelson
#t2010
#cINFORMS Journal on Computing
#index2923402
#%668146
#%1120715
#%1120833
#!
  
#*Adaptive Auction Mechanism Design and the Incorporation of Prior Knowledge.
#@David Pardoe,Peter Stone,Maytal Saar-Tsechansky,Tayfun Keskin,Kerem Tomak
#t2010
#cINFORMS Journal on Computing
#index2923399
#%5989
#%592651
#%592732
#%610077
#%610076
#%658749
#%857457
#%924291
#%1009858
#%1270619
#%2884810
#!
  
#*FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs.
#@Kumar Abhishek,Sven Leyffer,Jeff Linderoth
#t2010
#cINFORMS Journal on Computing
#index2923412
#%924097
#%1013652
#%1014327
#%1275162
#%1340630
#%2892107
#!
  
#*MRSA Transmission Reduction Using Agent-Based Modeling and Simulation.
#@Sean Barnes,Bruce L. Golden,Edward A. Wasil
#t2010
#cINFORMS Journal on Computing
#index2923415
#%671969
#!
  
#*On the Numerical Analysis of Inhomogeneous Continuous-Time Markov Chains.
#@Markus Arns,Peter Buchholz,Andriy Panchenko
#t2010
#cINFORMS Journal on Computing
#index2923400
#%162072
#%188528
#%771824
#%813878
#%951031
#%3005636
#!
  
#*A Note on "A Superior Representation Method for Piecewise Linear Functions".
#@Juan Pablo Vielma,Shabbir Ahmed,George L. Nemhauser
#t2010
#cINFORMS Journal on Computing
#index2923404
#% 
#!
  
#*Solving the Order-Preserving Submatrix Problem via Integer Programming.
#@Andrew C. Trapp,Oleg A. Prokopyev
#t2010
#cINFORMS Journal on Computing
#index2923397
#%438310
#%558745
#%814748
#%924204
#%961897
#%1087017
#%3005546
#%3363182
#!
  
#*The Nested Event Tree Model with Application to Combating Terrorism.
#@Brian J. Lunday,Hanif D. Sherali,Theodore S. Glickman
#t2010
#cINFORMS Journal on Computing
#index2923410
#%814712
#%814782
#%1289733
#%1347895
#%2883308
#!
  
#*A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme.
#@Anthony Przybylski,Xavier Gandibleux,Matthias Ehrgott
#t2010
#cINFORMS Journal on Computing
#index2923401
#%2616
#!
  
#*Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions.
#@Dries R. Goossens,Rudolf Müller,Frits C. R. Spieksma
#t2010
#cINFORMS Journal on Computing
#index2923398
#%13799
#%56624
#%592912
#%621859
#%745808
#%815040
#%837749
#%924261
#%1013215
#%1289833
#%2883914
#!
  
#*Incremental Satisfiability and Implication for UTVPI Constraints.
#@Andreas Schutt,Peter J. Stuckey
#t2010
#cINFORMS Journal on Computing
#index2923409
#%13377
#%26713
#%186190
#%186034
#%547974
#%820199
#%950799
#%1006848
#!
  
#*The Valve Location Problem in Simple Network Topologies.
#@Hans L. Bodlaender,Albert Hendriks,Alexander Grigoriev,Nadejda V. Grigorieva
#t2010
#cINFORMS Journal on Computing
#index2923395
#%621214
#%621971
#%837428
#%1058651
#%3259556
#!
  
#*Appreciation to Referees.
#@John W. Chinneck
#t2010
#cINFORMS Journal on Computing
#index2923418
#% 
#!
  
#*Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach.
#@Hanif D. Sherali,Ki-Hwan Bae,Mohamed Haouari
#t2010
#cINFORMS Journal on Computing
#index2923414
#%813582
#%814595
#%815088
#%836004
#%1288585
#%1288516
#%1288621
#%1288741
#%1288668
#%1289508
#%1289686
#!
  
#*Algorithms for the Bin Packing Problem with Conflicts.
#@Albert Einstein Fernandes Muritiba,Manuel Iori,Enrico Malaguti,Paolo Toth
#t2010
#cINFORMS Journal on Computing
#index2923396
#%493216
#%812824
#%813357
#%836341
#%853584
#%888371
#%924317
#%924209
#%950363
#%972335
#%1089092
#%1337582
#!
  
#*A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network.
#@Alexander Erdelyi,Huseyin Topaloglu
#t2010
#cINFORMS Journal on Computing
#index2923403
#%1288618
#%1288712
#%1288709
#%1289804
#%1289762
#%1289840
#%1289953
#%2885185
#!
  
#*Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs.
#@Jean-Paul Watson,Roger J.-B. Wets,David L. Woodruff
#t2010
#cINFORMS Journal on Computing
#index2923417
#%924232
#%2884647
#%2891966
#%2891740
#!
  
#*Least-Squares Support Vector Machine Approach to Viral Replication Origin Prediction.
#@Raul Cruz-Cano,David S. H. Chew,Kwok Pui Choi,Ming-Ying Leung
#t2010
#cINFORMS Journal on Computing
#index2923406
#%678326
#%766871
#%767321
#%1009444
#%1009507
#%1027314
#%1028296
#%1070014
#!
  
#*An Automated Intensity-Modulated Radiation Therapy Planning System.
#@Shabbir Ahmed,Ozan Gozbasi,Martin W. P. Savelsbergh,Ian Crocker,Tim Fox,Eduard Schreibmann
#t2010
#cINFORMS Journal on Computing
#index2923411
#%1289663
#!
  
#*From the Editor.
#@John W. Chinneck
#t2010
#cINFORMS Journal on Computing
#index2923416
#% 
#!
  
#*Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection.
#@Rajeev Kumar,Ram D. Gopal,Robert S. Garfinkel
#t2010
#cINFORMS Journal on Computing
#index2923405
#%472482
#%472688
#%473505
#!
  
#*The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations.
#@Aysegül Altin,Hande Yaman,Mustafa Ç. Pinar
#t2011
#cINFORMS Journal on Computing
#index3070947
#%46473
#%588591
#%588740
#%622203
#%622204
#%623439
#%885386
#%952935
#%1013342
#%1013380
#%1013994
#%1014534
#%1014481
#%1014533
#%1024798
#%1024820
#%1024722
#%1061999
#%1061989
#%1289706
#%1289967
#%3077040
#!
  
#*Resource Allocation via Message Passing.
#@Ciamac Cyrus Moallemi,Benjamin Van Roy
#t2011
#cINFORMS Journal on Computing
#index3070961
#%154666
#%168342
#%169312
#%335788
#%595533
#%611072
#%764739
#%816457
#%907605
#%985212
#%1023645
#%1051801
#%1052000
#%1122404
#%1123067
#%1156057
#%2976986
#!
  
#*Why Does Collaborative Filtering Work? Transaction-Based Recommendation Model Validation and Selection by Analyzing Bipartite Random Graphs.
#@Zan Huang,Daniel Dajun Zeng
#t2011
#cINFORMS Journal on Computing
#index3070944
#%88644
#%122001
#%467559
#%472411
#%592817
#%746761
#%839637
#%875793
#%875816
#%937571
#%982346
#%1038700
#%1063733
#%1112335
#%1120200
#%1120154
#%1120192
#%1120268
#%2825093
#%2884139
#%2887052
#!
  
#*An Efficient and Numerically Stable Method for Computing Bounds for the Interval Availability Distribution.
#@Juan A. Carrasco
#t2011
#cINFORMS Journal on Computing
#index3070963
#%597586
#%812344
#%1037121
#%1079457
#%1081659
#!
  
#*A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem.
#@Slawomir Bak,Jacek Blazewicz,Grzegorz Pawlak,Maciej Plaza,Edmund K. Burke,Graham Kendall
#t2011
#cINFORMS Journal on Computing
#index3070951
#%310891
#%812988
#%812989
#%814348
#%814733
#%814778
#%924200
#%950675
#%989206
#%1275042
#%1289929
#%3545707
#!
  
#*Solving Talent Scheduling with Dynamic Programming.
#@Maria Garcia de la Banda,Peter J. Stuckey,Geoffrey Chu
#t2011
#cINFORMS Journal on Computing
#index3070945
#%15346
#%132459
#%212081
#%538377
#%622444
#%660789
#%812189
#%1240285
#!
  
#*Combining Constraint Programming and Local Search for Job-Shop Scheduling.
#@J. Christopher Beck,T. K. Feng,Jean-Paul Watson
#t2011
#cINFORMS Journal on Computing
#index3070950
#%15011
#%117111
#%117412
#%117592
#%118259
#%335158
#%451423
#%744345
#%745315
#%811768
#%814718
#%932671
#%952409
#%984987
#%1054383
#%3006065
#!
  
#*Computing a Classic Index for Finite-Horizon Bandits.
#@José Niño-Mora
#t2011
#cINFORMS Journal on Computing
#index3070962
#%2884123
#!
  
#*A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem.
#@Marco A. Boschetti,Vittorio Maniezzo,Matteo Roffilli
#t2011
#cINFORMS Journal on Computing
#index3070953
#%2623
#%161701
#%297045
#%489670
#%543863
#%550897
#%588776
#%784221
#%806365
#%813608
#%885501
#%1337592
#!
  
#*Algorithms for Coxianization of Phase-Type Generators.
#@Qi-Ming He,Hanqin Zhang,Jungong Xue
#t2011
#cINFORMS Journal on Computing
#index3070952
#%716885
#!
  
#*Branch and Price for WDM Optical Networks with No Bifurcation of Flow.
#@S. Raghavan,Daliborka Stanojevic
#t2011
#cINFORMS Journal on Computing
#index3070942
#%1121994
#%1122532
#!
  
#*Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains.
#@Benny Van Houdt,Johan van Leeuwaarden
#t2011
#cINFORMS Journal on Computing
#index3070943
#%118435
#%597728
#%924085
#%1047825
#%1048349
#!
  
#*Decision Support and Optimization in Shutdown and Turnaround Scheduling.
#@Nicole Megow,Rolf H. Möhring,Jens Schulz
#t2011
#cINFORMS Journal on Computing
#index3070958
#%17654
#%838690
#%1014472
#%1061275
#%1077291
#!
  
#*A Parallel Algorithm for the Vehicle Routing Problem.
#@Chris Groër,Bruce L. Golden,Edward A. Wasil
#t2011
#cINFORMS Journal on Computing
#index3070964
#%199605
#%812274
#%813411
#%814693
#%814606
#%1035391
#%2866872
#%3545703
#!
  
#*Sequential Grid Computing: Models and Computational Experiments.
#@Sam Ransbotham,Ishwar Murthy,Sabyasachi Mitra,Sridhar Narasimhan
#t2011
#cINFORMS Journal on Computing
#index3070955
#%186425
#%771484
#%781427
#%786644
#%786947
#%810160
#%824507
#%833179
#%856906
#%891803
#%891958
#%891959
#%892238
#%924286
#%1081636
#%1124666
#%1125224
#%1289254
#%1295403
#%2998944
#!
  
#*Decorous Lower Bounds for Minimum Linear Arrangement.
#@Alberto Caprara,Adam N. Letchford,Juan José Salazar González
#t2011
#cINFORMS Journal on Computing
#index3070949
#%212081
#%660789
#%814958
#%832456
#%837546
#%839233
#%924111
#%934779
#%950227
#%953465
#%979944
#%1060332
#%1089585
#%1331999
#%3007117
#!
  
#*An Automated and Data-Driven Bidding Strategy for Online Auctions.
#@Wolfgang Jank,Shu Zhang
#t2011
#cINFORMS Journal on Computing
#index3070956
#%1270619
#!
  
#*An Algorithm for Data Envelopment Analysis.
#@José H. Dulá
#t2011
#cINFORMS Journal on Computing
#index3070954
#%814719
#%815010
#%924027
#%1275222
#!
  
#*Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment.
#@Iván A. Contreras,Juan A. Díaz,Elena Fernández
#t2011
#cINFORMS Journal on Computing
#index3070948
#%812709
#%814865
#%851675
#%924113
#%1013925
#%1014399
#%1270236
#%1289635
#%1289874
#!
  
#*From the Editor.
#@John W. Chinneck
#t2011
#cINFORMS Journal on Computing
#index3070959
#% 
#!
  
#*Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem.
#@Faramroze G. Engineer,George L. Nemhauser,Martin W. P. Savelsbergh
#t2011
#cINFORMS Journal on Computing
#index3070946
#%186398
#%1288390
#%1289561
#!
  
#*Operating Room Pooling and Parallel Surgery Processing Under Uncertainty.
#@Sakine Batun,Brian T. Denton,Todd R. Huschka,Andrew J. Schaefer
#t2011
#cINFORMS Journal on Computing
#index3070957
#%671867
#%1013760
#%1289810
#%2937116
#%2974890
#!
  
#*Performance of Skart: A Skewness- and Autoregression-Adjusted Batch Means Procedure for Simulation Analysis.
#@Ali Tafazzoli,James R. Wilson,Emily K. Lada,Natalie M. Steiger
#t2011
#cINFORMS Journal on Computing
#index3070960
#%670925
#%672418
#%924246
#%1120844
#%1275102
#!
  
#*A Clock-and-Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs.
#@Ravi Bapna,Sanjukta Das,Robert Day,Robert S. Garfinkel,Jan Stallaert
#t2011
#cINFORMS Journal on Computing
#index3485050
#%254323
#%471104
#%877451
#%924286
#%1129764
#%1295337
#%2884769
#!
  
#*Optimal Testing of Digital Microfluidic Biochips.
#@Bogdan Pasaniuc,Robert S. Garfinkel,Ion I. Mandoiu,Alexander Zelikovsky
#t2011
#cINFORMS Journal on Computing
#index3485047
#%143098
#%812768
#%859063
#%920386
#%1117890
#%1166898
#%1166838
#!
  
#*Optimization of Supply Chain Systems with Price Elasticity of Demand.
#@Ugur Kaplan,Metin Türkay,Bülent Karasözen,Lorenz T. Biegler
#t2011
#cINFORMS Journal on Computing
#index3485040
#% 
#!
  
#*Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable.
#@Pasquale Avella,Maurizio Boccia,Igor Vasilyev
#t2012
#cINFORMS Journal on Computing
#index3485011
#% 
#!
  
#*CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem.
#@Renata Mansini,Maria Grazia Speranza
#t2012
#cINFORMS Journal on Computing
#index3485029
#%79052
#%885431
#%1290046
#%2852834
#%2861955
#!
  
#*Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints.
#@Brian Keller,Güzin Bayraksan
#t2012
#cINFORMS Journal on Computing
#index3485023
#% 
#!
  
#*A Hybrid Heuristic for an Inventory Routing Problem.
#@Claudia Archetti,Luca Bertazzi,Alain Hertz,Maria Grazia Speranza
#t2012
#cINFORMS Journal on Computing
#index3485004
#% 
#!
  
#*Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach.
#@Abdullah Konak,Alice E. Smith
#t2011
#cINFORMS Journal on Computing
#index3485030
#%139464
#%186611
#%310550
#%701377
#%748680
#%812778
#%814157
#%815142
#%832439
#%839320
#%860795
#%860823
#%860948
#%2875698
#%2925933
#!
  
#*A Randomized Exhaustive Propositionalization Approach for Molecule Classification.
#@Michele Samorani,Manuel Laguna,Robert Kirk DeLisle,Daniel C. Weaver
#t2011
#cINFORMS Journal on Computing
#index3485024
#%2333
#%541752
#%942793
#!
  
#*Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs.
#@Osman Y. Özaltin,Brady Hunsaker,Andrew J. Schaefer
#t2011
#cINFORMS Journal on Computing
#index3485041
#%13484
#%924117
#%1058885
#!
  
#*Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles.
#@Fabrice Talla Nobibon,Cor A. J. Hurkens,Roel Leus,Frits C. R. Spieksma
#t2012
#cINFORMS Journal on Computing
#index3485051
#%2023
#%117884
#%219951
#%268601
#%852989
#%865435
#%979405
#%1090029
#%2774065
#%3005546
#!
  
#*A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks.
#@Xiangyong Li,Yash P. Aneja
#t2012
#cINFORMS Journal on Computing
#index3485006
#%104176
#%505836
#%953064
#%1012917
#%1024853
#%3005546
#%3006048
#!
  
#*Minimal Equivalent Binary Knapsack Inequalities.
#@Gary J. Koehler
#t2011
#cINFORMS Journal on Computing
#index3485045
#%406726
#%813814
#%837088
#%953499
#%1275171
#%3007117
#!
  
#*Shilling Attack Detection - A New Approach for a Trustworthy Recommender System.
#@Jong-Seok Lee,Dan Zhu
#t2012
#cINFORMS Journal on Computing
#index3485021
#% 
#!
  
#*New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows.
#@Roberto Baldacci,Aristide Mingozzi,Roberto Roberti
#t2012
#cINFORMS Journal on Computing
#index3485012
#%924066
#%924047
#%1189393
#%1275117
#%1288700
#%1288743
#%1289561
#%2852775
#%3455459
#!
  
#*Color-Coding Algorithms to the Balanced Path Problem: Computational Issues.
#@Paola Cappanera,Maria Grazia Scutellà
#t2011
#cINFORMS Journal on Computing
#index3485025
#%465942
#%783637
#%838052
#%839410
#%861707
#%949588
#%951211
#%1024204
#%1024803
#%1054404
#%1061532
#%1275167
#%1289950
#%1290170
#!
  
#*A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem.
#@Peter M. Hahn,Yi-Rong Zhu,Monique Guignard,William L. Hightower,Matthew J. Saltzman
#t2012
#cINFORMS Journal on Computing
#index3485034
#%809611
#%838097
#%1014466
#%2891971
#!
  
#*An Asymptotic Test of Optimality Conditions in Multiresponse Simulation Optimization.
#@Ebru Angün,Jack P. C. Kleijnen
#t2012
#cINFORMS Journal on Computing
#index3485014
#% 
#!
  
#*Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation.
#@Stefano Gualandi,Federico Malucelli
#t2012
#cINFORMS Journal on Computing
#index3485059
#% 
#!
  
#*An Improved Branch-and-Bound Method for Maximum Monomial Agreement.
#@Jonathan Eckstein,Noam Goldberg
#t2012
#cINFORMS Journal on Computing
#index3485056
#%104441
#%185976
#%751380
#%862313
#%971816
#%971962
#%985098
#%1009397
#%1009615
#%1009890
#%1009896
#%1013425
#%1059745
#%1060738
#%1089765
#%1112474
#%1338071
#%3075851
#%3458528
#!
  
#*An Optimal Constraint Programming Approach to the Open-Shop Problem.
#@Arnaud Malapert,Hadrien Cambazard,Christelle Guéret,Narendra Jussien,André Langevin,Louis-Martin Rousseau
#t2012
#cINFORMS Journal on Computing
#index3485044
#%11839
#%117111
#%117879
#%389385
#%391591
#%451423
#%628362
#%812244
#%814966
#%932671
#%950482
#%979975
#%979958
#%3002237
#!
  
#*Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time.
#@Roberto Rossi,S. Armagan Tarim,Ramesh Bollapragada
#t2012
#cINFORMS Journal on Computing
#index3485027
#% 
#!
  
#*Data Structures for Higher-Dimensional Rectilinear Packing.
#@Sam D. Allen,Edmund K. Burke
#t2012
#cINFORMS Journal on Computing
#index3485035
#%27896
#%257518
#%815027
#%924285
#%1207887
#%1275042
#%1289929
#%2853018
#%2887654
#!
  
#*Efficient and Reliable Computation of Birth-Death Process Performance Measures.
#@Armann Ingolfsson,Ling Tang
#t2012
#cINFORMS Journal on Computing
#index3485013
#% 
#!
  
#*Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem.
#@Pavlos Eirinakis,Dimitris Magos,Ioannis Mourtos,Panayiotis Miliotis
#t2012
#cINFORMS Journal on Computing
#index3485057
#%14640
#%117386
#%118188
#%367977
#%774231
#%836001
#%950462
#%971974
#%1059424
#%1093295
#%1095570
#%2915530
#%3003855
#!
  
#*Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks.
#@Daniel Reich,Leo Lopes
#t2011
#cINFORMS Journal on Computing
#index3485058
#% 
#!
  
#*The Balanced Minimum Evolution Problem.
#@Daniele Catanzaro,Martine Labbé,Raffaele Pesenti,Juan José Salazar González
#t2012
#cINFORMS Journal on Computing
#index3485005
#%763202
#%1024895
#%1024913
#%1060172
#!
  
#*New Stabilization Procedures for the Cutting Stock Problem.
#@François Clautiaux,Cláudio Alves,José M. Valério de Carvalho,Jürgen Rietz
#t2011
#cINFORMS Journal on Computing
#index3485018
#%814017
#%814702
#%814590
#%851675
#%924156
#%924113
#%1013849
#%1289635
#%1289874
#%3007117
#!
  
#*An Improved Primal Simplex Algorithm for Degenerate Linear Programs.
#@Issmail Elhallaoui,Abdelmoutalib Metrane,Guy Desaulniers,François Soumis
#t2011
#cINFORMS Journal on Computing
#index3485026
#%814809
#%1289918
#%2852915
#%2866401
#%3458234
#!
  
#*An Efficient Global Approach for Posynomial Geometric Programming Problems.
#@Jung-Fa Tsai,Ming-Hua Lin
#t2011
#cINFORMS Journal on Computing
#index3485043
#%812475
#%1013910
#%1275049
#%1287615
#%2936871
#%3075857
#!
  
#*A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result.
#@Piyush Kumar,E. Alper Yildirim
#t2011
#cINFORMS Journal on Computing
#index3485055
#%334459
#%336041
#%391359
#%472866
#%609938
#%611526
#%621364
#%838661
#%980008
#%985138
#%985182
#%985302
#%1239943
#%2891791
#!
  
#*On the Prevention of Fraud and Privacy Exposure in Process Information Flow.
#@Xue Bai,Ram D. Gopal,Manuel A. Nunez,Dmitry Zhdanov
#t2012
#cINFORMS Journal on Computing
#index3485061
#%5612
#%25151
#%68191
#%244444
#%557930
#%570257
#%811345
#%833162
#%891778
#%939175
#%943409
#%970464
#%982073
#%982372
#%1073118
#%1103561
#%1103569
#%1128224
#%1132626
#%2884176
#%3082329
#%3569039
#!
  
#*A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations.
#@Alex Y. D. Siem,Dick den Hertog,Aswin L. Hoffmann
#t2011
#cINFORMS Journal on Computing
#index3485016
#%750887
#%1013762
#%1048039
#%1341462
#%2891837
#!
  
#*Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem.
#@Mohammad M. Fazel-Zarandi,J. Christopher Beck
#t2012
#cINFORMS Journal on Computing
#index3485009
#%117146
#%118229
#%118289
#%811806
#%813099
#%813851
#%814422
#%815018
#%924134
#%1240275
#%1275104
#%1288615
#%1289734
#%2884643
#%2942461
#%2942444
#%3118954
#!
  
#*Solving Large -Median Problems with a Radius Formulation.
#@Sergio García,Martine Labbé,Alfredo Marín
#t2011
#cINFORMS Journal on Computing
#index3485028
#% 
#!
  
#*A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.
#@Sanjeeb Dash,Oktay Günlük,Andrea Lodi,Andrea Tramontani
#t2012
#cINFORMS Journal on Computing
#index3485036
#% 
#!
  
#*Core Routing on Dynamic Time-Dependent Road Networks.
#@Daniel Delling,Giacomo Nannicini
#t2012
#cINFORMS Journal on Computing
#index3485019
#%2023
#%38854
#%186472
#%416175
#%654392
#%654440
#%654438
#%654409
#%654398
#%951338
#%1241682
#%2864056
#%2864041
#%3060797
#!
  
#*The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery.
#@Diana M. Negoescu,Peter Frazier,Warren B. Powell
#t2011
#cINFORMS Journal on Computing
#index3485062
#%157055
#%668115
#%672092
#%1120719
#%1120847
#%1275094
#%1338060
#%2889718
#%3003838
#!
  
#*Data-Mining-Driven Neighborhood Search.
#@Michele Samorani,Manuel Laguna
#t2012
#cINFORMS Journal on Computing
#index3485042
#%252177
#%812426
#%813608
#%1044445
#%2858476
#%2884294
#%2884749
#!
  
#*A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence.
#@Yuping Wang,Hong Li,Chuangyin Dang
#t2011
#cINFORMS Journal on Computing
#index3485054
#% 
#!
  
#*A Study of Quality and Accuracy Trade-offs in Process Mining.
#@Zan Huang,Akhil Kumar
#t2012
#cINFORMS Journal on Computing
#index3485015
#%105
#%45178
#%45736
#%48454
#%68367
#%68410
#%68454
#%68406
#%68481
#%68502
#%151510
#%176198
#%183826
#%473275
#%831530
#%839699
#%839679
#%845481
#%845755
#%855954
#%928851
#%939236
#%939203
#%1071152
#%1112310
#%1112839
#%1192761
#!
  
#*Experiments with Two-Row Cuts from Degenerate Tableaux.
#@Amitabh Basu,Pierre Bonami,Gérard Cornuéjols,François Margot
#t2011
#cINFORMS Journal on Computing
#index3485037
#%407040
#%407075
#%407038
#%890599
#%1013437
#%1014057
#%1014401
#%1340647
#%1340598
#%2974897
#%2925948
#!
  
#*An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy.
#@Mehmet C. Demirci,Andrew J. Schaefer,H. Edwin Romeijn,Mark S. Roberts
#t2012
#cINFORMS Journal on Computing
#index3485020
#%1013981
#%2987667
#!
  
#*Robust Optimization in Simulation: Taguchi and Krige Combined.
#@Gabriella Dellino,Jack P. C. Kleijnen,Carlo Meloni
#t2012
#cINFORMS Journal on Computing
#index3485060
#%181034
#%667799
#%904393
#%924183
#%1014082
#%1156475
#%1289844
#%1346532
#%1346551
#%2883309
#%3118930
#!
  
#*Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study.
#@Amar Kumar Narisetty,Jean-Philippe P. Richard,George L. Nemhauser
#t2011
#cINFORMS Journal on Computing
#index3485033
#%383227
#%407040
#%407038
#%837699
#%924136
#%1340610
#%1340647
#%3007117
#!
  
#*A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts.
#@Samir Elhedhli,Lingzi Li,Mariem Gzara,Joe Naoum-Sawaya
#t2011
#cINFORMS Journal on Computing
#index3485046
#%812824
#%813357
#%972335
#%2923396
#!
  
#*Automating Bivariate Transformations.
#@Jeff X. Yang,John H. Drew,Lawrence M. Leemis
#t2012
#cINFORMS Journal on Computing
#index3485039
#% 
#!
  
#*Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets.
#@Gijs Rennen,Edwin R. van Dam,Dick den Hertog
#t2011
#cINFORMS Journal on Computing
#index3485032
#%1121138
#%1289536
#%1289771
#!
  
#*C-NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions.
#@Soumyadip Ghosh,Raghu Pasupathy
#t2012
#cINFORMS Journal on Computing
#index3485007
#%924129
#%1120638
#%1121728
#%1275041
#%1275232
#!
  
#*A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem.
#@Edward C. Sewell,Sheldon H. Jacobson
#t2012
#cINFORMS Journal on Computing
#index3485052
#%42532
#%389315
#%812688
#%950135
#%1289534
#!
  
#*Combination of Nonlinear and Linear Optimization of Transient Gas Networks.
#@Pia Domschke,Björn Geißler,Oliver Kolb,Jens Lang,Alexander Martin,Antonio Morsi
#t2011
#cINFORMS Journal on Computing
#index3485049
#%1014290
#%1014327
#%1340613
#%2923412
#!
  
#*An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials.
#@Kaiqi Yu,Mei-Ling Huang,Percy H. Brill
#t2012
#cINFORMS Journal on Computing
#index3485038
#% 
#!
  
#*Robust Software Partitioning with Multiple Instantiation.
#@Simon A. Spacey,Wolfram Wiesemann,Daniel Kuhn,Wayne Luk
#t2012
#cINFORMS Journal on Computing
#index3485053
#%106220
#%118402
#%282062
#%341264
#%464608
#%646041
#%752741
#%806680
#%808565
#%858055
#%858157
#%934490
#%991065
#%1013701
#%1134452
#%1134657
#%1135692
#%1165833
#%3457991
#!
  
#*A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection.
#@Pierre Brice,Wei Jiang,Guohua Wan
#t2011
#cINFORMS Journal on Computing
#index3485031
#%95108
#%95452
#%210841
#%301976
#%472555
#%473499
#%473387
#%641901
#%839503
#%839670
#!
  
#*The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms.
#@Zuo-Jun Max Shen,Roger Lezhou Zhan,Jiawei Zhang
#t2011
#cINFORMS Journal on Computing
#index3485010
#%46627
#%623147
#%814712
#%817978
#%820125
#%950780
#%953023
#%1060732
#%1077295
#%1288546
#%2892055
#%2937097
#%3458065
#!
  
#*A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.
#@Gerardo Berbeglia,Jean-François Cordeau,Gilbert Laporte
#t2012
#cINFORMS Journal on Computing
#index3485017
#%406865
#%924047
#%1024805
#%1033953
#%1288575
#%1289681
#%3466256
#!
  
#*Discovery of Periodic Patterns in Sequence Data: A Variance-Based Approach.
#@Yinghui (Catherine) Yang,Balaji Padmanabhan,Hongyan Liu,Xiaoyu Wang
#t2012
#cINFORMS Journal on Computing
#index3485048
#%300455
#%472384
#%598135
#%641841
#%839571
#%839627
#%839666
#%1113817
#%1120015
#!
  
#*Computing Near-Optimal Policies in Generalized Joint Replenishment.
#@Daniel Adelman,Diego Klabjan
#t2012
#cINFORMS Journal on Computing
#index3485008
#% 
#!
  
#*Transient Queueing Analysis.
#@William Kaczynski,Lawrence M. Leemis,John H. Drew
#t2012
#cINFORMS Journal on Computing
#index3485022
#% 
#!
  
#*Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand.
#@S. Ayca Erdogan,Brian T. Denton
#t2013
#cINFORMS Journal on Computing
#index3657240
#% 
#!
  
#*Assessing the Value of Dynamic Pricing in Network Revenue Management.
#@Dan Zhang,Zhaosong Lu
#t2013
#cINFORMS Journal on Computing
#index3657233
#% 
#!
  
#*Rational Automata Networks: A Non-Markovian Modeling Approach.
#@Peter Buchholz,Miklós Telek
#t2013
#cINFORMS Journal on Computing
#index3657232
#% 
#!
  
#*Steady-State Simulation with Replication-Dependent Initial Transients: Analysis and Examples.
#@Nilay Tanik Argon,Sigrún Andradóttir,Christos Alexopoulos,David Goldsman
#t2013
#cINFORMS Journal on Computing
#index3657241
#% 
#!
  
#*Static Network Reliability Estimation via Generalized Splitting.
#@Zdravko I. Botev,Pierre L'Ecuyer,Gerardo Rubino,Richard J. Simard,Bruno Tuffin
#t2013
#cINFORMS Journal on Computing
#index3657239
#% 
#!
  
#*An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems.
#@Jie Xu,Barry L. Nelson,L. Jeff Hong
#t2013
#cINFORMS Journal on Computing
#index3657242
#% 
#!
  
#*Discovery of Online Shopping Patterns Across Websites.
#@Yinghui (Catherine) Yang,Hongyan Liu,Yunjue Cai
#t2013
#cINFORMS Journal on Computing
#index3657244
#% 
#!
  
#*Message from the Editor.
#@David L. Woodruff
#t2013
#cINFORMS Journal on Computing
#index3657243
#% 
#!
  
#*Convex Approximations of a Probabilistic Bicriteria Model with Disruptions.
#@Tara Rengarajan,Nedialko B. Dimitrov,David P. Morton
#t2013
#cINFORMS Journal on Computing
#index3657236
#% 
#!
  
#*A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks.
#@Manuel A. Alba Martínez,Jean-Fran?ois Cordeau,Mauro Dell'Amico,Manuel Iori
#t2013
#cINFORMS Journal on Computing
#index3657237
#% 
#!
  
#*Max--Cut by the Discrete Dynamic Convexized Method.
#@Wenxing Zhu,Geng Lin,M. M. Ali
#t2013
#cINFORMS Journal on Computing
#index3657235
#% 
#!
  
#*A New Graph-Theoretical Model for the Guillotine-Cutting Problem.
#@Fran?ois Clautiaux,Antoine Jouglet,Aziz Moukrim
#t2013
#cINFORMS Journal on Computing
#index3657238
#% 
#!
  
#*Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.
#@Quentin Botton,Bernard Fortz,Luis Gouveia,Michael Poss
#t2013
#cINFORMS Journal on Computing
#index3657234
#% 
#!
  
#*A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network.
#@David R. Morrison,Jason J. Sauppe,Sheldon H. Jacobson
#t2013
#cINFORMS Journal on Computing
#index3657231
#% 
#!
  
#*Provable Isomorphisms of Types.
#@Kim B. Bruce,Roberto Di Cosmo,Giuseppe Longo
#t1992
#cMathematical Structures in Computer Science
#index1014594
#% 
#!
  
#*top-top-closed relations and admissibility.
#@Martín Abadi
#t2000
#cMathematical Structures in Computer Science
#index1014595
#% 
#!
  
#*Concurrent models for Linda with transactions.
#@Roberto Bruni,Ugo Montanari
#t2004
#cMathematical Structures in Computer Science
#index1014596
#%89
#%45164
#%45123
#%45262
#%45130
#%114157
#%114231
#%137937
#%252128
#%268030
#%269184
#%484721
#%494704
#%552619
#%887443
#%887396
#%887394
#%888369
#%892857
#%1089823
#%1089822
#%1091689
#%1123526
#%1129100
#!
  
#*Sequentiality vs. Concurrency In Games And Logic.
#@Samson Abramsky
#t2003
#cMathematical Structures in Computer Science
#index1014597
#%2597
#%66658
#%124488
#%484639
#%484406
#%484829
#%484924
#%485023
#%487301
#%495056
#%546730
#%886906
#%887145
#%887982
#%998048
#%1014599
#%1089083
#%1091506
#%1092417
#%3005514
#%3005872
#!
  
#*Symmetric Monoidal and Cartesian Double Categories as a Semantic Framework for Tile Logic.
#@Roberto Bruni,José Meseguer,Ugo Montanari
#t2002
#cMathematical Structures in Computer Science
#index1014598
#%126830
#%651563
#%887831
#%887394
#%888913
#%1007491
#%1089610
#!
  
#*Geometry of Interaction and Linear Combinatory Algebras.
#@Samson Abramsky,Esfandiar Haghverdi,Philip J. Scott
#t2002
#cMathematical Structures in Computer Science
#index1014599
#%108573
#%484406
#%485071
#%546235
#%628797
#%886908
#%886906
#%998048
#%1014784
#%1088698
#%1089151
#%1089028
#%1091506
#%3004668
#!
  
#*Intersection Types and lambda-Definability.
#@Antonio Bucciarelli,Adolfo Piperno,Ivano Salvo
#t2003
#cMathematical Structures in Computer Science
#index1014600
#%124594
#%268962
#%484239
#%484519
#%546447
#%553008
#%887420
#%950320
#%1089088
#%1092962
#!
  
#*Quantales, Observational Logic and Process Semantics.
#@Samson Abramsky,Steven Vickers
#t1993
#cMathematical Structures in Computer Science
#index1014601
#% 
#!
  
#*Very Abstract Specifications: A Formalism Independent Approach.
#@Maura Cerioli,Gianna Reggio
#t1998
#cMathematical Structures in Computer Science
#index1014602
#%17335
#%27801
#%39897
#%109584
#%126802
#%208507
#%466515
#%486468
#%889336
#%950459
#%973029
#!
  
#*A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.
#@Luca Aceto,Wan Fokkink,Anna Ingólfsdóttir
#t1998
#cMathematical Structures in Computer Science
#index1014603
#% 
#!
  
#*Weak Inclusion Systems.
#@Virgil Emil Cazanescu,Grigore Rosu
#t1997
#cMathematical Structures in Computer Science
#index1014604
#%494599
#!
  
#*Foreword To Special Issue: The Difference Between Concurrent And Sequential Computation.
#@Luca Aceto,Giuseppe Longo,Björn Victor
#t2003
#cMathematical Structures in Computer Science
#index1014605
#% 
#!
  
#*Event Structures and Non-Orthogonal Term Graph Rewriting.
#@David Clark,Richard Kennaway
#t1996
#cMathematical Structures in Computer Science
#index1014606
#% 
#!
  
#*The Russell-Prawitz modality.
#@Peter Aczel
#t2001
#cMathematical Structures in Computer Science
#index1014607
#% 
#!
  
#*Categorical Concepts for Parameterized Partial Specifications.
#@Ingo Claßen,Martin Große-Rhode,Uwe Wolter
#t1995
#cMathematical Structures in Computer Science
#index1014608
#% 
#!
  
#*A Categorical Generalization of Scott Domains.
#@Jirí Adámek
#t1997
#cMathematical Structures in Computer Science
#index1014609
#%269020
#!
  
#*Introduction to Distributive Categories.
#@J. Robin B. Cockett
#t1993
#cMathematical Structures in Computer Science
#index1014610
#% 
#!
  
#*Free Iterative Theories: A Coalgebraic View.
#@Jirí Adámek,Stefan Milius,Jiri Velebil
#t2003
#cMathematical Structures in Computer Science
#index1014611
#%485241
#%1014609
#%1088611
#%1088625
#%1093596
#!
  
#*Introduction to linear bicategories.
#@J. Robin B. Cockett,Jürgen Koslowski,R. A. G. Seely
#t2000
#cMathematical Structures in Computer Science
#index1014612
#%1091506
#!
  
#*A general final coalgebra theorem.
#@Jirí Adámek,Stefan Milius,Jiri Velebil
#t2005
#cMathematical Structures in Computer Science
#index1014613
#%126785
#%818516
#%888903
#%1088611
#%1088729
#%1088733
#%1093596
#%1094318
#!
  
#*String Rewriting and Homology of Monoids.
#@Daniel E. Cohen
#t1997
#cMathematical Structures in Computer Science
#index1014614
#%1094712
#%3005540
#!
  
#*On Varieties and Covarieties in a Category.
#@Jirí Adámek,Hans-E. Porst
#t2003
#cMathematical Structures in Computer Science
#index1014615
#%1088611
#%1088625
#%1089151
#%1092529
#%1094318
#!
  
#*Syntactical Truth Predicates for Formulas with Atomic Negation.
#@Loïc Colson
#t2002
#cMathematical Structures in Computer Science
#index1014616
#% 
#!
  
#*Finitary Sketches and Finitely Accessible Categories.
#@Jirí Adámek,Jirí Rosický
#t1995
#cMathematical Structures in Computer Science
#index1014617
#% 
#!
  
#*Higher-Order Intersection Types and Multiple Inheritance.
#@Adriana B. Compagnoni,Benjamin C. Pierce
#t1996
#cMathematical Structures in Computer Science
#index1014618
#% 
#!
  
#*Operational aspects of untyped Normalisation by Evaluation.
#@Klaus Aehlig,Felix Joachimski
#t2004
#cMathematical Structures in Computer Science
#index1014619
#%126786
#%451388
#%484452
#%511758
#%563370
#%563401
#%628791
#%628743
#%980805
#%1014622
#%1014642
#%1093851
#!
  
#*A Generalization of the Trie Data Structure.
#@Richard H. Connelly,F. Lockwood Morris
#t1995
#cMathematical Structures in Computer Science
#index1014620
#% 
#!
  
#*A Categorial Approach to the Semantics of Argumentation.
#@Simon Ambler
#t1996
#cMathematical Structures in Computer Science
#index1014621
#% 
#!
  
#*Intuitionistic Model Constructions and Normalization Proofs.
#@Thierry Coquand,Peter Dybjer
#t1997
#cMathematical Structures in Computer Science
#index1014622
#%124407
#%124696
#%126786
#%628791
#%887392
#!
  
#*A Theory of Mixin Modules: Algebraic Laws and Reduction Semantics.
#@Davide Ancona,Elena Zucca
#t2002
#cMathematical Structures in Computer Science
#index1014623
#%27809
#%172936
#%309847
#%309896
#%484289
#%521918
#%542494
#%543094
#%545886
#%546192
#%546373
#%546283
#%546436
#%548030
#%651543
#%741384
#%741382
#%949708
#%950459
#%980746
#%980978
#%984701
#%1014625
#%3006784
#!
  
#*A new method for establishing conservativity of classical systems over their intuitionistic version.
#@Thierry Coquand,Martin Hofmann
#t1999
#cMathematical Structures in Computer Science
#index1014624
#% 
#!
  
#*A Theory of Mixin Modules: Basic and Derived Operators.
#@Davide Ancona,Elena Zucca
#t1998
#cMathematical Structures in Computer Science
#index1014625
#%103
#%85
#%141
#%38993
#%39877
#%39987
#%70700
#%172936
#%173251
#%309847
#%484289
#%493231
#%494755
#%521918
#%522534
#%522554
#%543094
#%546373
#%546283
#%546436
#%626460
#%628842
#%651543
#%889336
#%949708
#%950459
#%3003352
#%3006095
#!
  
#*Simulating Expansions without Expansions.
#@Roberto Di Cosmo,Delia Kesner
#t1994
#cMathematical Structures in Computer Science
#index1014626
#% 
#!
  
#*Reo: a channel-based coordination model for component composition.
#@Farhad Arbab
#t2004
#cMathematical Structures in Computer Science
#index1014627
#%109599
#%116270
#%116278
#%546020
#%1089729
#%1089555
#!
  
#*Abstract and behaviour module specifications.
#@Felix Cornelius,Michael Baldamus,Hartmut Ehrig,Fernando Orejas
#t1999
#cMathematical Structures in Computer Science
#index1014628
#%27653
#%27808
#%27813
#%188772
#%204530
#%208633
#%267878
#%268096
#%486468
#%950459
#%971554
#%972909
#%1090878
#%1090890
#%1094885
#%1123941
#%1129793
#!
  
#*Causal Dependencies in Multiplicative Linear Logic with MIX.
#@Andrea Asperti
#t1995
#cMathematical Structures in Computer Science
#index1014629
#% 
#!
  
#*The Expressive Power Of Urgent, Lazy And Busy-Waiting Actions In Timed Processes.
#@Flavio Corradini,Dino Di Cola
#t2003
#cMathematical Structures in Computer Science
#index1014630
#%39991
#%114527
#%114649
#%740400
#%887523
#%888214
#%889007
#%1090291
#%1091577
#%1094179
#!
  
#*Interaction Systems I: The Theory of Optimal Reductions.
#@Andrea Asperti,Cosimo Laneve
#t1994
#cMathematical Structures in Computer Science
#index1014631
#% 
#!
  
#*Proof Nets And Explicit Substitutions.
#@Roberto Di Cosmo,Delia Kesner,Emmanuel Polonowski
#t2003
#cMathematical Structures in Computer Science
#index1014632
#%126977
#%484584
#%546235
#%546376
#%628729
#%1014658
#%1091506
#!
  
#*Non-Strict Don't Care Algebras and Specifications.
#@Egidio Astesiano,Maura Cerioli
#t1996
#cMathematical Structures in Computer Science
#index1014633
#% 
#!
  
#*Recognizable Sets of Graphs: Equivalent Definitions and Closure Properties.
#@Bruno Courcelle
#t1994
#cMathematical Structures in Computer Science
#index1014634
#% 
#!
  
#*D-oids: A Model for Dynamic Data-Types.
#@Egidio Astesiano,Elena Zucca
#t1995
#cMathematical Structures in Computer Science
#index1014635
#% 
#!
  
#*Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width.
#@Bruno Courcelle,Jens Lagergren
#t1996
#cMathematical Structures in Computer Science
#index1014636
#% 
#!
  
#*A Note on the Structure of Bilattices.
#@Arnon Avron
#t1995
#cMathematical Structures in Computer Science
#index1014637
#% 
#!
  
#*Fusion in Relational Structures and the Verification of Monadic Second-Order Properties.
#@Bruno Courcelle,Johann A. Makowsky
#t2002
#cMathematical Structures in Computer Science
#index1014638
#%722
#%70773
#%228672
#%228655
#%228746
#%481148
#%836522
#%887543
#%952621
#%971764
#%1090210
#%1090212
#%1090228
#!
  
#*The Structure of Interlaced Bilattices.
#@Arnon Avron
#t1996
#cMathematical Structures in Computer Science
#index1014639
#% 
#!
  
#*Relating operational and denotational semantics for input/output effects.
#@Roy L. Crole,Andrew D. Gordon
#t1999
#cMathematical Structures in Computer Science
#index1014640
#% 
#!
  
#*Topological representation of the lambda-calculus.
#@Steven Awodey
#t2000
#cMathematical Structures in Computer Science
#index1014641
#%628900
#!
  
#*Normalization and the Yoneda Embedding.
#@Djordje Cubric,Peter Dybjer,Philip J. Scott
#t1998
#cMathematical Structures in Computer Science
#index1014642
#%713
#%124407
#%126786
#%631846
#%1014622
#!
  
#*Local Realizability Toposes and a Modal Logic for Computability.
#@Steven Awodey,Lars Birkedal,Dana S. Scott
#t2002
#cMathematical Structures in Computer Science
#index1014643
#% 
#!
  
#*Preface to Locus Solum.
#@Pierre-Louis Curien
#t2001
#cMathematical Structures in Computer Science
#index1014644
#% 
#!
  
#*Modal Operators and the Formal Dual of Birkhoff's Completeness Theorem.
#@Steven Awodey,Jesse Hughes
#t2003
#cMathematical Structures in Computer Science
#index1014645
#%40086
#%651608
#%1091538
#%1091616
#%1091624
#%1094281
#%1094318
#%3004643
#!
  
#*Abstract Böhm trees.
#@Pierre-Louis Curien
#t1998
#cMathematical Structures in Computer Science
#index1014646
#% 
#!
  
#*Demonic Operators and Monotype Factors.
#@Roland Carl Backhouse,Jaap van der Woude
#t1993
#cMathematical Structures in Computer Science
#index1014647
#% 
#!
  
#*Coherence of Subsumption, Minimum Typing and Type-Checking in F.
#@Pierre-Louis Curien,Giorgio Ghelli
#t1992
#cMathematical Structures in Computer Science
#index1014648
#% 
#!
  
#*A Categorical Approach to Database Semantics.
#@Kenneth Baclawski,Dan A. Simovici,William White
#t1994
#cMathematical Structures in Computer Science
#index1014649
#% 
#!
  
#*A Conjunctive Type System for Useless-Code Elimination.
#@Ferruccio Damiani
#t2003
#cMathematical Structures in Computer Science
#index1014650
#%309873
#%309970
#%538197
#%538227
#%545891
#%546047
#%546276
#%546172
#%546834
#%546447
#%572617
#%626729
#%628785
#%628783
#%631920
#%832884
#%889575
#%980801
#%1056846
#%1089088
#%1090259
#!
  
#*Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination.
#@Jos C. M. Baeten
#t2003
#cMathematical Structures in Computer Science
#index1014651
#%2597
#%39860
#%66614
#%79551
#%79700
#%114127
#%114213
#%114294
#%114339
#%114527
#%114529
#%188725
#%212892
#%213011
#%213044
#%213211
#%213209
#%213305
#%213319
#%221065
#%267353
#%267552
#%559551
#%627565
#%740936
#%818612
#%886924
#%886918
#%887523
#%888214
#%889007
#%931201
#%949550
#%950446
#%1056638
#%1088722
#%1094179
#%1095111
#!
  
#*A filter model for mobile processes.
#@Ferruccio Damiani,Mariangiola Dezani-Ciancaglini,Paola Giannini
#t1999
#cMathematical Structures in Computer Science
#index1014652
#%114025
#%124536
#%220983
#%268220
#%269020
#%886910
#%887267
#%887303
#%888211
#%888914
#%1058872
#%1093508
#%3005514
#!
  
#*Foreword.
#@Jean Paul Bahsoun,José Luiz Fiadeiro,Didier Galmiche
#t1999
#cMathematical Structures in Computer Science
#index1014653
#% 
#!
  
#*Stratified polymorphism and primitive recursion.
#@Norman Danner,Daniel Leivant
#t1999
#cMathematical Structures in Computer Science
#index1014654
#%484222
#%553008
#%888687
#%950869
#!
  
#*Domain equations for probabilistic processes.
#@Christel Baier,Marta Z. Kwiatkowska
#t2000
#cMathematical Structures in Computer Science
#index1014655
#%2597
#%114240
#%114602
#%114661
#%221164
#%267578
#%484482
#%484848
#%484845
#%494059
#%554940
#%559589
#%888024
#%888651
#%950037
#%1089076
#%1089078
#%3005514
#!
  
#*Representing Control: A Study of the CPS Transformation.
#@Olivier Danvy,Andrzej Filinski
#t1992
#cMathematical Structures in Computer Science
#index1014656
#% 
#!
  
#*Compositional semantics for open Petri nets based on deterministic processe.
#@Paolo Baldan,Andrea Corradini,Hartmut Ehrig,Reiko Heckel
#t2005
#cMathematical Structures in Computer Science
#index1014657
#% 
#!
  
#*A lambda-calculus with explicit weakening and explicit substitution.
#@René David,Bruno Guillaume
#t2001
#cMathematical Structures in Computer Science
#index1014658
#%39088
#%484584
#%485095
#%543300
#%628729
#%980950
#%1014767
#!
  
#*Modular Control-Flow Analysis with Rank 2 Intersection Types.
#@Anindya Banerjee,Thomas P. Jensen
#t2003
#cMathematical Structures in Computer Science
#index1014659
#%70752
#%188883
#%214107
#%214205
#%268353
#%268962
#%309873
#%309972
#%309970
#%483935
#%538259
#%538227
#%542544
#%546276
#%546172
#%546349
#%546412
#%546057
#%546354
#%546579
#%546834
#%546447
#%572520
#%572617
#%572815
#%572941
#%572678
#%572774
#%625597
#%628129
#%631920
#%889083
#%889575
#%889799
#%889653
#%980744
#%981048
#%981083
#%1014794
#%1056846
#%1089088
#%1123266
#%1123642
#%1123805
#%1123927
#!
  
#*A specification logic for concurrent object-oriented programming.
#@Giorgio Delzanno,Didier Galmiche,Maurizio Martelli
#t1999
#cMathematical Structures in Computer Science
#index1014660
#%2122
#%40081
#%180599
#%483979
#%485014
#%485065
#%487015
#%520625
#%522531
#%522779
#%522899
#%629696
#%772826
#%833078
#%888247
#%984203
#%984611
#%1025535
#%1088696
#%1091506
#%1091362
#%1093503
#%1123443
#%3003065
#%3005774
#%3005872
#!
  
#*Uniqueness Typing for Functional Languages with Graph Rewriting Semantics.
#@Erik Barendsen,Sjaak Smetsers
#t1996
#cMathematical Structures in Computer Science
#index1014661
#% 
#!
  
#*Recursion over objects of functional type.
#@Joëlle Despeyroux,Pierre Leleu
#t2001
#cMathematical Structures in Computer Science
#index1014662
#%71877
#%267679
#%485014
#%484804
#%487089
#%546065
#%546485
#%628743
#%628855
#%628853
#%628864
#%950598
#!
  
#**-Autonomous Categories and Linear Logic.
#@Michael Barr
#t1991
#cMathematical Structures in Computer Science
#index1014663
#% 
#!
  
#*Category-based constraint logic.
#@Razvan Diaconescu
#t2000
#cMathematical Structures in Computer Science
#index1014664
#%17335
#%40045
#%109621
#%203991
#%390757
#%485085
#%546346
#%887054
#%950459
#%1094885
#!
  
#*Appendix: Separability of Tensor in Chu Categories of Cector Spaces.
#@Michael Barr
#t1996
#cMathematical Structures in Computer Science
#index1014665
#% 
#!
  
#*Completeness of Category-Based Equational Deduction.
#@Razvan Diaconescu
#t1995
#cMathematical Structures in Computer Science
#index1014666
#% 
#!
  
#*Fuzzy Models of Linear Logic.
#@Michael Barr
#t1996
#cMathematical Structures in Computer Science
#index1014667
#% 
#!
  
#*Semi-pullbacks for stochastic relations over analytic spaces.
#@Ernst-Erich Doberkat
#t2005
#cMathematical Structures in Computer Science
#index1014668
#%887611
#%930854
#%1014692
#!
  
#*Introduction.
#@Michael Barr,Philip J. Scott,R. A. G. Seely
#t2000
#cMathematical Structures in Computer Science
#index1014669
#% 
#!
  
#*Isomorphic Objects in Symmetric Monoidal Closed Categories.
#@Kosta Dosen,Zoran Petric
#t1997
#cMathematical Structures in Computer Science
#index1014670
#%487348
#!
  
#*Generalised Coinduction.
#@Falk Bartels
#t2003
#cMathematical Structures in Computer Science
#index1014671
#%114581
#%126785
#%485186
#%949783
#%1025757
#%1093596
#%1094318
#!
  
#*Reductions, Intersection Types, and Explicit Substitutions.
#@Daniel J. Dougherty,Pierre Lescanne
#t2003
#cMathematical Structures in Computer Science
#index1014672
#%126890
#%267785
#%268962
#%484584
#%543160
#%543300
#%628729
#%771258
#%950090
#%980950
#%1014709
#%1089088
#%1089459
#%1092961
#%3006100
#!
  
#*Type-based termination of recursive definitions.
#@Gilles Barthe,Maria João Frade,E. Giménez,Luis Pinto,Tarmo Uustalu
#t2004
#cMathematical Structures in Computer Science
#index1014673
#%40267
#%108571
#%124288
#%124680
#%213671
#%268089
#%309963
#%310136
#%485271
#%494991
#%542403
#%546406
#%546334
#%546485
#%628864
#%631797
#%832351
#%980730
#%1006732
#%1089446
#%1092399
#%1093303
#%1095019
#!
  
#*Collections, sets and types.
#@Gilles Dowek
#t1999
#cMathematical Structures in Computer Science
#index1014674
#%1129168
#%3004240
#!
  
#*Minimality of the correctness criterion for multiplicative proof nets.
#@Denis Béchet
#t1998
#cMathematical Structures in Computer Science
#index1014675
#%546368
#%1091506
#!
  
#*HOL-[lambda][sigma]: an intentional first-order expression of higher-order logic.
#@Gilles Dowek,Thérèse Hardin,Claude Kirchner
#t2001
#cMathematical Structures in Computer Science
#index1014676
#%39026
#%390757
#%484267
#%628729
#%887726
#%950090
#%951311
#%951465
#%1059678
#%3004240
#!
  
#*Subnets of Proof-Nets in Multiplicative Linear Logic with MIX.
#@Gianluigi Bellin
#t1997
#cMathematical Structures in Computer Science
#index1014677
#% 
#!
  
#*Universal Domains and the Amalgamation Property.
#@Manfred Droste,Rüdiger Göbel
#t1993
#cMathematical Structures in Computer Science
#index1014678
#% 
#!
  
#*Classical logic as limit completion.
#@Stefano Berardi
#t2005
#cMathematical Structures in Computer Science
#index1014679
#%998688
#!
  
#*Recognizable languages in divisibility monoids.
#@Manfred Droste,Dietrich Kuske
#t2001
#cMathematical Structures in Computer Science
#index1014680
#%70755
#%79459
#%267369
#%268671
#%268829
#%889318
#%1089645
#%1090698
#%1091781
#%1092523
#%1094734
#!
  
#*An Application of PER Models to Program Extraction.
#@Stefano Berardi
#t1993
#cMathematical Structures in Computer Science
#index1014681
#% 
#!
  
#*Proof-theoretic foundations for the design of actor systems.
#@Carlos H. C. Duarte
#t1999
#cMathematical Structures in Computer Science
#index1014682
#%700
#%78959
#%362512
#%544180
#%546502
#%625673
#%628992
#%950459
#%980736
#%1056730
#%1077766
#%1124317
#!
  
#*BetaEta-Complete Models for System F.
#@Stefano Berardi,Chantal Berline
#t2002
#cMathematical Structures in Computer Science
#index1014683
#% 
#!
  
#*Diagrammatic Specifications.
#@Dominique Duval
#t2003
#cMathematical Structures in Computer Science
#index1014684
#%651629
#%950459
#%1095209
#%3004643
#!
  
#*Computability and Totality in Domains.
#@Ulrich Berger
#t2002
#cMathematical Structures in Computer Science
#index1014685
#%511760
#%1090933
#%1094772
#!
  
#*Sketches and Computation - I: Basic Definitions and Static Evaluation.
#@Dominique Duval,Jean-Claude Reynaud
#t1994
#cMathematical Structures in Computer Science
#index1014686
#% 
#!
  
#*Algorithms for Categorical Equivalence.
#@Clifford Bergman,Joel Berman
#t1998
#cMathematical Structures in Computer Science
#index1014687
#% 
#!
  
#*Sketches and Computation - II: Dynamic Evaluation and Applications.
#@Dominique Duval,Jean-Claude Reynaud
#t1994
#cMathematical Structures in Computer Science
#index1014688
#% 
#!
  
#*Extending partial combinatory algebras.
#@Inge Bethke,Jan Willem Klop,Roel C. de Vrijer
#t1999
#cMathematical Structures in Computer Science
#index1014689
#%252246
#%480970
#%480979
#%484455
#%3004973
#!
  
#*When Scott is Weak on the Top.
#@Abbas Edalat
#t1997
#cMathematical Structures in Computer Science
#index1014690
#%484615
#%484613
#%484845
#%887707
#%887709
#%1014862
#%1090757
#%1090759
#!
  
#*Categorical models for Abadi and Plotkin's logic for parametricity.
#@Lars Birkedal,Rasmus Ejlers Møgelberg
#t2005
#cMathematical Structures in Computer Science
#index1014691
#%126803
#%214224
#%484607
#%485110
#%495072
#%628879
#%882467
#%1094309
#!
  
#*Semi-pullbacks and bisimulation in categories of Markov processes.
#@Abbas Edalat
#t1999
#cMathematical Structures in Computer Science
#index1014692
#%484482
#%484638
#%888651
#!
  
#*Definitions by rewriting in the Calculus of Constructions.
#@Frédéric Blanqui
#t2005
#cMathematical Structures in Computer Science
#index1014693
#%214094
#%3004973
#%126943
#%980782
#%267307
#%252243
#%124265
#%124267
#%39019
#%563204
#%484471
#%1089446
#%1094879
#%889592
#%887517
#%126990
#%1014676
#%631910
#%268089
#%309961
#%1092399
#%484851
#%980964
#%191753
#%933042
#%951311
#%483982
#%933652
#%613026
#%546786
#%934151
#%252264
#%628880
#%981036
#%994816
#!
  
#*Introduction to special issue on domain theory.
#@Abbas Edalat,Achim Jung
#t2004
#cMathematical Structures in Computer Science
#index1014694
#% 
#!
  
#*Pure type systems with explicit substitution.
#@Roel Bloo
#t2001
#cMathematical Structures in Computer Science
#index1014695
#%124770
#%126977
#%484584
#%631778
#%887264
#%1089459
#!
  
#*Domain theory and differential calculus (functions of one variable).
#@Abbas Edalat,André Lieutier
#t2004
#cMathematical Structures in Computer Science
#index1014696
#%484613
#%834480
#%887707
#%1014862
#%1090757
#%1090933
#%1090761
#%1090759
#%1090765
#!
  
#*Equational Axioms for Regular Sets.
#@Stephen L. Bloom,Zoltán Ésik
#t1993
#cMathematical Structures in Computer Science
#index1014697
#% 
#!
  
#*String and Graph Reduction Systems for Gene Assembly in Ciliates.
#@Andrzej Ehrenfeucht,Ion Petre,David M. Prescott,Grzegorz Rozenberg
#t2002
#cMathematical Structures in Computer Science
#index1014698
#%3296031
#!
  
#*Varieties Generated by Languages with Poset Operations.
#@Stephen L. Bloom,Zoltán Ésik
#t1997
#cMathematical Structures in Computer Science
#index1014699
#%481160
#%626377
#%886926
#%1089465
#%1091513
#%3307402
#!
  
#*Invariants of Inversive 2-Structures on Groups of Labels.
#@Andrzej Ehrenfeucht,Tero Harju,Grzegorz Rozenberg
#t1997
#cMathematical Structures in Computer Science
#index1014700
#% 
#!
  
#*Hopf Algebras and Linear Logic.
#@Richard Blute
#t1996
#cMathematical Structures in Computer Science
#index1014701
#% 
#!
  
#*Dynamic Labeled 2-Structures.
#@Andrzej Ehrenfeucht,Grzegorz Rozenberg
#t1994
#cMathematical Structures in Computer Science
#index1014702
#% 
#!
  
#*The Logic of Linear Functors.
#@Richard Blute,J. Robin B. Cockett,R. A. G. Seely
#t2002
#cMathematical Structures in Computer Science
#index1014703
#%628889
#%950643
#%1014612
#%1014903
#%1089484
#%1091506
#!
  
#*Finiteness spaces.
#@Thomas Ehrhard
#t2005
#cMathematical Structures in Computer Science
#index1014704
#%124488
#%484596
#%628797
#%1090870
#%1091506
#%1091761
#!
  
#*! and ? - Storage as Tensorial Strength.
#@Richard Blute,J. Robin B. Cockett,R. A. G. Seely
#t1996
#cMathematical Structures in Computer Science
#index1014705
#% 
#!
  
#*On Köthe Sequence Spaces and Linear Logic.
#@Thomas Ehrhard
#t2002
#cMathematical Structures in Computer Science
#index1014706
#% 
#!
  
#*Universal Homogeneous Graph-Like Structures And Domains.
#@Paolo Boldi,Felice Cardone,Manfred Droste
#t2002
#cMathematical Structures in Computer Science
#index1014707
#%267369
#%269020
#%887413
#%887736
#%888110
#%1091506
#%3004668
#!
  
#*Hypercoherences: A Strongly Stable Model of Linear Logic.
#@Thomas Ehrhard
#t1993
#cMathematical Structures in Computer Science
#index1014708
#% 
#!
  
#*Perpetuality in a named lambda calculus with explicit substitutions.
#@Eduardo Bonelli
#t2001
#cMathematical Structures in Computer Science
#index1014709
#%39088
#%70833
#%126977
#%484025
#%485095
#%543300
#%553008
#%628729
#%631778
#%888505
#%1089459
#!
  
#*Foreword.
#@Thomas Ehrhard,Yves Lafont,Laurent Regnier
#t1998
#cMathematical Structures in Computer Science
#index1014710
#% 
#!
  
#*On bisimulations for the spi calculus.
#@Johannes Borgström,Uwe Nestmann
#t2005
#cMathematical Structures in Computer Science
#index1014711
#%188705
#%213745
#%268698
#%484492
#%545901
#%627565
#%888914
#%1025530
#%1058684
#%1093508
#!
  
#*Wheels - on division by zero.
#@Jesper Carlström
#t2004
#cMathematical Structures in Computer Science
#index1014712
#% 
#!
  
#*Categorical Properties of Logical Frameworks.
#@Yuxi Fu
#t1997
#cMathematical Structures in Computer Science
#index1014713
#%126803
#%126851
#%126881
#%950598
#%3004643
#!
  
#*On permuting cut with contraction.
#@Mirjana Borisavljevic,Kosta Dosen,Zoran Petric
#t2000
#cMathematical Structures in Computer Science
#index1014714
#%1090739
#%1091510
#!
  
#*Parallelism and Concurrency in High-Level Replacement Systems.
#@Hartmut Ehrig,Annegret Habel,Hans-Jörg Kreowski,Francesco Parisi-Presicce
#t1991
#cMathematical Structures in Computer Science
#index1014715
#% 
#!
  
#*A semantics for lambda calculi with resources.
#@Gérard Boudol,Pierre-Louis Curien,Carolina Lavatelli
#t1999
#cMathematical Structures in Computer Science
#index1014716
#%70716
#%269020
#%625646
#%886910
#%887303
#%888913
#%889332
#%1058872
#%3006100
#!
  
#*On the non-sequential nature of the interval-domain model of real-number computation.
#@Martín Hötzel Escardó,Martin Hofmann,Thomas Streicher
#t2004
#cMathematical Structures in Computer Science
#index1014717
#%1090935
#%1090933
#!
  
#*Modelling general recursion in type theory.
#@Ana Bove,Venanzio Capretta
#t2005
#cMathematical Structures in Computer Science
#index1014718
#%630
#%108571
#%487393
#%494991
#%629314
#%629632
#%768249
#%887517
#%954731
#%981022
#%1014673
#%1025606
#%3005873
#!
  
#*Unique factorisation lifting functors and categories of linearly-controlled processes.
#@Marta Bunge,Marcelo P. Fiore
#t2000
#cMathematical Structures in Computer Science
#index1014719
#%114561
#%3005514
#%124379
#!
  
#*Obsessional Experiments For Linear Logic Proof-Nets.
#@Lorenzo Tortora de Falco
#t2003
#cMathematical Structures in Computer Science
#index1014720
#%477330
#%887629
#%887982
#%980805
#%1014892
#%1091038
#%1091506
#!
  
#*Constructive Theory of the Lower Power Locale.
#@M. Bunge,J. Funk
#t1996
#cMathematical Structures in Computer Science
#index1014721
#% 
#!
  
#*Temporal Structures.
#@Ross Casley,Roger F. Crew,José Meseguer,Vaughan R. Pratt
#t1991
#cMathematical Structures in Computer Science
#index1014722
#% 
#!
  
#*Program Specification and Data Refinement in Type Theory.
#@Zhaohui Luo
#t1993
#cMathematical Structures in Computer Science
#index1014723
#% 
#!
  
#*Pushout Complements for Partly Total Algebras.
#@Peter Burmeister,Mercè Llabrés,Francesc Rosselló
#t2002
#cMathematical Structures in Computer Science
#index1014724
#%625755
#%882530
#%1089815
#!
  
#*Special issue: Modalities in type theory.
#@Matt Fairtlough,Michael Mendler,Eugenio Moggi
#t2001
#cMathematical Structures in Computer Science
#index1014725
#%216530
#%484334
#%546065
#%888930
#%1014662
#%1014794
#!
  
#*Abstract hierarchical graph transformation.
#@Giorgio Busatto,Hans-Jörg Kreowski,Sabine Kuske
#t2005
#cMathematical Structures in Computer Science
#index1014726
#%195
#%2619
#%228637
#%228627
#%228635
#%228729
#%228842
#%228776
#%228816
#%493709
#%625752
#%625718
#%625744
#%625732
#%625719
#%772610
#%971831
#%972744
#%1014780
#%1056546
#%1120085
#%1120307
#!
  
#*Loops, ditopology and deadlocks.
#@Lisbeth Fajstrup
#t2000
#cMathematical Structures in Computer Science
#index1014727
#%114198
#%546652
#!
  
#*A general method for proving the normalization theorem for first and second order typed lambda-calculi.
#@Venanzio Capretta,Silvio Valentini
#t1999
#cMathematical Structures in Computer Science
#index1014728
#%546522
#%1056733
#%3006100
#!
  
#*A New Approach to Abstract Data Types, I: Informal Development.
#@Solomon Feferman
#t1992
#cMathematical Structures in Computer Science
#index1014729
#% 
#!
  
#*Connected Limits, Familial Representability and Artin Glueing.
#@Aurelio Carboni,Peter Johnstone
#t1995
#cMathematical Structures in Computer Science
#index1014730
#% 
#!
  
#*Type assignment and termination of interaction nets.
#@Maribel Fernández
#t1998
#cMathematical Structures in Computer Science
#index1014731
#%114297
#%124362
#%126941
#%268962
#%543179
#%546235
#%546368
#%628763
#%629711
#%887081
#%888636
#%951454
#%1089089
#%1091027
#!
  
#*Coordination and mobility in CoreLime.
#@Bogdan Carbunar,Marco Tulio de Oliveira Valente,Jan Vitek
#t2004
#cMathematical Structures in Computer Science
#index1014732
#%213642
#%246319
#%362833
#%488568
#%546201
#%568137
#%866883
#%1089823
#%1117466
#%1123526
#%1129100
#%3260946
#!
  
#*Closed reduction: explicit substitutions without alpha-conversion.
#@Maribel Fernández,Ian Mackie,François-Régis Sinot
#t2005
#cMathematical Structures in Computer Science
#index1014733
#%485095
#%628729
#%951465
#%980886
#%1014676
#%1014658
#%1088696
#%1089837
#!
  
#*TQL: a query language for semistructured data based on the ambient logic.
#@Luca Cardelli,Giorgio Ghelli
#t2004
#cMathematical Structures in Computer Science
#index1014734
#%71
#%494
#%2296
#%3350
#%62592
#%65703
#%145134
#%213642
#%267556
#%300832
#%309989
#%384718
#%544779
#%545018
#%545193
#%545887
#%598236
#%598412
#%598618
#%598588
#%628127
#%628947
#%654516
#%654514
#%654480
#%654582
#%654448
#%673856
#%674027
#%793590
#%793979
#%793870
#%866883
#!
  
#*Extracting information from intermediate semiconstructive HA-systems - extended abstract.
#@Mauro Ferrari,Camillo Fiorentini,Pierangelo Miglioli
#t2001
#cMathematical Structures in Computer Science
#index1014735
#% 
#!
  
#*Operations on Records.
#@Luca Cardelli,John C. Mitchell
#t1991
#cMathematical Structures in Computer Science
#index1014736
#% 
#!
  
#*Extensions of valuations.
#@Jean Goubault-Larrecq
#t2005
#cMathematical Structures in Computer Science
#index1014737
#%213760
#%484613
#%1090757
#!
  
#*Profunctors, open maps and bisimulation.
#@Gian Luca Cattani,Glynn Winskel
#t2005
#cMathematical Structures in Computer Science
#index1014738
#%114281
#%114635
#%126824
#%267199
#%484532
#%484675
#%485019
#%493658
#%627565
#%888211
#%1089956
#%1091506
#%1093807
#%3005514
#%124379
#!
  
#*Quantum programming languages: survey and bibliography.
#@Simon J. Gay
#t2006
#cMathematical Structures in Computer Science
#index1014739
#%484391
#%484395
#%825287
#%484450
#%1015006
#%621545
#%1058599
#%1014976
#%546218
#%1014977
#%622193
#%85532
#%3580706
#%1014993
#%889910
#%3580702
#%507823
#%1014917
#%1014991
#%808239
#%85423
#%819637
#%822153
#%741621
#!
  
#*Action Semantics Reasoning about Functional Programs.
#@Søren B. Lassen
#t1997
#cMathematical Structures in Computer Science
#index1014740
#%81420
#%81408
#%484811
#%485085
#%494226
#%495035
#%888930
#!
  
#*Re-Grouping Information in a Domain-Theoretic Data Model.
#@Hermann Puhlmann
#t1998
#cMathematical Structures in Computer Science
#index1014741
#%494414
#%545179
#%1089795
#!
  
#*Preface.
#@Mariangiola Dezani-Ciancaglini,Giuseppe Longo,Jonathan P. Seldin
#t1999
#cMathematical Structures in Computer Science
#index1014742
#% 
#!
  
#*Structured Transition Systems with Parametric Observations: Observational Congruences and Minimal Realizations.
#@Gian Luigi Ferrari,Ugo Montanari,Miranda Mowbray
#t1997
#cMathematical Structures in Computer Science
#index1014743
#%2597
#%3498
#%45541
#%70787
#%114018
#%114111
#%114324
#%126785
#%267760
#%484624
#%493562
#%493658
#%559560
#%559591
#%559533
#%627565
#%740732
#%773279
#%882210
#%882212
#%887061
#%886961
#%887172
#%888090
#%888913
#%949550
#%949783
#%949907
#%950643
#%971664
#%971796
#%1089370
#%1089609
#%1089610
#%1090423
#%1091513
#%1093283
#%1094734
#%3005514
#%3307402
#!
  
#*MetaKlaim: a type safe multi-stage language for global computing.
#@Gian Luigi Ferrari,Eugenio Moggi,Rosario Pugliese
#t2004
#cMathematical Structures in Computer Science
#index1014744
#%114231
#%363052
#%484608
#%538255
#%542674
#%545886
#%546232
#%546746
#%546696
#%546756
#%553008
#%628130
#%628140
#%770503
#%889575
#%889799
#%889849
#%1093743
#%1094226
#%1094839
#%1103570
#%1123226
#%1123448
#%1123526
#%1123395
#%1128143
#%1129100
#%3004578
#%3169035
#%3260946
#!
  
#*Mirror, Mirror in my Hand: A Duality between Specifications and Models of Process Behaviour.
#@José Luiz Fiadeiro,José Félix Costa
#t1996
#cMathematical Structures in Computer Science
#index1014745
#% 
#!
  
#*Colimits in the Category DCPO.
#@Adrian Fiech
#t1996
#cMathematical Structures in Computer Science
#index1014746
#% 
#!
  
#*Order-Enrichment for Categories of Partial Maps.
#@Marcelo P. Fiore
#t1995
#cMathematical Structures in Computer Science
#index1014747
#% 
#!
  
#*An Enrichment Theorem for an Axiomatisation of Categories of Domains and Continuous Functions.
#@Marcelo P. Fiore
#t1997
#cMathematical Structures in Computer Science
#index1014748
#%124295
#%126848
#%887579
#%888930
#!
  
#*First order in Ludics.
#@Marie-Renée Fleury,Myriam Quatrini
#t2004
#cMathematical Structures in Computer Science
#index1014749
#%124488
#%886908
#%888303
#!
  
#*The Mix Rule.
#@Arnaud Fleury,Christian Retoré
#t1994
#cMathematical Structures in Computer Science
#index1014750
#% 
#!
  
#*Datatype Laws without Signatures.
#@Maarten M. Fokkinga
#t1996
#cMathematical Structures in Computer Science
#index1014751
#% 
#!
  
#*An Axiomatization of Partial n-Place Operations.
#@Marco Forti,Furio Honsell,Marina Lenisa
#t1997
#cMathematical Structures in Computer Science
#index1014752
#% 
#!
  
#*A Proof-Irrelevant Model of Martin-Löf's Logical Framework.
#@Daniel Fridlender
#t2002
#cMathematical Structures in Computer Science
#index1014753
#% 
#!
  
#*Equivalences between Logics and Their Representing Type Theories.
#@Philippa Gardner
#t1995
#cMathematical Structures in Computer Science
#index1014754
#% 
#!
  
#*A simple process algebra based on atomic actions with resources.
#@Paul Gastin,Michael W. Mislove
#t2004
#cMathematical Structures in Computer Science
#index1014755
#%3498
#%45541
#%116300
#%219841
#%267760
#%269258
#%559560
#%887305
#%1089609
#%1090626
#%1091423
#%1091420
#%1093520
#%3307402
#!
  
#*Two-dimensional proof-structures and the exchange rule.
#@Christophe Gaubert
#t2004
#cMathematical Structures in Computer Science
#index1014756
#%1014801
#%1091506
#!
  
#*Homotopy invariants of higher dimensional categories and concurrency in computer science.
#@Philippe Gaucher
#t2000
#cMathematical Structures in Computer Science
#index1014757
#%114198
#%79460
#%544063
#%622290
#%546652
#!
  
#*Some logical and syntactical observations concerning the first-order dependent type system lambda-P.
#@Herman Geuvers,Erik Barendsen
#t1999
#cMathematical Structures in Computer Science
#index1014758
#%191724
#%628861
#%631910
#%887517
#%950598
#!
  
#*Monads of coalgebras: rational terms and term graphs.
#@Neil Ghani,Christoph Lüth,Federico De Marchi
#t2005
#cMathematical Structures in Computer Science
#index1014759
#%126830
#%126887
#%484680
#%1014611
#%1093596
#!
  
#*Dualising Initial Algebras.
#@Neil Ghani,Christoph Lüth,Federico De Marchi,John Power
#t2003
#cMathematical Structures in Computer Science
#index1014760
#%126887
#%484680
#%563501
#%931825
#%1089151
#%1094281
#!
  
#*Continuation-Based Compilation of Functional Languages for Parallel Machines.
#@J.-F. Giorgi,Daniel Le Métayer
#t1992
#cMathematical Structures in Computer Science
#index1014761
#% 
#!
  
#*Locus Solum: From the rules of logic to the logic of rules.
#@Jean-Yves Girard
#t2001
#cMathematical Structures in Computer Science
#index1014762
#% 
#!
  
#*A New Constructive Logic: Classical Logic.
#@Jean-Yves Girard
#t1991
#cMathematical Structures in Computer Science
#index1014763
#% 
#!
  
#*A Categorical Manifesto.
#@Joseph A. Goguen
#t1991
#cMathematical Structures in Computer Science
#index1014764
#% 
#!
  
#*Sheaf Semantics for Concurrent Interacting Objects.
#@Joseph A. Goguen
#t1992
#cMathematical Structures in Computer Science
#index1014765
#% 
#!
  
#*An Oxford Survey of Order Sorted Algebra.
#@Joseph A. Goguen,Razvan Diaconescu
#t1994
#cMathematical Structures in Computer Science
#index1014766
#% 
#!
  
#*Sequent combinators: a Hilbert system for the lambda calculus.
#@Healfdene Goguen,Jean Goubault-Larrecq
#t2000
#cMathematical Structures in Computer Science
#index1014767
#%484192
#%484337
#%546235
#%546376
#%600902
#%628729
#%628760
#%631811
#%980950
#%993729
#%1090632
#%1095273
#%1123664
#%3006954
#!
  
#*Hidden coinduction: behavioural correctness proofs for objects.
#@Joseph A. Goguen,Grant Malcolm
#t1999
#cMathematical Structures in Computer Science
#index1014768
#%39095
#%40086
#%109660
#%109621
#%114629
#%126785
#%126856
#%137588
#%157299
#%268096
#%359849
#%471514
#%485186
#%543206
#%543224
#%559591
#%651604
#%741384
#%950459
#%1056524
#%1056982
#%1071463
#%1089151
#%1091536
#%1093509
#!
  
#*A comonadic account of behavioural covarieties of coalgebras.
#@Robert Goldblatt
#t2005
#cMathematical Structures in Computer Science
#index1014769
#%40086
#%126785
#%137588
#%268223
#%627565
#%740938
#%950643
#%1014615
#%1014645
#%1089151
#%1091538
#%1091624
#%1092365
#%1092818
#%1092899
#%1093508
#%1094281
#%1094318
#%3005514
#!
  
#*Equational Properties Of Mobile Ambients.
#@Andrew D. Gordon,Luca Cardelli
#t2003
#cMathematical Structures in Computer Science
#index1014770
#%484365
#%545887
#%546201
#%546450
#%546516
#%546723
#%1089332
#%1089893
#!
  
#*Impredicativity entails Untypedness.
#@Peter Lietz,Thomas Streicher
#t2002
#cMathematical Structures in Computer Science
#index1014771
#%124729
#%628798
#!
  
#*Foreword.
#@Eric Goubault
#t2000
#cMathematical Structures in Computer Science
#index1014772
#% 
#!
  
#*Encoding Left Reduction in the Lambda-Calculus with Interaction Nets.
#@Sylvain Lippi
#t2002
#cMathematical Structures in Computer Science
#index1014773
#%546235
#%546368
#%546376
#%888636
#%1091506
#%3006100
#!
  
#*Geometry and concurrency: a user's guide.
#@Eric Goubault
#t2000
#cMathematical Structures in Computer Science
#index1014774
#%3482
#%39863
#%70836
#%79460
#%79824
#%114328
#%114332
#%114198
#%126816
#%484679
#%484534
#%538221
#%543743
#%543758
#%544063
#%544107
#%544435
#%545446
#%546057
#%546652
#%559557
#%572638
#%622290
#%626529
#%832441
#%949630
#%950295
#%950782
#%951389
#%1094712
#%1094734
#%1123387
#!
  
#*A Uniform Approach to Domain Theory in Realizability Models.
#@John R. Longley,Alex K. Simpson
#t1997
#cMathematical Structures in Computer Science
#index1014775
#%126848
#%126872
#%484679
#%886911
#%886910
#%887579
#%889230
#%889182
#!
  
#*An environment machine for the lambda-mu-calculus.
#@Philippe de Groote
#t1998
#cMathematical Structures in Computer Science
#index1014776
#%487168
#%487301
#%628729
#%950090
#%981156
#%1090978
#%1090983
#!
  
#*Constructive Natural Deduction and its `Omega-Set' Interpretation.
#@Giuseppe Longo,Eugenio Moggi
#t1991
#cMathematical Structures in Computer Science
#index1014777
#% 
#!
  
#*Coalgebras Of Bounded Type.
#@H. Peter Gumm,Tobias Schröder
#t2002
#cMathematical Structures in Computer Science
#index1014778
#%1089151
#%1091624
#%1094318
#!
  
#*Parametric Algebraic Specifications with Gentzen Formulas - from Quasi-Freeness to Free Functor Semantics.
#@Michael Löwe,Uwe Wolter
#t1995
#cMathematical Structures in Computer Science
#index1014779
#% 
#!
  
#*Double-pushout graph transformation revisited.
#@Annegret Habel,Jürgen Müller,Detlef Plump
#t2001
#cMathematical Structures in Computer Science
#index1014780
#%228627
#%228729
#%625743
#%660855
#%881839
#%950730
#%1093110
#%3004973
#!
  
#*Implementing Collection Classes with Monads.
#@Ernest G. Manes
#t1998
#cMathematical Structures in Computer Science
#index1014781
#%546180
#%546776
#%888930
#%1056629
#%1089796
#!
  
#*Term Graph Narrowing.
#@Annegret Habel,Detlef Plump
#t1996
#cMathematical Structures in Computer Science
#index1014782
#% 
#!
  
#*From Petri Nets to Linear Logic.
#@Narciso Martí-Oliet,José Meseguer
#t1991
#cMathematical Structures in Computer Science
#index1014783
#% 
#!
  
#*Unique decomposition categories, Geometry of Interaction and combinatory logic.
#@Esfandiar Haghverdi
#t2000
#cMathematical Structures in Computer Science
#index1014784
#%108573
#%546001
#%546235
#%886906
#%888930
#%1091506
#!
  
#*Fractals and domain theory.
#@Keye Martin
#t2004
#cMathematical Structures in Computer Science
#index1014785
#%887707
#%1014690
#%1090759
#%1093272
#!
  
#*Pontrjagin duality and full completeness for multiplicative linear logic (without Mix).
#@Masahiro Hamano
#t2000
#cMathematical Structures in Computer Science
#index1014786
#%998048
#%1089083
#%1089484
#!
  
#*Pre-Adjunctions in Order Enriched Categories.
#@C. E. Martin,C. A. R. Hoare,Jifeng He
#t1991
#cMathematical Structures in Computer Science
#index1014787
#% 
#!
  
#*From Operational Semantics for Abstract Machines.
#@John Hannan,Dale Miller
#t1992
#cMathematical Structures in Computer Science
#index1014788
#% 
#!
  
#*Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic.
#@Simone Martini
#t1992
#cMathematical Structures in Computer Science
#index1014789
#% 
#!
  
#*Classical linear logic of implications.
#@Masahito Hasegawa
#t2005
#cMathematical Structures in Computer Science
#index1014790
#%44789
#%124293
#%124538
#%208375
#%487301
#%495053
#%546179
#%628797
#%887901
#%888247
#%980897
#%1006676
#%1057066
#%1090978
#%1091506
#%1092170
#!
  
#*Concurrent Computing Machines And Physical Space-Time.
#@Philippe Matherat,Marc-Thierry Jaekel
#t2003
#cMathematical Structures in Computer Science
#index1014791
#%49866
#%55178
#%55289
#%559632
#%559533
#%772826
#%773619
#%776396
#%841332
#!
  
#*Categorical Data Types in Parametric Polymorphism.
#@Ryu Hasegawa
#t1994
#cMathematical Structures in Computer Science
#index1014792
#% 
#!
  
#*Double Categories: A Modular Model of Multiplicative Linear Logic.
#@Paul-André Melliès
#t2002
#cMathematical Structures in Computer Science
#index1014793
#%126835
#%126815
#%484515
#%484406
#%628797
#%1089484
#%1091506
#!
  
#*A Computational Formalization for Partial Evaluation.
#@John Hatcliff,Olivier Danvy
#t1997
#cMathematical Structures in Computer Science
#index1014794
#%189035
#%214142
#%310108
#%310142
#%484141
#%484236
#%484608
#%507694
#%538183
#%538207
#%542561
#%542831
#%543069
#%543252
#%546180
#%546146
#%546065
#%546291
#%546821
#%546776
#%546458
#%572699
#%572836
#%626682
#%887579
#%888930
#%994438
#%1006889
#%1008190
#%1094866
#%1123375
#%1123542
#%3003026
#%3003225
#%3005874
#!
  
#*Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces.
#@Matías Menni,Alex K. Simpson
#t2002
#cMathematical Structures in Computer Science
#index1014795
#%81628
#%484465
#!
  
#*Horizontal and Vertical Structuring of Typed Graph Transformation Systems.
#@Reiko Heckel,Andrea Corradini,Hartmut Ehrig,Michael Löwe
#t1996
#cMathematical Structures in Computer Science
#index1014796
#% 
#!
  
#*On asynchrony in name-passing calculi.
#@Massimo Merro,Davide Sangiorgi
#t2004
#cMathematical Structures in Computer Science
#index1014797
#%512
#%40155
#%66694
#%66758
#%114584
#%114516
#%114655
#%114585
#%116259
#%173056
#%219447
#%220056
#%267194
#%267997
#%268698
#%484494
#%485066
#%494168
#%546201
#%546695
#%552630
#%559558
#%625685
#%625693
#%625588
#%626399
#%740479
#%888883
#%888996
#%888913
#%889333
#%889332
#%1028794
#%1088698
#%1089574
#%1089823
#%1091195
#%1092058
#%1094398
#%1094395
#%1123680
#!
  
#*Concurrency and Loose Semantics of Open Graph Transformation Systems.
#@Reiko Heckel,Mercè Llabrés,Hartmut Ehrig,Fernando Orejas
#t2002
#cMathematical Structures in Computer Science
#index1014798
#%89
#%228672
#%228729
#%625733
#%625713
#!
  
#*On the Semantics of Place/Transition Petri Nets.
#@José Meseguer,Ugo Montanari,Vladimiro Sassone
#t1997
#cMathematical Structures in Computer Science
#index1014799
#% 
#!
  
#*An Event Structure Based Semantics for High-Level Message Sequence Charts.
#@Loïc Hélouët,Claude Jard,Benoît Caillaud
#t2002
#cMathematical Structures in Computer Science
#index1014800
#%3327
#%114577
#%213167
#%625125
#%794859
#%795327
#%1089964
#%1128403
#%3307402
#!
  
#*Implicit exchange in multiplicative proofnets.
#@François Métayer
#t2001
#cMathematical Structures in Computer Science
#index1014801
#%1091506
#!
  
#*Typed behavioural equivalences for processes in the presence of subtyping.
#@Matthew Hennessy,Julian Rathke
#t2004
#cMathematical Structures in Computer Science
#index1014802
#%51372
#%66758
#%79345
#%114231
#%173790
#%267997
#%268698
#%484494
#%484881
#%484837
#%546696
#%572716
#%888213
#%889849
#%951333
#%1129100
#%3005514
#!
  
#*Functions as Processes.
#@Robin Milner
#t1992
#cMathematical Structures in Computer Science
#index1014803
#% 
#!
  
#*Algebraic spans.
#@Maurice Herlihy,Sergio Rajsbaum
#t2000
#cMathematical Structures in Computer Science
#index1014804
#%544067
#%544063
#%544066
#%622290
#%949630
#%950295
#%950654
#%952692
#!
  
#*Statistical properties of simple types.
#@Malgorzata Moczurad,Jerzy Tyszkiewicz,Marek Zaionc
#t2000
#cMathematical Structures in Computer Science
#index1014805
#% 
#!
  
#*Fibrations with Indeterminates: Contextual and Functional Completeness for Polymorphic Lambda Calculi.
#@Claudio Hermida,Bart Jacobs
#t1995
#cMathematical Structures in Computer Science
#index1014806
#% 
#!
  
#*Dynamical systems: stability and simulability.
#@Mathieu Hoyrup
#t2007
#cMathematical Structures in Computer Science
#index1014807
#% 
#!
  
#*Bounded polymorphism in session types.
#@Simon J. Gay
#t2008
#cMathematical Structures in Computer Science
#index1014808
#% 
#!
  
#*A relational model of non-deterministic dataflow.
#@Thomas T. Hildebrandt,Prakash Panangaden,Glynn Winskel
#t2004
#cMathematical Structures in Computer Science
#index1014809
#%108573
#%114603
#%114628
#%126847
#%267929
#%268829
#%310272
#%494950
#%546397
#%553040
#%559579
#%628776
#%888769
#%889087
#%951655
#%3005874
#%124379
#!
  
#*A Cateogry-Theoretic Account of Program Modules.
#@Eugenio Moggi
#t1991
#cMathematical Structures in Computer Science
#index1014810
#% 
#!
  
#*A Theory of Classes: Proofs and Models.
#@Barney P. Hilken,David E. Rydeheard
#t1997
#cMathematical Structures in Computer Science
#index1014811
#%126803
#%126876
#%546822
#%881865
#%3007008
#!
  
#*Categories, Relations and Dynamic Programming.
#@Oege de Moor
#t1994
#cMathematical Structures in Computer Science
#index1014812
#% 
#!
  
#*A Categorical Framework For Finite State Machines.
#@Peter Hines
#t2003
#cMathematical Structures in Computer Science
#index1014813
#%486187
#%1091506
#%3004721
#!
  
#*Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science.
#@Lawrence S. Moss
#t2005
#cMathematical Structures in Computer Science
#index1014814
#% 
#!
  
#*A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes.
#@Yoram Hirshfeld,Mark Jerrum,Faron Moller
#t1996
#cMathematical Structures in Computer Science
#index1014815
#% 
#!
  
#*Exact Flow Analysis.
#@Christian Mossin
#t2003
#cMathematical Structures in Computer Science
#index1014816
#%70803
#%188883
#%214107
#%309873
#%542620
#%546358
#%546349
#%546432
#%546298
#%546579
#%546613
#%572520
#%572815
#%572774
#%626700
#%889575
#%1025718
#%1056865
#%1089089
#%1123807
#%546493
#!
  
#*Sound and Complete Axiomatisations of Call-by-Value Control Operators.
#@Martin Hofmann
#t1995
#cMathematical Structures in Computer Science
#index1014817
#% 
#!
  
#*Dependent types and explicit substitutions: a meta-theoretical development.
#@César Muñoz
#t2001
#cMathematical Structures in Computer Science
#index1014818
#%3533
#%483982
#%484584
#%485095
#%543300
#%563476
#%628729
#%631910
#%887264
#%888449
#%950090
#%950598
#%950730
#%1060687
#!
  
#*Elementary structures in process theory (1): Sets with renaming.
#@Kohei Honda
#t2000
#cMathematical Structures in Computer Science
#index1014819
#%2597
#%108573
#%114655
#%188927
#%268264
#%268698
#%484117
#%484702
#%485051
#%511811
#%546235
#%546368
#%546376
#%546319
#%546321
#%546611
#%625685
#%629711
#%629691
#%888636
#%888913
#%951221
#%1089332
#%1091506
#%1092058
#%3004668
#!
  
#*A Categorical Model for Higher Order Imperative Programming.
#@David A. Naumann
#t1998
#cMathematical Structures in Computer Science
#index1014820
#%269071
#%493232
#%495062
#%552638
#%772830
#%888930
#%932997
#%933095
#%951316
#%1056790
#%1091390
#%1093700
#%3003263
#!
  
#*Coinductive characterizations of applicative structures.
#@Furio Honsell,Marina Lenisa
#t1999
#cMathematical Structures in Computer Science
#index1014821
#%70763
#%126785
#%269157
#%484811
#%559589
#%626593
#%628794
#%628858
#%881702
#%886910
#%888278
#%888824
#%972223
#!
  
#*Continuous Domains as Formal Spaces.
#@Sara Negri
#t2002
#cMathematical Structures in Computer Science
#index1014822
#%631779
#%631862
#%631864
#%1094389
#%1094646
#!
  
#*The Theory of Semi-Functors.
#@Raymond Hoofman
#t1993
#cMathematical Structures in Computer Science
#index1014823
#% 
#!
  
#*Semantical Observations on the Embedding of Intuitionistic Logic into Intuitionistic Linear Logic.
#@Sara Negri
#t1995
#cMathematical Structures in Computer Science
#index1014824
#% 
#!
  
#*A Remark on the Theory of Semi-Functors.
#@Raymond Hoofman,Ieke Moerdijk
#t1995
#cMathematical Structures in Computer Science
#index1014825
#% 
#!
  
#*Proof systems for lattice theory.
#@Sara Negri,Jan von Plato
#t2004
#cMathematical Structures in Computer Science
#index1014826
#% 
#!
  
#*Proof search in Lax Logic.
#@Jacob M. Howe
#t2001
#cMathematical Structures in Computer Science
#index1014827
#%124470
#%124457
#%124546
#%485071
#%624662
#%624636
#%624769
#%887806
#%980810
#%1090739
#!
  
#*A Model for Syntactic Control of Interference.
#@Peter W. O'Hearn
#t1993
#cMathematical Structures in Computer Science
#index1014828
#% 
#!
  
#*Regular Böhm trees.
#@Gérard P. Huet
#t1998
#cMathematical Structures in Computer Science
#index1014829
#% 
#!
  
#*Algebra of Constructsion II: An Algebraic Approach to Martin-Löf Theory and the Calculus of Constructions.
#@Adam Obtulowicz
#t1993
#cMathematical Structures in Computer Science
#index1014830
#% 
#!
  
#*Projections for Polymorphic First-Order Strictness Analysis.
#@John Hughes,John Launchbury
#t1992
#cMathematical Structures in Computer Science
#index1014831
#% 
#!
  
#*Realizability: A Historical Essay.
#@Jaap van Oosten
#t2002
#cMathematical Structures in Computer Science
#index1014832
#%484465
#%485157
#%495012
#%628798
#!
  
#*Linear types and approximation.
#@Michael Huth,Achim Jung,Klaus Keimel
#t2000
#cMathematical Structures in Computer Science
#index1014833
#%124295
#%124541
#%495054
#%559632
#%628797
#%628779
#%888296
#%1091506
#!
  
#*Algebraic Implementation of Abstract Data Types: A Survey of Concepts and New Compositionality Results.
#@Fernando Orejas,Marisa Navarro,Ana Sánchez
#t1996
#cMathematical Structures in Computer Science
#index1014834
#% 
#!
  
#*A domain equation for refinement of partial systems.
#@Michael Huth,Radha Jagadeesan,David A. Schmidt
#t2004
#cMathematical Structures in Computer Science
#index1014835
#%2597
#%70790
#%188877
#%362270
#%486435
#%522910
#%528115
#%546168
#%546227
#%546383
#%546057
#%546716
#%601190
#%625096
#%627565
#%646821
#%889723
#%950643
#%951298
#%1091628
#%1092899
#%1123402
#%1128403
#%1129138
#%3005514
#!
  
#*Algebraic High-Level Net Transformation Systems.
#@Julia Padberg,Hartmut Ehrig,Leila Ribeiro
#t1995
#cMathematical Structures in Computer Science
#index1014836
#% 
#!
  
#*Variations on Realizability: Realizing the Propositional Axiom of Choice.
#@J. M. E. Hyland
#t2002
#cMathematical Structures in Computer Science
#index1014837
#%126872
#%484465
#%628798
#%629613
#%887517
#%1000341
#%1014832
#!
  
#*Decidability of fourth-order matching.
#@Vincent Padovani
#t2000
#cMathematical Structures in Computer Science
#index1014838
#%124403
#%252267
#%626693
#%628903
#%631783
#%1090642
#%1094460
#%3006100
#!
  
#*On the elimination of some higher type quantifiers.
#@Yasuwo Ikeda,Kohji Tomita,Chiharu Hosono
#t2001
#cMathematical Structures in Computer Science
#index1014839
#% 
#!
  
#*Comparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi.
#@Catuscia Palamidessi
#t2003
#cMathematical Structures in Computer Science
#index1014840
#%2597
#%66758
#%114500
#%173056
#%546611
#%772826
#%888996
#%888914
#%1093508
#%3005514
#!
  
#*On the number of fixed points of a combinator in lambda calculus.
#@Benedetto Intrigila,E. Biasone
#t2000
#cMathematical Structures in Computer Science
#index1014841
#%1089146
#!
  
#*A categorical version of the Brouwer-Heyting-Kolmogorov interpretation.
#@Erik Palmgren
#t2004
#cMathematical Structures in Computer Science
#index1014842
#% 
#!
  
#*The Temporal Logic of Coalgebras via Galois Algebras.
#@Bart Jacobs
#t2002
#cMathematical Structures in Computer Science
#index1014843
#%700
#%705
#%137588
#%188885
#%486435
#%494959
#%522332
#%628800
#%1014857
#%1092365
#%1092818
#%1094318
#%1129168
#%3006115
#!
  
#*Final coalgebras as greatest fixed points in ZF set theory.
#@Lawrence C. Paulson
#t1999
#cMathematical Structures in Computer Science
#index1014844
#%71782
#%126785
#%126862
#%188885
#%559589
#%628864
#%631786
#%818602
#%954973
#%1089151
#%1093509
#%3005514
#!
  
#*Semantics of the Second Order Lambda Calculus.
#@Bart Jacobs
#t1991
#cMathematical Structures in Computer Science
#index1014845
#% 
#!
  
#*Chu I: Cofree Equivalences, Dualities and *-Autonomous Categories.
#@Dusko Pavlovic
#t1997
#cMathematical Structures in Computer Science
#index1014846
#%484721
#%485129
#%494401
#!
  
#*Compositionality and Compatibility of Parameterization and Parameter Passing in Specification Languages.
#@Rosa M. Jiménez,Fernando Orejas,Hartmut Ehrig
#t1995
#cMathematical Structures in Computer Science
#index1014847
#% 
#!
  
#*Categorical logic of Names and Abstraction in Action Calculi.
#@Dusko Pavlovic
#t1997
#cMathematical Structures in Computer Science
#index1014848
#%114414
#%114538
#%485051
#%494168
#%511811
#%888930
#%888913
#%3005514
#!
  
#*On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi.
#@Patricia Johann
#t2005
#cMathematical Structures in Computer Science
#index1014849
#%38692
#%214213
#%214224
#%214170
#%268855
#%309991
#%310138
#%486503
#%545893
#%546171
#%553008
#%579424
#%628879
#%889239
#%980959
#%1014870
#%1088624
#%3005070
#!
  
#*Concurrent programming as proof net construction.
#@Guy Perrier
#t1998
#cMathematical Structures in Computer Science
#index1014850
#%180599
#%888914
#%1091506
#%1091362
#%3005872
#!
  
#*Corrigenda for 'Connected limits, familial representability and Artin glueing'.
#@Aurelio Carboni Peter Johnstone
#t2004
#cMathematical Structures in Computer Science
#index1014851
#% 
#!
  
#*Primitive Recursion, Equality, and a Universal Set.
#@Michael Pfender,K. Kröplin,D. Pape
#t1994
#cMathematical Structures in Computer Science
#index1014852
#% 
#!
  
#*Syntactic composition of top-down tree transducers is short cut fusion.
#@Claus Jürgensen,Heiko Vogler
#t2004
#cMathematical Structures in Computer Science
#index1014853
#%189078
#%208354
#%214213
#%214224
#%214170
#%219735
#%267902
#%309991
#%546821
#%572621
#%740745
#%740868
#%950460
#%981062
#%1090875
#%1091315
#%1095124
#%2939527
#!
  
#*A judgmental reconstruction of modal logic.
#@Frank Pfenning,Rowan Davies
#t2001
#cMathematical Structures in Computer Science
#index1014854
#%124457
#%485071
#%546065
#%628855
#%833220
#%887806
#%888247
#%888930
#%950125
#%954620
#%980810
#%1092653
#%1123878
#!
  
#*The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity.
#@Max I. Kanovich,Jacqueline Vauzeilles
#t2001
#cMathematical Structures in Computer Science
#index1014855
#%73
#%744600
#%745478
#%745499
#%949951
#%1025023
#%1091506
#%1093333
#!
  
#*Building Domains from Graph Models.
#@Wesley Phoa
#t1992
#cMathematical Structures in Computer Science
#index1014856
#% 
#!
  
#*Temporal Algebra.
#@Burghard von Karger
#t1998
#cMathematical Structures in Computer Science
#index1014857
#%700
#%3275
#%269020
#%486435
#%741301
#%932070
#%1056597
#%1093435
#!
  
#*Garside monoids vs divisibility monoids.
#@Matthieu Picantin
#t2005
#cMathematical Structures in Computer Science
#index1014858
#%1014680
#!
  
#*Observational trees as models for concurrency.
#@Stefano Kasangian,Anna Labella
#t1999
#cMathematical Structures in Computer Science
#index1014859
#%2597
#%3498
#%114236
#%126882
#%267552
#%494291
#%494955
#%511803
#%627565
#%888564
#%949550
#%971796
#%1089275
#%3005514
#%3307402
#!
  
#*Intersection Types and Bounded Polymorphism.
#@Benjamin C. Pierce
#t1997
#cMathematical Structures in Computer Science
#index1014860
#%124404
#%172890
#%214128
#%267560
#%484165
#%484239
#%484251
#%484346
#%484258
#%495002
#%495014
#%521956
#%542423
#%542572
#%545899
#%546007
#%545884
#%546152
#%546172
#%546431
#%546540
#%553008
#%579434
#%620392
#%625603
#%625678
#%625647
#%625641
#%628752
#%832338
#%887149
#%980916
#%980753
#%1089088
#%1094245
#%3005874
#!
  
#*Theory and applications of explicit substitutions: Introduction.
#@Delia Kesner
#t2001
#cMathematical Structures in Computer Science
#index1014861
#% 
#!
  
#*Spaces of Maximal Points.
#@Jimmie Lawson
#t1997
#cMathematical Structures in Computer Science
#index1014862
#%495069
#%887707
#%887709
#!
  
#*Erratum.
#@
#t2006
#cMathematical Structures in Computer Science
#index1014863
#% 
#!
  
#*Normal Forms for Context-Free Node-Rewriting Hypergraph Grammars.
#@Renate Klempien-Hinrichs
#t2002
#cMathematical Structures in Computer Science
#index1014864
#%3327
#%228672
#%228743
#%228746
#%625749
#%887776
#%971764
#%972980
#%1090210
#%1092584
#!
  
#*Mu-depth 3 is more than 2: a game-theoretic proof.
#@Giacomo Lenzi
#t2001
#cMathematical Structures in Computer Science
#index1014865
#%114001
#%267891
#%619900
#%889539
#%1088928
#%1093789
#!
  
#*Coercions in a polymorphic type system.
#@Zhaohui Luo
#t2008
#cMathematical Structures in Computer Science
#index1014866
#%124298
#%546047
#%546536
#%546717
#%832338
#%887331
#%951454
#%1006913
#%1077810
#%3006784
#!
  
#*Partial Hyperdoctrines: Categorical Models for Partial Function Logic and Hoare Logic.
#@Peter M. W. Knijnenburg,Frank Nordemann
#t1994
#cMathematical Structures in Computer Science
#index1014867
#% 
#!
  
#*Typing and Subtyping for Mobile Processes.
#@Benjamin C. Pierce,Davide Sangiorgi
#t1996
#cMathematical Structures in Computer Science
#index1014868
#% 
#!
  
#*Hypergraph Construction and its Application to the Static Analysis of Concurrent Systems.
#@Barbara König
#t2002
#cMathematical Structures in Computer Science
#index1014869
#%3327
#%228627
#%629711
#%651630
#%660805
#!
  
#*Parametric polymorphism and operational equivalence.
#@Andrew M. Pitts
#t2000
#cMathematical Structures in Computer Science
#index1014870
#%214224
#%268855
#%485116
#%495018
#%495072
#%545893
#%546282
#%546550
#%553008
#%625611
#%625676
#%628879
#%887515
#%888824
#%889239
#%1088624
#%1089083
#%1090983
#%1094514
#%1123764
#!
  
#*Efficient Recursive Subtyping.
#@Dexter Kozen,Jens Palsberg,Michael I. Schwartzbach
#t1995
#cMathematical Structures in Computer Science
#index1014871
#% 
#!
  
#*Tripos Theory in Retrospect.
#@Andrew M. Pitts
#t2002
#cMathematical Structures in Computer Science
#index1014872
#%484804
#!
  
#*Equivalence and Difference between Institutions: Simulating Horn Clause Logic with Based Algebras.
#@Hans-Jörg Kreowski,Till Mossakowski
#t1995
#cMathematical Structures in Computer Science
#index1014873
#% 
#!
  
#*Order in open intervals of computable reals.
#@Jan von Plato
#t1999
#cMathematical Structures in Computer Science
#index1014874
#%631970
#!
  
#*Coalgebraic modal logic of finite rank.
#@Alexander Kurz,Dirk Pattinson
#t2005
#cMathematical Structures in Computer Science
#index1014875
#%1088625
#%1089151
#%1092365
#%1092818
#%1093931
#%1094318
#!
  
#*Full abstraction, totality and PCF.
#@Gordon D. Plotkin
#t1999
#cMathematical Structures in Computer Science
#index1014876
#%552617
#%625639
#%1059716
#%1094514
#%1094782
#%3005873
#!
  
#*Operations and equations for coalgebras.
#@Alexander Kurz,Jirí Rosický
#t2005
#cMathematical Structures in Computer Science
#index1014877
#%126785
#%269071
#%1091616
#%1093931
#%1094281
#%1094318
#!
  
#*Premonoidal Categories and Notions of Computation.
#@John Power,Edmund Robinson
#t1997
#cMathematical Structures in Computer Science
#index1014878
#%114414
#%114538
#%485051
#%888930
#%1088863
#!
  
#*Church-Rosser Property and Homology of Monoids.
#@Yves Lafont,Alain Prouté
#t1991
#cMathematical Structures in Computer Science
#index1014879
#% 
#!
  
#*A Formalism for the Specification of Essentially Algebraic Structures in 2-Categories.
#@A. John Power,Charles Wells
#t1992
#cMathematical Structures in Computer Science
#index1014880
#% 
#!
  
#*Least Fixpoints of Endofunctors of Cartesian Closed Categories.
#@Joachim Lambek
#t1993
#cMathematical Structures in Computer Science
#index1014881
#% 
#!
  
#*Higher dimensional automata revisited.
#@Vaughan R. Pratt
#t2000
#cMathematical Structures in Computer Science
#index1014882
#%490
#%39863
#%40171
#%70836
#%114328
#%114332
#%114544
#%114198
#%126787
#%188834
#%407531
#%407733
#%484639
#%484534
#%484721
#%485129
#%486434
#%494401
#%494243
#%546652
#%546650
#%572638
#%620902
#%744297
#%1091513
#%3307402
#!
  
#*Axiomatizing Permutation Equivalence.
#@Cosimo Laneve,Ugo Montanari
#t1996
#cMathematical Structures in Computer Science
#index1014883
#% 
#!
  
#*Transition And Cancellation In Concurrency And Branching Time.
#@Vaughan R. Pratt
#t2003
#cMathematical Structures in Computer Science
#index1014884
#%490
#%39863
#%70836
#%114332
#%114198
#%188834
#%269258
#%407531
#%407733
#%484534
#%484721
#%486434
#%546652
#%546650
#%559632
#%627565
#%744297
#%949871
#%1014774
#%1014882
#%1091506
#%1091513
#%3307402
#!
  
#*Solos In Concert.
#@Cosimo Laneve,Björn Victor
#t2003
#cMathematical Structures in Computer Science
#index1014885
#%66607
#%114502
#%114500
#%114555
#%114655
#%114585
#%173056
#%267194
#%267769
#%267997
#%268698
#%269146
#%485066
#%546611
#%625580
#%888913
#%1014819
#%1025745
#!
  
#*The call-by-value [lambda]-calculus: a semantic investigation.
#@Alberto Pravato,Simona Ronchi Della Rocca,Luca Roversi
#t1999
#cMathematical Structures in Computer Science
#index1014886
#%124293
#%480984
#%484441
#%493815
#%546235
#%628886
#%881702
#%888930
#%1091506
#%3004668
#!
  
#*Constraint Satisfaction Algorithms for Graph Pattern Matching.
#@Javier Larrosa,Gabriel Valiente
#t2002
#cMathematical Structures in Computer Science
#index1014887
#%525
#%14638
#%117175
#%228697
#%625716
#%744440
#%744442
#%745268
#%774915
#%949735
#%950346
#%951751
#%1031372
#%1041920
#%3003206
#%3006096
#!
  
#*Functional Completeness of the Free Locally Cartesian Closed Category an Interpretations of Martin-Löf's Theory of Dependent Types.
#@Anne Preller,Geneviève Simonet
#t1996
#cMathematical Structures in Computer Science
#index1014888
#% 
#!
  
#*Domains, integration and 'positive analysis'.
#@Jimmie D. Lawson
#t2004
#cMathematical Structures in Computer Science
#index1014889
#% 
#!
  
#*On the classification of dipaths in geometric models for concurrency.
#@Martin Raußen
#t2000
#cMathematical Structures in Computer Science
#index1014890
#%3482
#%114198
#%546652
#%559533
#%950930
#%1014727
#%1123387
#!
  
#*An Approach to Object Semantics based on Terminal Co-Algebras.
#@Horst Reichel
#t1995
#cMathematical Structures in Computer Science
#index1014891
#% 
#!
  
#*A Semantic Characterisation of the Correctness of a Proof Net.
#@Christian Retoré
#t1997
#cMathematical Structures in Computer Science
#index1014892
#%546368
#%1088696
#%1091506
#!
  
#*General synthetic domain theory - a logical approach.
#@Bernhard Reus,Thomas Streicher
#t1999
#cMathematical Structures in Computer Science
#index1014893
#% 
#!
  
#*Reflexive Objects in Topological Categories.
#@Michael D. Rice
#t1996
#cMathematical Structures in Computer Science
#index1014894
#% 
#!
  
#*Fully Abstract Translations Between Functional Languages.
#@Jon G. Riecke
#t1993
#cMathematical Structures in Computer Science
#index1014895
#% 
#!
  
#*Conditions for the completeness of functional and algebraic equational reasoning.
#@Jon G. Riecke,Ramesh Subrahmanyam
#t1999
#cMathematical Structures in Computer Science
#index1014896
#%484595
#%546809
#%553008
#%628900
#%888930
#%889241
#%949687
#!
  
#*Minimisation and minimal realisation in Span(Graph).
#@Robert D. Rosebrugh,Nicoletta Sabadini,Robert F. C. Walters
#t2004
#cMathematical Structures in Computer Science
#index1014897
#%40034
#%40036
#%268223
#%484554
#%881956
#%950446
#%1014719
#%1014898
#%1123333
#!
  
#*Minimal Realization in Bicategories of Automata.
#@Robert D. Rosebrugh,Nicoletta Sabadini,Robert F. C. Walters
#t1998
#cMathematical Structures in Computer Science
#index1014898
#%1095080
#!
  
#*Girard Quantaloids.
#@Kimmo I. Rosenthal
#t1992
#cMathematical Structures in Computer Science
#index1014899
#% 
#!
  
#*A Categorical Look at Tree Automata and Context-Free Languages.
#@Kimmo I. Rosenthal
#t1994
#cMathematical Structures in Computer Science
#index1014900
#% 
#!
  
#*Axiomatizability in Inclusive Equational Logics.
#@Grigore Rosu
#t2002
#cMathematical Structures in Computer Science
#index1014901
#%27824
#%40045
#%109621
#%203991
#%950459
#%1014604
#%1094281
#!
  
#*Admissible and Derivable Rules in Intuitionistic Logic.
#@Paul Rozière
#t1993
#cMathematical Structures in Computer Science
#index1014902
#% 
#!
  
#*Non-commutative logic II: sequent calculus and phase semantics.
#@Paul Ruet
#t2000
#cMathematical Structures in Computer Science
#index1014903
#%563190
#%1091506
#!
  
#*A coinductive calculus of streams.
#@Jan J. M. M. Rutten
#t2005
#cMathematical Structures in Computer Science
#index1014904
#%126785
#%485070
#%627565
#%868745
#%932875
#%949891
#%953880
#%981024
#%1092468
#%1094318
#%3005514
#!
  
#*Processes as Terms: Non-Well-Founded Models for Bisimulation.
#@Jan J. M. M. Rutten
#t1992
#cMathematical Structures in Computer Science
#index1014905
#% 
#!
  
#*A Note on Recursive Functions.
#@Nicoletta Sabadini,Sebastiano Vigna,Robert F. C. Walters
#t1996
#cMathematical Structures in Computer Science
#index1014906
#% 
#!
  
#*Interpolation and Compactness in Categories of Pre-Institutions.
#@Antonino Salibra,Giuseppe Scollo
#t1996
#cMathematical Structures in Computer Science
#index1014907
#% 
#!
  
#*On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces.
#@Davide Sangiorgi
#t1998
#cMathematical Structures in Computer Science
#index1014908
#% 
#!
  
#*From lambda to pi; or, Rediscovering continuations.
#@Davide Sangiorgi
#t1999
#cMathematical Structures in Computer Science
#index1014909
#%512
#%114139
#%114704
#%188999
#%268698
#%484218
#%486499
#%495060
#%546469
#%546308
#%546573
#%546398
#%559558
#%626384
#%888913
#%980898
#%1006719
#%1006655
#%1006875
#%1006889
#%1094395
#%1123679
#%3003905
#%3005774
#%3005874
#%3006522
#!
  
#*Introduction to special issue on concurrency and coordination: Selected work from the International Workshop ConCoord.
#@Vladimiro Sassone
#t2004
#cMathematical Structures in Computer Science
#index1014910
#% 
#!
  
#*An Axiomatization of the Category of Petri Net Computations.
#@Vladimiro Sassone
#t1998
#cMathematical Structures in Computer Science
#index1014911
#%620902
#%626689
#%1089370
#%1094417
#!
  
#*On Outward and Inward Productions in the Categorical Graph-Grammar Approach and Delta-Grammars.
#@Hans Jürgen Schneider
#t1996
#cMathematical Structures in Computer Science
#index1014912
#% 
#!
  
#*Universal Aspects of Probabilistic Automata.
#@Lutz Schröder,Paulo Mateus
#t2002
#cMathematical Structures in Computer Science
#index1014913
#%493388
#%772826
#%853439
#%887989
#%921778
#%1058950
#%1095267
#!
  
#*Linear Time Computable Problems and First-Order Descriptions.
#@Detlef Seese
#t1996
#cMathematical Structures in Computer Science
#index1014914
#% 
#!
  
#*On lists and other abstract data types in the calculus of constructions.
#@Jonathan P. Seldin
#t2000
#cMathematical Structures in Computer Science
#index1014915
#% 
#!
  
#*Control categories and duality: on the categorical semantics of the lambda-mu calculus.
#@Peter Selinger
#t2001
#cMathematical Structures in Computer Science
#index1014916
#%484807
#%485023
#%487168
#%487301
#%546602
#%981156
#%1014878
#%1090983
#!
  
#*Towards a quantum programming language.
#@Peter Selinger
#t2004
#cMathematical Structures in Computer Science
#index1014917
#%622193
#%1091506
#%507823
#!
  
#*Unfold/Fold Transformations of Logic Programs.
#@John C. Shepherdson
#t1992
#cMathematical Structures in Computer Science
#index1014918
#% 
#!
  
#*The Glueing Construction and Lax Limits.
#@Harold Simmons
#t1994
#cMathematical Structures in Computer Science
#index1014919
#% 
#!
  
#*Investigation of Concurrent Processes by Means of Homotopy Functors.
#@Stefan Sokolowski
#t2002
#cMathematical Structures in Computer Science
#index1014920
#%114332
#%114198
#%546652
#%1014727
#!
  
#*Reductions in Intuitionistic Linear Logic.
#@Sergei Soloviev
#t1995
#cMathematical Structures in Computer Science
#index1014921
#% 
#!
  
#*Engeler's Scientific Work.
#@Ernst Specker
#t1992
#cMathematical Structures in Computer Science
#index1014922
#% 
#!
  
#*The largest Cartesian closed category of domains, considered constructively.
#@Dieter Spreen
#t2005
#cMathematical Structures in Computer Science
#index1014923
#%701
#%126788
#%269070
#%494949
#%1014939
#%1095374
#%3005874
#!
  
#*Complexity Of Weak Bisimilarity And Regularity For Bpa And Bpp.
#@Jirí Srba
#t2003
#cMathematical Structures in Computer Science
#index1014924
#%79838
#%113987
#%114175
#%114235
#%114525
#%114644
#%204024
#%219733
#%268329
#%268330
#%493285
#%620838
#%627565
#%887547
#%888847
#%1089061
#%1091971
#%1092337
#%3005514
#!
  
#*On the existence of n but not n + 1 easy combinators.
#@Richard Statman
#t1999
#cMathematical Structures in Computer Science
#index1014925
#% 
#!
  
#*Dependence and Independence Results for (Impredicative) Calculi of Dependent Types.
#@Thomas Streicher
#t1992
#cMathematical Structures in Computer Science
#index1014926
#% 
#!
  
#*A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists.
#@Thomas Streicher
#t1994
#cMathematical Structures in Computer Science
#index1014927
#% 
#!
  
#*Periodic Linear Programming with applications to real-time scheduling.
#@K. Subramani
#t2005
#cMathematical Structures in Computer Science
#index1014928
#%2022
#%29876
#%450552
#%565168
#%612136
#%625410
#%744720
#%950973
#%1052939
#%1059529
#%1079377
#%1088805
#!
  
#*On categories generalizing universal domains.
#@Vera Trnková,Jiri Velebil
#t1999
#cMathematical Structures in Computer Science
#index1014929
#%701
#%267199
#%269020
#%1014609
#!
  
#*Step Bisimulation is Pomset Equivalence on a Parallel Language Without Explicit Internal Choice.
#@Douglas R. Troeger
#t1993
#cMathematical Structures in Computer Science
#index1014930
#% 
#!
  
#*Languages under Concatenation and Shuffling.
#@Steven T. Tschantz
#t1994
#cMathematical Structures in Computer Science
#index1014931
#% 
#!
  
#*Compact metric spaces as minimal-limit sets in domains of bottomed sequences.
#@Hideki Tsuiki
#t2004
#cMathematical Structures in Computer Science
#index1014932
#%81635
#%1089443
#%1090933
#%1090765
#%1091481
#%1094984
#!
  
#*A Computationally Adequate Model for Overloading via Domain-Valued Functors.
#@Hideki Tsuiki
#t1998
#cMathematical Structures in Computer Science
#index1014933
#%220021
#%887420
#!
  
#*On the Foundations of Final Coalgebra Semantics.
#@Daniele Turi,Jan J. M. M. Rutten
#t1998
#cMathematical Structures in Computer Science
#index1014934
#% 
#!
  
#*A Simple Proof of the Undecidability of Strong Normalisation.
#@Pawel Urzyczyn
#t2003
#cMathematical Structures in Computer Science
#index1014935
#%546412
#%628745
#!
  
#*Type Reconstruction in F.
#@Pawel Urzyczyn
#t1997
#cMathematical Structures in Computer Science
#index1014936
#%188739
#%484239
#%494658
#%546421
#%546412
#%546499
#%625666
#%628911
#%881794
#%882284
#%888502
#%888503
#%888919
#%950869
#%1123668
#!
  
#*Algebraic Properties Of Processes for Local Action Systems.
#@Nico Verlinden,Dirk Janssens
#t2002
#cMathematical Structures in Computer Science
#index1014937
#%114125
#%228672
#%267294
#%660397
#%3307402
#!
  
#*Cut rules and explicit substitutions.
#@René Vestergaard,J. B. Wells
#t2001
#cMathematical Structures in Computer Science
#index1014938
#%3453
#%124546
#%309836
#%484537
#%484584
#%484866
#%485095
#%485086
#%543300
#%624859
#%628779
#%950090
#%980950
#%1088696
#%1090739
#%1091354
#!
  
#*Strongly algebraic = SFP (topically).
#@Steven Vickers
#t2001
#cMathematical Structures in Computer Science
#index1014939
#%1014940
#%3006979
#!
  
#*Topical categories of domains.
#@Steven Vickers
#t1999
#cMathematical Structures in Computer Science
#index1014940
#%397751
#%887579
#%1095076
#%3002961
#!
  
#*Comprehending Monads.
#@Philip Wadler
#t1992
#cMathematical Structures in Computer Science
#index1014941
#% 
#!
  
#*Computation Algebras.
#@Michal Walicki,Magne Haveraaen,Sigurd Meldal
#t2001
#cMathematical Structures in Computer Science
#index1014942
#%109606
#%575135
#%651657
#%1123473
#%3004643
#%3007008
#!
  
#*An Imperative Language Based on Distributive Categories.
#@Robert F. C. Walters
#t1992
#cMathematical Structures in Computer Science
#index1014943
#% 
#!
  
#*Strong Normalization with Non-Structural Subtyping.
#@Mitchell Wand,Patrick O'Keefe,Jens Palsberg
#t1995
#cMathematical Structures in Computer Science
#index1014944
#% 
#!
  
#*A note on coalgebras and presheaves.
#@James Worrell
#t2005
#cMathematical Structures in Computer Science
#index1014945
#%1014857
#%1014843
#%1092382
#%1094318
#!
  
#*Some Monoidal Closed Categories of Stable Domains and Event Structures.
#@Guo-Qiang Zhang
#t1993
#cMathematical Structures in Computer Science
#index1014946
#% 
#!
  
#*On The Expressiveness Of Pure Safe Ambients.
#@Pascal Zimmer
#t2003
#cMathematical Structures in Computer Science
#index1014947
#%213642
#%268665
#%546450
#%546611
#%866883
#%1092058
#!
  
#*Implementing the cylindrical algebraic decomposition within the Coq system.
#@Assia Mahboubi
#t2007
#cMathematical Structures in Computer Science
#index1014948
#%60484
#%309961
#%449126
#%954715
#%955056
#%980798
#%993666
#%1091425
#!
  
#*Preface to the special issue: Constructive analysis, types and exact real numbers.
#@Bas Spitters,Herman Geuvers,Milad Niqui,Freek Wiedijk
#t2007
#cMathematical Structures in Computer Science
#index1014949
#% 
#!
  
#*Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic.
#@Michele Pagani
#t2007
#cMathematical Structures in Computer Science
#index1014950
#% 
#!
  
#*Discrete-time and continuous-time modelling: some bridges and gaps.
#@Hubert Krivine,Annick Lesne,Jacques Treiner
#t2007
#cMathematical Structures in Computer Science
#index1014951
#% 
#!
  
#*A monadic, functional implementation of real numbers.
#@Russell O'Connor
#t2007
#cMathematical Structures in Computer Science
#index1014952
#%484137
#%1092990
#%888930
#!
  
#*Discrete-continuous and classical-quantum.
#@Thierry Paul
#t2007
#cMathematical Structures in Computer Science
#index1014953
#% 
#!
  
#*Constructive analysis, types and exact real numbers.
#@Herman Geuvers,Milad Niqui,Bas Spitters,Freek Wiedijk
#t2007
#cMathematical Structures in Computer Science
#index1014954
#%630
#%649
#%701
#%17470
#%49543
#%49518
#%81620
#%81597
#%108571
#%108574
#%108578
#%124857
#%267313
#%309857
#%484137
#%494478
#%628864
#%631879
#%631912
#%878925
#%989120
#%1014696
#%1014718
#%1014832
#%1014717
#%1082535
#%1090935
#%1090933
#%1092141
#%1094389
#%1094318
#%1123903
#%2939390
#%3169345
#!
  
#*Free compact 2-categories.
#@Anne Preller,Joachim Lambek
#t2007
#cMathematical Structures in Computer Science
#index1014955
#% 
#!
  
#*3-body, classical-quantum, discrete-continuous.
#@Thierry Paul
#t2007
#cMathematical Structures in Computer Science
#index1014956
#% 
#!
  
#*RealLib: An efficient implementation of exact real arithmetic.
#@Branimir Lambov
#t2007
#cMathematical Structures in Computer Science
#index1014957
#%49470
#%81620
#%542720
#%769434
#%960048
#%1089694
#%1090765
#%2870868
#!
  
#*Randomness and determinism in the interplay between the continuum and the discrete.
#@Francis Bailly,Giuseppe Longo
#t2007
#cMathematical Structures in Computer Science
#index1014958
#% 
#!
  
#*The discrete versus continuous controversy in physics.
#@Annick Lesne
#t2007
#cMathematical Structures in Computer Science
#index1014959
#% 
#!
  
#*On the status of perturbation theory.
#@Thierry Paul
#t2007
#cMathematical Structures in Computer Science
#index1014960
#% 
#!
  
#*Two preservation results for countable products of sequential spaces.
#@Matthias Schröder,Alex Simpson
#t2007
#cMathematical Structures in Computer Science
#index1014961
#%1014997
#%1014795
#%1094491
#!
  
#*The driven three body Coulomb problem.
#@Javier Madroñero,Laurent Hilico,Benoît Grémaud,Dominique Delande,Andreas Buchleitner
#t2007
#cMathematical Structures in Computer Science
#index1014962
#% 
#!
  
#*Affine functions and series with co-inductive real numbers.
#@Yves Bertot
#t2007
#cMathematical Structures in Computer Science
#index1014963
#%267313
#%484137
#%625623
#%631879
#%631797
#%209238
#%1014948
#%768249
#%628864
#%878954
#%1082535
#!
  
#*Axioms for bigraphical structure.
#@Robin Milner
#t2005
#cMathematical Structures in Computer Science
#index1014964
#%114605
#%213642
#%228627
#%546355
#%866883
#%888914
#%933389
#%1094184
#%3005514
#!
  
#*Classical isomorphisms of types.
#@Olivier Laurent
#t2005
#cMathematical Structures in Computer Science
#index1014965
#%484388
#%484400
#%484674
#%484406
#%998048
#%1014916
#%1088704
#%1092917
#!
  
#*Foreword.
#@Sergei Soloviev
#t2005
#cMathematical Structures in Computer Science
#index1014966
#% 
#!
  
#*The semantics of BI and resource tableaux.
#@Didier Galmiche,Daniel Méry,David J. Pym
#t2005
#cMathematical Structures in Computer Science
#index1014967
#%71430
#%124471
#%484981
#%485149
#%546344
#%625658
#%1091358
#%1091506
#%1094122
#%1117229
#!
  
#*A short survey of isomorphisms of types.
#@Roberto Di Cosmo
#t2005
#cMathematical Structures in Computer Science
#index1014968
#%29170
#%126790
#%213638
#%484363
#%485050
#%487348
#%543104
#%545898
#%546023
#%546182
#%546819
#%546784
#%621601
#%888919
#%889084
#%1014670
#%1056893
#%1091506
#%1123266
#!
  
#*A computational view of implicit coercions in type theory.
#@Gilles Barthe
#t2005
#cMathematical Structures in Computer Science
#index1014969
#%124298
#%487115
#%546717
#%546819
#%548090
#%579426
#%631824
#%631876
#%631822
#%631919
#%631910
#%889405
#%980798
#%980796
#%981022
#!
  
#*Efficient algorithms for isomorphisms of simple types.
#@Joseph Gil,Yoav Zibin
#t2005
#cMathematical Structures in Computer Science
#index1014970
#%126790
#%213638
#%484674
#%546023
#%546164
#%546862
#%621601
#%984357
#%1089849
#%1123657
#!
  
#*Isomorphisms of simple inductive types through extensional rewriting.
#@David Chemouil
#t2005
#cMathematical Structures in Computer Science
#index1014971
#%124412
#%126790
#%484674
#%487348
#%563184
#%628743
#%628864
#%1089446
#%1090323
#%3004973
#!
  
#*From proof-nets to bordisms: the geometric meaning of multiplicative connectives.
#@Sergey Slavnov
#t2005
#cMathematical Structures in Computer Science
#index1014972
#%1091506
#%1092170
#%1094643
#!
  
#*Modular correspondence between dependent type theories and categories including pretopoi and topoi.
#@Maria Emilia Maietti
#t2005
#cMathematical Structures in Computer Science
#index1014973
#%124558
#%631882
#%887392
#%887517
#%1001170
#%1007172
#%3004643
#%3005321
#%3169345
#!
  
#*Matching with multiplication and exponentiation (extended abstract).
#@Bernard Lang
#t2005
#cMathematical Structures in Computer Science
#index1014974
#%622865
#%951454
#%951624
#!
  
#*A categorical quantum logic.
#@Samson Abramsky,Ross Duncan
#t2006
#cMathematical Structures in Computer Science
#index1014975
#%484395
#%511811
#!
  
#*Quantum weakest preconditions.
#@Ellie D'Hondt,Prakash Panangaden
#t2006
#cMathematical Structures in Computer Science
#index1014976
#%269071
#%622193
#%772823
#%1015006
#%1014917
#%1123370
#%507823
#!
  
#*Types and typechecking for Communicating Quantum Processes.
#@Simon J. Gay,Rajagopal Nagarajan
#t2006
#cMathematical Structures in Computer Science
#index1014977
#%79347
#%118352
#%484395
#%530122
#%819637
#%819652
#%888913
#%889799
#%951125
#%1014993
#%1014917
#%1060552
#%1091506
#%1123680
#%507823
#!
  
#*Differential categories.
#@Richard Blute,J. Robin B. Cockett,R. A. G. Seely
#t2006
#cMathematical Structures in Computer Science
#index1014978
#%628797
#%1014704
#%1090870
#%1091506
#%1092170
#!
  
#*Quotients of countably based spaces are not closed under sobrification.
#@Gary Gruenhage,Thomas Streicher
#t2006
#cMathematical Structures in Computer Science
#index1014979
#%1014997
#%1014795
#!
  
#*On light logics, uniform encodings and polynomial time.
#@Ugo Dal Lago,Patrick Baillot
#t2006
#cMathematical Structures in Computer Science
#index1014980
#%484487
#%887982
#%888252
#%950320
#%1091506
#%1092847
#%1093658
#%1117133
#!
  
#*Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts.
#@Hartmut Ehrig,Barbara König
#t2006
#cMathematical Structures in Computer Science
#index1014981
#%114585
#%228635
#%228729
#%268698
#%485193
#%494528
#%546355
#%625703
#%651630
#%1091334
#%1094568
#%3004669
#!
  
#*Restricted jump interpolation in the d.c.e. degrees.
#@Carl G. Jockusch Jr.,Angsheng Li
#t2006
#cMathematical Structures in Computer Science
#index1014982
#% 
#!
  
#*The strength of Engeler's lemma.
#@Jan Paseka
#t2006
#cMathematical Structures in Computer Science
#index1014983
#% 
#!
  
#*Monoids over domains.
#@Michael W. Mislove
#t2006
#cMathematical Structures in Computer Science
#index1014984
#%1092381
#!
  
#*Borel ranks and Wadge degrees of context free omega-languages.
#@Olivier Finkel
#t2006
#cMathematical Structures in Computer Science
#index1014985
#% 
#!
  
#*Call-by-need in token-passing nets.
#@François-Régis Sinot
#t2006
#cMathematical Structures in Computer Science
#index1014986
#%214099
#%310036
#%484117
#%484209
#%546235
#%546368
#%546376
#%546398
#%888636
#%980760
#%981008
#%1057143
#%1091506
#!
  
#*Generalised multisets for chemical programming.
#@Jean-Pierre Banâtre,Pascal Fradet,Yann Radenac
#t2006
#cMathematical Structures in Computer Science
#index1014987
#%116374
#%267785
#%483175
#%665153
#%769788
#%771258
#%972802
#%1089332
#!
  
#*Quasi-metric spaces and point-free geometry.
#@Anna Di Concilio,Giangiacomo Gerla
#t2006
#cMathematical Structures in Computer Science
#index1014988
#%495037
#%1069603
#!
  
#*Iterative algebras at work.
#@Jirí Adámek,Stefan Milius,Jiri Velebil
#t2006
#cMathematical Structures in Computer Science
#index1014989
#%888903
#%889919
#%1014611
#%1088611
#%1088733
#%1094318
#%1095255
#!
  
#*On the complexity of inductive definitions.
#@Douglas A. Cenzer,Jeffrey B. Remmel
#t2006
#cMathematical Structures in Computer Science
#index1014990
#% 
#!
  
#*A lambda calculus for quantum computation with classical control.
#@Peter Selinger,Benoît Valiron
#t2006
#cMathematical Structures in Computer Science
#index1014991
#%484450
#%819637
#%1014917
#%1060552
#%1091506
#%507823
#!
  
#*Intuitionistic phase semantics is almost classical.
#@Max I. Kanovich,Mitsuhiro Okada,Kazushige Terui
#t2006
#cMathematical Structures in Computer Science
#index1014992
#%888247
#%1088696
#%1091506
#%1092848
#%1093825
#%1093826
#!
  
#*Relations among quantum processes: bisimilarity and congruence.
#@Marie Lalire
#t2006
#cMathematical Structures in Computer Science
#index1014993
#%114292
#%793494
#%930346
#%1014917
#%3005514
#!
  
#*Preface.
#@Martín Hötzel Escardó,Achim Jung,Thomas Streicher
#t2006
#cMathematical Structures in Computer Science
#index1014994
#% 
#!
  
#*Ordinal computations.
#@Peter Koepke,Martin Koerwien
#t2006
#cMathematical Structures in Computer Science
#index1014995
#% 
#!
  
#*Addressed term rewriting systems: application to a typed object calculus.
#@Daniel J. Dougherty,Pierre Lescanne,Luigi Liquori
#t2006
#cMathematical Structures in Computer Science
#index1014996
#%162
#%172853
#%204046
#%484107
#%485065
#%522191
#%529911
#%543160
#%877429
#%1025535
#%1088922
#%1089554
#%1090976
#%1093820
#%1123631
#%3004973
#%3005774
#%3006784
#!
  
#*Compactly generated domain theory.
#@Ingo Battenfeld,Matthias Schröder,Alex Simpson
#t2006
#cMathematical Structures in Computer Science
#index1014997
#%1014775
#%1014795
#%1091857
#!
  
#*Developments in computational models: introduction.
#@Maribel Fernández,Ian Mackie
#t2006
#cMathematical Structures in Computer Science
#index1014998
#% 
#!
  
#*Classically controlled quantum computation.
#@Simon Perdrix,Philippe Jorrand
#t2006
#cMathematical Structures in Computer Science
#index1014999
#%1058599
#%85532
#%1014917
#%211968
#%212034
#!
  
#*Continuous semantics for strong normalisation.
#@Ulrich Berger
#t2006
#cMathematical Structures in Computer Science
#index1015000
#% 
#!
  
#*Random reals and Lipschitz continuity.
#@Andrew E. M. Lewis,George Barmpalias
#t2006
#cMathematical Structures in Computer Science
#index1015001
#% 
#!
  
#*A Cartesian closed extension of the category of locales.
#@Reinhold Heckmann
#t2006
#cMathematical Structures in Computer Science
#index1015002
#%1089183
#%1095077
#!
  
#*Graph models of lambda-calculus at work, and variations.
#@Chantal Berline
#t2006
#cMathematical Structures in Computer Science
#index1015003
#%267369
#%368221
#%484520
#%485179
#%485213
#%889230
#%972223
#%1007504
#%1025553
#%1088751
#%1089314
#%1094370
#%1094542
#%3006100
#!
  
#*A logical approach to abstract algebra.
#@Thierry Coquand,Henri Lombardi
#t2006
#cMathematical Structures in Computer Science
#index1015004
#% 
#!
  
#*A domain-theoretic Banach-Alaoglu theorem.
#@Gordon D. Plotkin
#t2006
#cMathematical Structures in Computer Science
#index1015005
#% 
#!
  
#*LQP: the dynamic logic of quantum information.
#@Alexandru Baltag,Sonja Smets
#t2006
#cMathematical Structures in Computer Science
#index1015006
#%484395
#%819652
#!
  
#*Linear logic and polynomial time.
#@Damiano Mazza
#t2006
#cMathematical Structures in Computer Science
#index1015007
#%783621
#%887629
#%887982
#%1089081
#%1091038
#%1092450
#%1092847
#%1117133
#!
  
#*Mathematics of computing at CiE 2005.
#@S. Barry Cooper,Benedikt Löwe,Dag Normann
#t2006
#cMathematical Structures in Computer Science
#index1015008
#% 
#!
  
#*Distributing probability over non-determinism.
#@Daniele Varacca,Glynn Winskel
#t2006
#cMathematical Structures in Computer Science
#index1015009
#%213903
#%484845
#%485198
#%556563
#%888930
#%1025778
#!
  
#*Special issue on quantum programming languages.
#@Peter Selinger
#t2006
#cMathematical Structures in Computer Science
#index1015010
#% 
#!
  
#*Anti-symmetry of higher-order subtyping and equality by subtyping.
#@Adriana B. Compagnoni,Healfdene Goguen
#t2006
#cMathematical Structures in Computer Science
#index1015011
#%176277
#%220015
#%495014
#%546538
#%625641
#%628760
#%631841
#%832338
#%887331
#%887473
#%887375
#%888254
#%1088970
#%1094021
#%1123266
#%3005774
#!
  
#*Denotational semantics for a program logic of objects.
#@Bernhard Reus,Jan Schwinghammer
#t2006
#cMathematical Structures in Computer Science
#index1015012
#%3380
#%40189
#%124647
#%188874
#%188885
#%202263
#%202171
#%485149
#%626375
#%772823
#%889196
#%949705
#%1057063
#%1094211
#%1094613
#%1123266
#%3005774
#!
  
#*Partial metrisability of continuous posets.
#@Pawel Waszkiewicz
#t2006
#cMathematical Structures in Computer Science
#index1015013
#%1014862
#%1090759
#%1091210
#%1091212
#%1093267
#!
  
#*Modified bar recursion.
#@Ulrich Berger,Paulo Oliva
#t2006
#cMathematical Structures in Computer Science
#index1015014
#% 
#!
  
#*Termination of processes.
#@Davide Sangiorgi
#t2006
#cMathematical Structures in Computer Science
#index1015015
#%220056
#%309981
#%546201
#%625646
#%888263
#%1094398
#%3005514
#!
  
#*Uniform regular enumerations.
#@Ivan N. Soskov,Bogomil Kovachev
#t2006
#cMathematical Structures in Computer Science
#index1015016
#% 
#!
  
#*Reversible combinatory logic.
#@Alessandra Di Pierro,Chris Hankin,Herbert Wiklicky
#t2006
#cMathematical Structures in Computer Science
#index1015017
#% 
#!
  
#*Schnorr dimension.
#@Rodney G. Downey,Wolfgang Merkle,Jan Reimann
#t2006
#cMathematical Structures in Computer Science
#index1015018
#% 
#!
  
#*On sequential functionals of type 3.
#@Dag Normann
#t2006
#cMathematical Structures in Computer Science
#index1015019
#%625581
#%888303
#%1014876
#%1093066
#%1094514
#!
  
#*An extremely sharp phase transition threshold for the slow growing hierarchy.
#@Andreas Weiermann
#t2006
#cMathematical Structures in Computer Science
#index1015020
#% 
#!
  
#*Transition systems, link graphs and Petri nets.
#@James J. Leifer,Robin Milner
#t2006
#cMathematical Structures in Computer Science
#index1015021
#%2597
#%45591
#%66675
#%114567
#%114605
#%173056
#%213642
#%228627
#%484453
#%484839
#%485066
#%488646
#%546201
#%546368
#%546355
#%546516
#%546528
#%625629
#%866883
#%882210
#%886910
#%888090
#%888913
#%933389
#%949871
#%1089332
#%1089746
#%1094098
#!
  
#*Structuring quantum effects: superoperators as arrows.
#@Juliana Kaizer Vizzotto,Thorsten Altenkirch,Amr Sabry
#t2006
#cMathematical Structures in Computer Science
#index1015022
#%621226
#%484450
#%1056883
#%3580706
#%485071
#%310084
#%3580702
#%1014917
#%1014991
#%819637
#!
  
#*A denotational semantics for the symmetric interaction combinators.
#@Damiano Mazza
#t2007
#cMathematical Structures in Computer Science
#index1015023
#%546235
#%546368
#%888784
#%888636
#%1014704
#%1014773
#%1014950
#%1091025
#%1091506
#!
  
#*Quantum computation and quantum information.
#@Thierry Paul
#t2007
#cMathematical Structures in Computer Science
#index1015024
#% 
#!
  
#*A duality between proof systems for cyclic term graphs.
#@Clemens Grabmayer
#t2007
#cMathematical Structures in Computer Science
#index1015025
#%881529
#%951519
#%1093597
#%1123266
#!
  
#*Complexity of chaos and quantum computation.
#@Bertrand Georgeot
#t2007
#cMathematical Structures in Computer Science
#index1015026
#% 
#!
  
#*Entanglement and Hilbert space geometry for systems with a few qubits.
#@Rémy Mosseri,Pedro Ribeiro
#t2007
#cMathematical Structures in Computer Science
#index1015027
#% 
#!
  
#*Natural deduction via graphs: formal definition and computation rules.
#@Herman Geuvers,Iris Loeb
#t2007
#cMathematical Structures in Computer Science
#index1015028
#%484584
#%546368
#%1091506
#%1093330
#!
  
#*On the size complexity of universal accepting hybrid networks of evolutionary processors.
#@Florin Manea,Carlos Martín-Vide,Victor Mitrana
#t2007
#cMathematical Structures in Computer Science
#index1015029
#%65760
#%462077
#%1089891
#!
  
#*More developments in computational models: introduction.
#@Maribel Fernández,Ian Mackie
#t2007
#cMathematical Structures in Computer Science
#index1015030
#% 
#!
  
#*On the ubiquity of certain total type structures.
#@John Longley
#t2007
#cMathematical Structures in Computer Science
#index1015031
#% 
#!
  
#*Restriction categories III: colimits, partial limits and extensivity.
#@J. Robin B. Cockett,Stephen Lack
#t2007
#cMathematical Structures in Computer Science
#index1015032
#%887616
#%889257
#%1090177
#%1090175
#!
  
#*Randomised algorithms for isomorphisms of simple types.
#@Joseph Gil,Yoav Zibin
#t2007
#cMathematical Structures in Computer Science
#index1015033
#%546862
#%621704
#%951554
#%1059029
#!
  
#*Unitary invariants of qubit systems.
#@Jean-Gabriel Luque,Jean-Yves Thibon,Frédéric Toumazet
#t2007
#cMathematical Structures in Computer Science
#index1015034
#% 
#!
  
#*A projective formalism applied to topological and probabilistic event structures.
#@Samy Abbes
#t2007
#cMathematical Structures in Computer Science
#index1015035
#%484845
#%889898
#%932359
#%1088632
#%1092514
#!
  
#*Coalgebraic description of generalised binary methods.
#@Furio Honsell,Marina Lenisa,Rekha Redamalla
#t2007
#cMathematical Structures in Computer Science
#index1015036
#%70763
#%126785
#%137588
#%173068
#%485186
#%626560
#%628794
#%651568
#%886910
#%1014821
#%1077763
#%1090299
#%1091535
#!
  
#*Preface.
#@Martín Hötzel Escardó,Achim Jung,Thomas Streicher
#t2007
#cMathematical Structures in Computer Science
#index1015037
#% 
#!
  
#*A rewriting calculus for cyclic higher-order term graphs.
#@Paolo Baldan,Clara Bertolissi,Horatiu Cirstea,Claude Kirchner
#t2007
#cMathematical Structures in Computer Science
#index1015038
#%487301
#%529911
#%545902
#%563554
#%626451
#%887008
#%888488
#%950730
#%951311
#%1059678
#%1092552
#%1123663
#!
  
#*A calculus of open modules: call-by-need strategy and confluence.
#@Sonia Fagorzi,Elena Zucca
#t2007
#cMathematical Structures in Computer Science
#index1015039
#%188888
#%309887
#%310038
#%542632
#%546780
#%548030
#%625587
#%628130
#%740514
#%869717
#%887008
#%980760
#%980746
#%1006835
#%1014625
#%1092635
#%1095445
#%1123607
#%1342320
#%3005774
#!
  
#*Theory and applications of term graph rewriting: introduction.
#@Ian Mackie,Detlef Plump
#t2007
#cMathematical Structures in Computer Science
#index1015040
#% 
#!
  
#*Graph rewriting for the pi-calculus.
#@Fabio Gadducci
#t2007
#cMathematical Structures in Computer Science
#index1015041
#% 
#!
  
#*Decoherence in quantum walks - a review.
#@Viv Kendon
#t2007
#cMathematical Structures in Computer Science
#index1015042
#% 
#!
  
#*Behavioural reasoning for conditional equations.
#@Manuel A. Martins,Don Pigozzi
#t2007
#cMathematical Structures in Computer Science
#index1015043
#% 
#!
  
#*On categorical models of classical logic and the Geometry of Interaction.
#@Carsten Führmann,David J. Pym
#t2007
#cMathematical Structures in Computer Science
#index1015044
#% 
#!
  
#*An algebraic semantics of event-based architectures.
#@José Luiz Fiadeiro,Antónia Lopes
#t2007
#cMathematical Structures in Computer Science
#index1015045
#% 
#!
  
#*Boxed ambients with communication interfaces.
#@Pablo Garralda,Eduardo Bonelli,Adriana B. Compagnoni,Mariangiola Dezani-Ciancaglini
#t2007
#cMathematical Structures in Computer Science
#index1015046
#%114495
#%114662
#%188898
#%268698
#%546564
#%548027
#%625685
#%628760
#%866588
#%887377
#%887422
#%887419
#%888213
#%954913
#%980860
#%1014770
#%1089893
#%1091970
#%1123353
#%1123752
#%1129100
#!
  
#*Truth, modality and intersubjectivity.
#@Jean-Yves Girard
#t2007
#cMathematical Structures in Computer Science
#index1015047
#% 
#!
  
#*Preface to Special Issue devoted to the memory of Sauro Tulipani.
#@Flavio Corradini,Carlo Toffalori
#t2008
#cMathematical Structures in Computer Science
#index1015048
#% 
#!
  
#*iRho: an imperative rewriting calculus.
#@Luigi Liquori,Bernard P. Serpette
#t2008
#cMathematical Structures in Computer Science
#index1015049
#%79813
#%214149
#%268089
#%522436
#%545902
#%546278
#%548079
#%1056751
#%1077729
#%1090976
#!
  
#*Strong normalisation in two Pure Pattern Type Systems.
#@Benjamin Wack,Clément Houtmann
#t2008
#cMathematical Structures in Computer Science
#index1015050
#%484471
#%545902
#%887517
#%888493
#%950598
#%954717
#%1089446
#!
  
#*Rewriting calculi, higher-order reductions and patterns: introduction.
#@Horatiu Cirstea,Maribel Fernández
#t2008
#cMathematical Structures in Computer Science
#index1015051
#% 
#!
  
#*The Decomposition Tree for analyses of Boolean functions.
#@Maik Friedel,Swetlana Nikolajewa,Thomas Wilhelm
#t2008
#cMathematical Structures in Computer Science
#index1015052
#%3670
#%133169
#%832306
#%949897
#%960451
#%1060052
#%1078310
#%1117720
#%3401350
#%3401389
#!
  
#*Combinatorial laplacians and positivity under partial transpose.
#@Roland Hildebrand,Stefano Mancini,Simone Severini
#t2008
#cMathematical Structures in Computer Science
#index1015053
#%622219
#!
  
#*Comparative uncertainty: theory and automation.
#@Andrea Capotorti,Andrea Formisano
#t2008
#cMathematical Structures in Computer Science
#index1015054
#%632347
#%744451
#%744810
#%745711
#%746099
#%832375
#%940154
#%950224
#%3006503
#!
  
#*Observational interpretation of Casl specifications.
#@Michel Bidoit,Donald Sannella,Andrzej Tarlecki
#t2008
#cMathematical Structures in Computer Science
#index1015055
#%17335
#%40215
#%70700
#%126806
#%202275
#%493188
#%626482
#%626688
#%741384
#%889336
#%950459
#%1056524
#%1057140
#%1088973
#%1092418
#%1094495
#%1123523
#%3004603
#!
  
#*Multiple-Labelled Transition Systems for nominal calculi and their logics.
#@Rocco De Nicola,Michele Loreti
#t2008
#cMathematical Structures in Computer Science
#index1015056
#%114231
#%173056
#%484702
#%485149
#%488646
#%529971
#%760954
#%770503
#%887120
#%887422
#%888213
#%950643
#%1089893
#%1093508
#%1123526
#%1129100
#%1128902
#!
  
#*Model theory of exponentials on Lie algebras.
#@Angus Macintyre
#t2008
#cMathematical Structures in Computer Science
#index1015057
#% 
#!
  
#*Types for ambient and process mobility.
#@Mario Coppo,Mariangiola Dezani-Ciancaglini,Elio Giovannetti
#t2008
#cMathematical Structures in Computer Science
#index1015058
#%114495
#%114585
#%268698
#%269222
#%546516
#%887377
#%887419
#%888213
#%888914
#%951173
#%951333
#%1089893
#%1123353
#%1123721
#%1129100
#!
  
#*On computably locally compact Hausdorff spaces.
#@Yatao Xu,Tanja Grubba
#t2009
#cMathematical Structures in Computer Science
#index1015059
#%1089664
#%1089668
#%1089669
#%1090213
#%1094772
#%1095194
#%1095288
#!
  
#*Towards an algorithmic construction of cut-elimination procedures.
#@Agata Ciabattoni,Alexander Leitsch
#t2008
#cMathematical Structures in Computer Science
#index1015060
#%949728
#%993348
#%1007170
#%1094458
#%3005147
#%624818
#!
  
#*The Travelling Salesman Problem in symmetric circulant matrices with two stripes.
#@Ivan Gerace,Federico Greco
#t2008
#cMathematical Structures in Computer Science
#index1015061
#%839152
#%847930
#%852231
#!
  
#*Maurer computers for pipelined instruction processing.
#@Jan A. Bergstra,C. A. Middelburg
#t2008
#cMathematical Structures in Computer Science
#index1015062
#%2597
#%11377
#%740924
#%876546
#%882593
#%889870
#%949708
#%949871
#%951121
#%1056995
#%3002717
#%3005514
#!
  
#*Computation with classical sequents.
#@Steffen van Bakel,Pierre Lescanne
#t2008
#cMathematical Structures in Computer Science
#index1015063
#%191724
#%309858
#%309934
#%310151
#%487168
#%487301
#%545981
#%546602
#%887145
#%888695
#%980792
#%1091506
#%1342311
#%477350
#!
  
#*A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems.
#@Marco Bernardo,Stefania Botta
#t2008
#cMathematical Structures in Computer Science
#index1015064
#%2597
#%114349
#%887560
#%887989
#%888651
#%950643
#%950642
#%1088694
#%1089325
#%1089671
#%3005514
#!
  
#*On asymptotic divergency in equivalential logics.
#@Zofia Kostrzycka
#t2008
#cMathematical Structures in Computer Science
#index1015065
#%1014805
#!
  
#*A positive set theory with equality revisited.
#@Giacomo Lenzi
#t2008
#cMathematical Structures in Computer Science
#index1015066
#% 
#!
  
#*A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations.
#@David Sabel,Manfred Schmidt-Schauß
#t2008
#cMathematical Structures in Computer Science
#index1015067
#%29165
#%214197
#%268743
#%310018
#%546546
#%573355
#%791622
#%980936
#%1025529
#!
  
#*Semantics for a basic relevant logic with intensional conjunction and disjunction (and some of its extensions).
#@Ying Gao,Jingde Cheng
#t2008
#cMathematical Structures in Computer Science
#index1015068
#%469021
#!
  
#*Monad compositions II: Kleisli strength.
#@Ernie Manes,Philip S. Mulry
#t2008
#cMathematical Structures in Computer Science
#index1015069
#%214049
#%310035
#%494981
#%888930
#!
  
#*On the axiomatisability of priority.
#@Luca Aceto,Taolue Chen,Wan Fokkink,Anna Ingólfsdóttir
#t2008
#cMathematical Structures in Computer Science
#index1015070
#%114290
#%219446
#%268707
#%555010
#%625147
#%887357
#%887562
#%949783
#%950643
#%1088720
#%1088718
#%3005514
#!
  
#*Computability and information in models of randomness and chaos.
#@Cristobal Rojas
#t2008
#cMathematical Structures in Computer Science
#index1015071
#%268242
#%888722
#!
  
#*Graph lambda theories.
#@Antonio Bucciarelli,Antonino Salibra
#t2008
#cMathematical Structures in Computer Science
#index1015072
#% 
#!
  
#*An insertion operator preserving infinite reduction sequences.
#@David Chemouil
#t2008
#cMathematical Structures in Computer Science
#index1015073
#%71210
#%124412
#%563184
#%1014971
#%1090323
#%3004973
#!
  
#*Curry-style type isomorphisms and game semantics.
#@Joachim De Lataillade
#t2008
#cMathematical Structures in Computer Science
#index1015074
#%545893
#%886908
#%1088704
#%888303
#%484919
#%628879
#%553008
#!
  
#*Preface to the special issue: isomorphisms of types and invertibility of lambda terms.
#@Ralph Matthes,Sergei Soloviev
#t2008
#cMathematical Structures in Computer Science
#index1015075
#% 
#!
  
#*A ground-complete axiomatisation of finite-state processes in a generic process algebra.
#@Jos C. M. Baeten,Mario Bravetti
#t2008
#cMathematical Structures in Computer Science
#index1015076
#%2597
#%114113
#%114585
#%219411
#%493657
#%949871
#%950446
#%1014651
#%1089060
#%1091515
#%1117165
#%3005514
#!
  
#*Bunched polymorphism.
#@Matthew Collinson,David J. Pym,Edmund Robinson
#t2008
#cMathematical Structures in Computer Science
#index1015077
#%465210
#%485149
#%553008
#%888778
#%981063
#%1091506
#%1094122
#%1123764
#%1124036
#%2939390
#!
  
#*Reducibility of domain representations and Cantor-Weihrauch domain representations.
#@Jens Blanck
#t2008
#cMathematical Structures in Computer Science
#index1015078
#% 
#!
  
#*On the interpretation of mathematical entities in the formalisation of programming and modelling languages.
#@José Miguel Cañete Valdeón
#t2008
#cMathematical Structures in Computer Science
#index1015079
#% 
#!
  
#*On the building of affine retractions.
#@Aleksy Schubert
#t2008
#cMathematical Structures in Computer Science
#index1015080
#%2022
#%310136
#%484674
#%546468
#%546862
#%563374
#%621601
#%881506
#%888919
#%889360
#!
  
#*Theory and applications of subtyping: Introduction.
#@Adriana B. Compagnoni,Healfdene Goguen
#t2008
#cMathematical Structures in Computer Science
#index1015081
#% 
#!
  
#*Logical relations for monadic types.
#@Jean Goubault-Larrecq,Slawomir Lasota,David Nowak
#t2008
#cMathematical Structures in Computer Science
#index1015082
#%124504
#%124696
#%494384
#%495072
#%546670
#%628813
#%887579
#%888264
#%888651
#%888930
#%1014737
#%1088755
#%1094084
#!
  
#*Structural subtyping for inductive types with functorial equality rules.
#@Zhaohui Luo,Robin Adams
#t2008
#cMathematical Structures in Computer Science
#index1015083
#% 
#!
  
#*Type-based flow analysis and context-free language reachability.
#@Manuel Fähndrich,Jakob Rehof
#t2008
#cMathematical Structures in Computer Science
#index1015084
#% 
#!
  
#*Polarised subtyping for sized types.
#@Andreas Abel
#t2008
#cMathematical Structures in Computer Science
#index1015085
#% 
#!
  
#*Using groups for investigating rewrite systems.
#@Patrick Dehornoy,Vincent van Oostrom
#t2008
#cMathematical Structures in Computer Science
#index1015086
#%563298
#%563523
#%950730
#%993502
#%1094707
#%3004973
#!
  
#*Exponentiable morphisms of domains.
#@Francesca Cagliari,Sandra Mantovani
#t2008
#cMathematical Structures in Computer Science
#index1015087
#% 
#!
  
#*Boolean and classical restriction categories.
#@Robin Cockett,Ernie Manes
#t2009
#cMathematical Structures in Computer Science
#index1015088
#%268479
#%622251
#%889257
#%1014781
#%1015032
#%1090177
#%1090175
#%1093291
#!
  
#*Unary automatic graphs: an algorithmic perspective.
#@Bakhadyr Khoussainov,Jiamou Liu,Mia Minnes
#t2009
#cMathematical Structures in Computer Science
#index1015089
#%79413
#%113987
#%158504
#%481486
#%484867
#%485260
#%493313
#%953776
#%1117120
#!
  
#*On universal computably enumerable prefix codes.
#@Cristian S. Calude,Ludwig Staiger
#t2009
#cMathematical Structures in Computer Science
#index1015090
#%139129
#%822684
#%889917
#%3006743
#!
  
#*Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).
#@Jin-yi Cai,S. Barry Cooper,Angsheng Li
#t2009
#cMathematical Structures in Computer Science
#index1015091
#% 
#!
  
#*Phase transition of multivariate polynomial systems.
#@Giordano Fusco,Eric Bach
#t2009
#cMathematical Structures in Computer Science
#index1015092
#%50723
#%211993
#%451502
#%621740
#%783554
#%931630
#%1091246
#%3256500
#!
  
#*Cupping Delta enumeration degrees to 0'.
#@Mariya Ivanova Soskova,Guohua Wu
#t2009
#cMathematical Structures in Computer Science
#index1015093
#% 
#!
  
#*A note on the feasibility of generalised universal composability.
#@Andrew Chi-Chih Yao,Frances F. Yao,Yunlei Zhao
#t2009
#cMathematical Structures in Computer Science
#index1015094
#%119651
#%120076
#%210282
#%210768
#%211316
#%621633
#%985890
#%1059476
#%1062180
#%3143149
#%3256068
#!
  
#*Absolutely non-computable predicates and functions in analysis.
#@Klaus Weihrauch,Yongcheng Wu,Decheng Ding
#t2009
#cMathematical Structures in Computer Science
#index1015095
#%1095007
#%1095194
#!
  
#*The method of the Yu-Ding Theorem and its application.
#@Yun Fan
#t2009
#cMathematical Structures in Computer Science
#index1015096
#% 
#!
  
#*On traced monoidal closed categories.
#@Masahito Hasegawa
#t2009
#cMathematical Structures in Computer Science
#index1015097
#%124293
#%310005
#%485241
#%485325
#%628776
#%628797
#%820745
#%886906
#%1014599
#%1091506
#%1091718
#%1092170
#%1094604
#!
  
#*Correctness of high-level transformation systems relative to nested conditions.
#@Annegret Habel,Karl-Heinz Pennemann
#t2009
#cMathematical Structures in Computer Science
#index1015098
#%228627
#%228635
#%228655
#%228729
#%228783
#%870199
#%881839
#%882709
#%972418
#%1014780
#%1093110
#%3006700
#!
  
#*Non-cupping, measure and computably enumerable splittings.
#@George Barmpalias,Anthony Morphett
#t2009
#cMathematical Structures in Computer Science
#index1015099
#%869319
#!
  
#*Quantum multiparty communication complexity and circuit lower bounds.
#@Iordanis Kerenidis
#t2009
#cMathematical Structures in Computer Science
#index1015100
#%209857
#%621119
#%621380
#%621658
#%622482
#%622972
#%623287
#%783577
#%783617
#%819636
#%819614
#%861365
#%861431
#%971417
#!
  
#*On a measurement-free quantum lambda calculus with classical control.
#@Ugo Dal Lago,Andrea Masini,Margherita Zorzi
#t2009
#cMathematical Structures in Computer Science
#index1015101
#%211784
#%212034
#%484450
#%495053
#%819637
#%869392
#%951946
#%1014991
#%1014917
#%1058599
#%1060552
#%1060767
#%1093784
#!
  
#*Complexity of propositional projection temporal logic with star.
#@Cong Tian,Zhenhua Duan
#t2009
#cMathematical Structures in Computer Science
#index1015102
#%389299
#%484609
#%487100
#%621389
#%741653
#%838321
#%973504
#%997851
#%997632
#%1057337
#%1128403
#!
  
#*Three extensional models of type theory.
#@Benno van den Berg
#t2009
#cMathematical Structures in Computer Science
#index1015103
#%124558
#!
  
#*The space of formal balls and models of quasi-metric spaces.
#@M. Ali-Akbari,B. Honari,M. Pourmahdian,M. M. Rezaii
#t2009
#cMathematical Structures in Computer Science
#index1015104
#%887707
#%1014862
#%1089664
#%1090759
#%1092806
#!
  
#*Editors' note: bibliometrics and the curators of orthodoxy.
#@
#t2009
#cMathematical Structures in Computer Science
#index1015105
#% 
#!
  
#*Principal filters definable by parameters in E.
#@Angsheng Li,Weilin Li,Yicheng Pan,Linqing Tang
#t2009
#cMathematical Structures in Computer Science
#index1015106
#% 
#!
  
#*Automata theory based on unsharp quantum logic.
#@Yun Shang,Xian Lu,Ruqian Lu
#t2009
#cMathematical Structures in Computer Science
#index1279086
#%687061
#%818554
#%889146
#%1094123
#%1095334
#!
  
#*A quantitative computational model for complete partial metric spaces via formal balls.
#@Salvador Romaguera,Oscar Valero
#t2009
#cMathematical Structures in Computer Science
#index1279087
#%484613
#%495037
#%887707
#%1014862
#%1015013
#%1015104
#%1090757
#%1090759
#%1090767
#%1092805
#%1092806
#%1094448
#%1094449
#%1095451
#!
  
#*A theory of contracts for strong service compliance.
#@Mario Bravetti,Gianluigi Zavattaro
#t2009
#cMathematical Structures in Computer Science
#index1279088
#%542245
#%546955
#%889943
#%3005514
#!
  
#*From parametric polymorphism to models of polymorphic FPC.
#@Rasmus Ejlers Møgelberg
#t2009
#cMathematical Structures in Computer Science
#index1279089
#%310145
#%493118
#%546171
#%628879
#%1014691
#%1091506
#%1093330
#%1095902
#!
  
#*Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding.
#@Dominique Larchey-Wendling,Didier Galmiche
#t2009
#cMathematical Structures in Computer Science
#index1279090
#%484981
#%545887
#%546344
#%546898
#%624842
#%869403
#%876512
#%981106
#%1007782
#%1014967
#%1089857
#!
  
#*On the expressive power of process interruption and compensation.
#@Mario Bravetti,Gianluigi Zavattaro
#t2009
#cMathematical Structures in Computer Science
#index1279091
#%546009
#%267524
#%1091149
#%2597
#%189055
#%3005514
#%888914
#%1014840
#%951589
#%189127
#!
  
#*A type system for Discretionary Access Control.
#@Michele Bugliesi,Dario Colazzo,Silvia Crafa,Damiano Macedonio
#t2009
#cMathematical Structures in Computer Science
#index1279092
#%114009
#%124028
#%124177
#%188898
#%213619
#%546885
#%546896
#%546695
#%557934
#%881529
#%887379
#%888213
#%970459
#%980859
#%1057050
#%1093743
#%1103570
#%1123596
#%1124301
#%3162024
#!
  
#*Two-dimensional models of type theory.
#@Richard Garner
#t2009
#cMathematical Structures in Computer Science
#index1279093
#%124558
#%631793
#%887392
#%1092281
#%1096365
#!
  
#*Predicate transformers for extended probability and non-determinism.
#@Klaus Keimel,Gordon D. Plotkin
#t2009
#cMathematical Structures in Computer Science
#index1279094
#%70707
#%269071
#%484845
#%495032
#%741256
#%1091859
#%1093405
#%1123772
#%2967741
#!
  
#*The Dedekind reals in abstract Stone duality.
#@Andrej Bauer,Paul Taylor
#t2009
#cMathematical Structures in Computer Science
#index1279095
#%81620
#%870005
#%1014957
#%1089691
#%1090765
#%1094501
#!
  
#*Algebra and logic for resource-based systems modelling.
#@Matthew Collinson,David J. Pym
#t2009
#cMathematical Structures in Computer Science
#index1340690
#%79835
#%213642
#%484981
#%485149
#%545882
#%546344
#%866883
#%869403
#%876512
#%950643
#%1007782
#%1014807
#%1015077
#%1025768
#%1089058
#%1094122
#%1095600
#%1123458
#%3005514
#%3006899
#!
  
#*An expressiveness study of priority in process calculi.
#@Cristian Versari,Nadia Busi,Roberto Gorrieri
#t2009
#cMathematical Structures in Computer Science
#index1340695
#%2597
#%114061
#%173056
#%213642
#%546611
#%789689
#%866883
#%887357
#%887562
#%888914
#%888913
#%1014840
#%1089327
#%1089673
#%1089672
#%1095896
#!
  
#*Mobile Petri nets.
#@Andrea Asperti,Nadia Busi
#t2009
#cMathematical Structures in Computer Science
#index1340694
#%3498
#%546201
#%888914
#%1089332
#!
  
#*Nadia Busi's publications.
#@Gianluigi Zavattaro
#t2009
#cMathematical Structures in Computer Science
#index1340688
#% 
#!
  
#*Effective lambda-models versus recursively enumerable lambda-theories.
#@Chantal Berline,Giulio Manzonetto,Antonino Salibra
#t2009
#cMathematical Structures in Computer Science
#index1340693
#% 
#!
  
#*Deciding reachability problems in Turing-complete fragments of Mobile Ambients.
#@Nadia Busi,Gianluigi Zavattaro
#t2009
#cMathematical Structures in Computer Science
#index1340696
#%3498
#%384739
#%545887
#%546516
#%868186
#%869564
#%887377
#%888913
#%951589
#%1089538
#%1089825
#%1089893
#%1090458
#%1093183
#%1094184
#%1123353
#%1123721
#!
  
#*Efficient computation in rational-valued P systems.
#@Nadia Busi,Miguel A. Gutiérrez-Naranjo,Mario J. Pérez-Jiménez
#t2009
#cMathematical Structures in Computer Science
#index1340687
#%972802
#%993684
#!
  
#*The algebraic lambda calculus.
#@Lionel Vaux
#t2009
#cMathematical Structures in Computer Science
#index1340686
#%951311
#%1014704
#%1090870
#%1091506
#%3006100
#!
  
#*Process discovery and Petri nets.
#@Nadia Busi,G. Michele Pinna
#t2009
#cMathematical Structures in Computer Science
#index1340685
#%17330
#%25084
#%45045
#%45123
#%114142
#%114185
#%671922
#%685350
#%740746
#%845481
#%882877
#%1112310
#!
  
#*The sequential topology on is not regular.
#@Matthias Schröder
#t2009
#cMathematical Structures in Computer Science
#index1340684
#%267313
#%1094491
#%3004668
#!
  
#*On the expressive power of recursion, replication and iteration in process calculi.
#@Nadia Busi,Maurizio Gabbrielli,Gianluigi Zavattaro
#t2009
#cMathematical Structures in Computer Science
#index1340691
#%548154
#%888440
#%888913
#%951589
#%1091149
#%3005514
#!
  
#*Structural non-interference in elementary and trace nets.
#@Nadia Busi,Roberto Gorrieri
#t2009
#cMathematical Structures in Computer Science
#index1340683
#%3498
#%17330
#%124066
#%213609
#%213618
#%866639
#%949871
#%1128108
#%3005514
#%3555772
#!
  
#*(Tissue) P systems with cell polarity.
#@Daniela Besozzi,Nadia Busi,Paolo Cazzaniga,Claudio Ferretti,Alberto Leporati,Giancarlo Mauri,Dario Pescini,Claudio Zandron
#t2009
#cMathematical Structures in Computer Science
#index1340692
#%105455
#%665157
#%665169
#%951589
#%972802
#%1025256
#%1069434
#%1091269
#%1093257
#%1093937
#!
  
#*Foreword: special issue in memory of Nadia Busi.
#@Luca Aceto,Anna Ingólfsdóttir
#t2009
#cMathematical Structures in Computer Science
#index1340697
#% 
#!
  
#*Social processes, program verification and all that.
#@Andrea Asperti,Herman Geuvers,Raja Natarajan
#t2009
#cMathematical Structures in Computer Science
#index1340689
#%487301
#%546430
#%546822
#%546911
#%581504
#%629588
#%771172
#%772823
#%887145
#%954772
#%1117280
#%1123571
#%3169345
#!
  
#*On universal algebra over nominal sets.
#@Alexander Kurz,Daniela Petrisan
#t2010
#cMathematical Structures in Computer Science
#index2866538
#%484680
#%484702
#%485342
#%869416
#%870048
#%1226539
#!
  
#*Domain representations of spaces of compact subsets.
#@Ulrich Berger,Jens Blanck,Petter Kristian Køber
#t2010
#cMathematical Structures in Computer Science
#index2866547
#%269071
#%866445
#%1089443
#!
  
#*Towards a typed Geometry of Interaction.
#@Esfandiar Haghverdi,Philip J. Scott
#t2010
#cMathematical Structures in Computer Science
#index2866544
#%108573
#%484700
#%485338
#%546235
#%628776
#%628839
#%886906
#%1014599
#%1014813
#%1014784
#%1014917
#%1015097
#%1091506
#%1091718
#%1092007
#%1092170
#!
  
#*Rewriting systems for the surface classification theorem.
#@Gabriele Pulcini
#t2010
#cMathematical Structures in Computer Science
#index2866533
#%1014801
#%1014756
#!
  
#*Iterative reflections of monads.
#@Jirí Adámek,Stefan Milius,Jiri Velebil
#t2010
#cMathematical Structures in Computer Science
#index2866537
#%213959
#%484680
#%626436
#%889919
#%1014989
#%1088611
#%1238685
#!
  
#*Coherence for monoidal endofunctors.
#@Kosta Dosen,Zoran Petric
#t2010
#cMathematical Structures in Computer Science
#index2866551
#%888930
#%2866535
#!
  
#*Diagrammatic logic applied to a parameterisation process.
#@César Domínguez,Dominique Duval
#t2010
#cMathematical Structures in Computer Science
#index2866536
#%109642
#%486468
#%1091535
#%1094318
#!
  
#*Long-run cost analysis by approximation of linear operators over dioids.
#@David Cachera,Thomas P. Jensen,Arnaud Jobin,Pascal Sotin
#t2010
#cMathematical Structures in Computer Science
#index2866550
#%16108
#%40291
#%210198
#%484430
#%546057
#%548166
#%581587
#%744470
#%866405
#%949763
#%1094025
#%1095855
#!
  
#*Channel abstractions for network security.
#@Michele Bugliesi,Riccardo Focardi
#t2010
#cMathematical Structures in Computer Science
#index2866545
#%83976
#%124201
#%124191
#%173423
#%267159
#%268665
#%545903
#%545901
#%546903
#%886872
#%888913
#%1014797
#%1088626
#%1092058
#!
  
#*A solution of the uniform word problem for ortholattices.
#@Andrea Meinander
#t2010
#cMathematical Structures in Computer Science
#index2866543
#%887531
#%1014826
#!
  
#*Realisability semantics of parametric polymorphism, general references and recursive types.
#@Lars Birkedal,Kristian Støvring,Jacob Thamsborg
#t2010
#cMathematical Structures in Computer Science
#index2866528
#%189093
#%267560
#%268855
#%484400
#%546994
#%628978
#%868582
#%869413
#%886911
#%888778
#%888856
#%888930
#%1006844
#%1240621
#%1247162
#%2939390
#%3005873
#!
  
#*Domain theoretic characterisations of quasi-metric completeness in terms of formal balls.
#@Salvador Romaguera,Oscar Valero
#t2010
#cMathematical Structures in Computer Science
#index2866542
#%484613
#%495037
#%887707
#%1014862
#%1015013
#%1015104
#%1090757
#%1090759
#%1090767
#%1092806
#%1094448
#%1094449
#%1095451
#%1279087
#!
  
#*Modal and mixed specifications: key decision problems and their complexities.
#@Adam Antonik,Michael Huth,Kim G. Larsen,Ulrik Nyman,Andrzej Wasowski
#t2010
#cMathematical Structures in Computer Science
#index2866541
#%61364
#%212898
#%451138
#%601319
#%625305
#%627565
#%870229
#%876298
#%934819
#%949951
#%1056624
#%1095410
#%1123453
#!
  
#*Selection functions, bar recursion and backward induction.
#@Martín Hötzel Escardó,Paulo Oliva
#t2010
#cMathematical Structures in Computer Science
#index2866548
#%3582
#%139266
#%485343
#%869406
#%888930
#%1014997
#%1015014
#%1094491
#!
  
#*Setoids and universes.
#@Olov Wilander
#t2010
#cMathematical Structures in Computer Science
#index2866529
#%94970
#%1014973
#!
  
#*Bitopological duality for distributive lattices and Heyting algebras.
#@Guram Bezhanishvili,Nick Bezhanishvili,David Gabelaia,Alexander Kurz
#t2010
#cMathematical Structures in Computer Science
#index2866530
#%269408
#%485342
#!
  
#*Tree-functors, determinacy and bisimulations.
#@Rocco De Nicola,Daniele Gorla,Anna Labella
#t2010
#cMathematical Structures in Computer Science
#index2866540
#%114561
#%126791
#%486214
#%559632
#%627565
#%950446
#%1014719
#%1014859
#%1092902
#%1094254
#%1094318
#%3005514
#%124379
#!
  
#*Coherence for monoidal monads and comonads.
#@Kosta Dosen,Zoran Petric
#t2010
#cMathematical Structures in Computer Science
#index2866535
#%888930
#%2866551
#!
  
#*Turing universality of the Biochemical Ground Form.
#@Luca Cardelli,Gianluigi Zavattaro
#t2010
#cMathematical Structures in Computer Science
#index2866549
#%1095975
#%1340691
#!
  
#*On the operating unit size of load/store architectures.
#@Jan A. Bergstra,C. A. Middelburg
#t2010
#cMathematical Structures in Computer Science
#index2866546
#%2597
#%267351
#%882593
#%951121
#%1015062
#%1056995
#%3002717
#%3005514
#!
  
#*The limit-colimit coincidence theorem for -categories.
#@Mateusz Kostanek,Pawel Waszkiewicz
#t2010
#cMathematical Structures in Computer Science
#index2866531
#% 
#!
  
#*De Groot duality and models of choice: angels, demons and nature.
#@Jean Goubault-Larrecq
#t2010
#cMathematical Structures in Computer Science
#index2866539
#%114519
#%213925
#%213923
#%484613
#%484844
#%495069
#%867893
#%868980
#%870450
#%972750
#%1090757
#%1095077
#!
  
#*Preface for the special issue on domains.
#@Bernhard Reus,Achim Jung,Klaus Keimel,Thomas Streicher
#t2010
#cMathematical Structures in Computer Science
#index2866552
#% 
#!
  
#*Some reasons for generalising domain theory.
#@Martin Hyland
#t2010
#cMathematical Structures in Computer Science
#index2866532
#%66660
#%124295
#%124466
#%267199
#%268860
#%484679
#%494707
#%628779
#%887515
#%1015031
#%1014738
#%1091506
#%1091761
#%1092170
#%1279095
#%3005873
#!
  
#*Preface to special issue: Expressiveness in Concurrency 2008.
#@Thomas Hildebrandt,Daniele Gorla
#t2010
#cMathematical Structures in Computer Science
#index2866534
#% 
#!
  
#*Spatial search on a honeycomb network.
#@G. Abal,R. Donangelo,Franklin L. Marquezino,Renato Portugal
#t2010
#cMathematical Structures in Computer Science
#index2925976
#%209745
#%209892
#%609792
#%622193
#%1058576
#!
  
#*Continuous-time quantum walks on the threshold network model.
#@Yusuke Ide,Norio Konno
#t2010
#cMathematical Structures in Computer Science
#index2925985
#%2897019
#!
  
#*Semantical proofs of correctness for programs performing non-deterministic tests on real numbers.
#@Thomas Anberrée
#t2010
#cMathematical Structures in Computer Science
#index2925974
#%1089665
#%1095680
#%3002070
#!
  
#*Introduction to special issue: Physics and computer science - quantum computation and other approaches.
#@Salvador Elías Venegas-Andraca
#t2010
#cMathematical Structures in Computer Science
#index2925988
#% 
#!
  
#*Tilings: simulation and universality.
#@Grégory Lafitte,Michael Weiss
#t2010
#cMathematical Structures in Computer Science
#index2925977
#%158513
#%620936
#%621885
#%626064
#%626107
#%816343
#%826254
#%862058
#%1090018
#%1090679
#!
  
#*Quantum walks and elliptic integrals.
#@Norio Konno
#t2010
#cMathematical Structures in Computer Science
#index2925978
#%621246
#%2897019
#!
  
#*Observing the superposition of a single particle with the vacuum.
#@Luis Manuel Rico Gutierrez,Veiko Palge,Jacob Dunningham
#t2010
#cMathematical Structures in Computer Science
#index2925971
#% 
#!
  
#*Connection between logical and algebraic approaches to concurrent systems.
#@Naijun Zhan
#t2010
#cMathematical Structures in Computer Science
#index2925987
#%2597
#%70790
#%114331
#%114439
#%211625
#%213797
#%484609
#%620655
#%621389
#%886902
#%888057
#%889518
#%949550
#%1060205
#%1088694
#%1093209
#%1211593
#%3003848
#%3005514
#!
  
#*A separation between divergence and Holevo information for ensembles.
#@Rahul Jain,Ashwin Nayak,Yi Su
#t2010
#cMathematical Structures in Computer Science
#index2925972
#%104616
#%211023
#%986141
#%1277112
#!
  
#*A note on accelerated Turing machines.
#@Cristian S. Calude,Ludwig Staiger
#t2010
#cMathematical Structures in Computer Science
#index2925984
#%634994
#%1094070
#%1094573
#!
  
#*The computational SLR: a logic for reasoning about computational indistinguishability.
#@Yu Zhang
#t2010
#cMathematical Structures in Computer Science
#index2925969
#%124559
#%211462
#%315065
#%546670
#%546990
#%613547
#%783621
#%888930
#%972271
#%1093524
#%3141431
#%3256553
#!
  
#*The Travelling Salesman Problem for finite-sized cities.
#@Hugo Fort,Mordechai Kornbluth,Fredy Zypman
#t2010
#cMathematical Structures in Computer Science
#index2925983
#%387927
#%744926
#%952867
#!
  
#*On the von Neumann entropy of certain quantum walks subject to decoherence.
#@Chaobin Liu,Nelson Petulante
#t2010
#cMathematical Structures in Computer Science
#index2925989
#%621248
#%621246
#%2897019
#!
  
#*Diamond embeddings into the enumeration degrees.
#@Andrea Sorbi,Guohua Wu,Yue Yang
#t2010
#cMathematical Structures in Computer Science
#index2925982
#%626126
#!
  
#*Limits to measurement in experiments governed by algorithms.
#@Edwin J. Beggs,José Félix Costa,John V. Tucker
#t2010
#cMathematical Structures in Computer Science
#index2925970
#%1089105
#%1095518
#%95001
#%626085
#%633446
#%1089627
#!
  
#*Quantitative aspects of speed-up and gap phenomena.
#@Klaus Ambos-Spies,Thorsten Kräling
#t2010
#cMathematical Structures in Computer Science
#index2925975
#%211410
#%949829
#%949789
#%972559
#%972933
#%1089840
#%1093386
#!
  
#*A practical parameterised algorithm for the individual haplotyping problem MLF.
#@Minzhu Xie,Jianxin Wang,Jianer Chen
#t2010
#cMathematical Structures in Computer Science
#index2925981
#%186359
#%438596
#%650548
#%750941
#%766414
#%782833
#%924094
#%973393
#!
  
#*Bounded minimalisation and bounded counting in argument-bounded idc's.
#@Mathias Barra
#t2010
#cMathematical Structures in Computer Science
#index2925968
#%211338
#%626048
#%626046
#%783715
#%932300
#%980963
#%1090931
#%1092386
#%1117209
#!
  
#*Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009).
#@Manindra Agrawal,S. Barry Cooper,Angsheng Li
#t2010
#cMathematical Structures in Computer Science
#index2925986
#% 
#!
  
#*Quantum algorithmic methods for computational geometry.
#@Marco Lanzagorta,Jeffrey K. Uhlmann
#t2010
#cMathematical Structures in Computer Science
#index2925973
#%3482
#%803498
#!
  
#*Weak bisimulations for the Giry monad.
#@Ernst-Erich Doberkat
#t2010
#cMathematical Structures in Computer Science
#index2925979
#%888930
#%1059040
#%2939581
#!
  
#*Axiomatic semantics of projection temporal logic programs.
#@Xiaoxiao Yang,Zhenhua Duan,Qian Ma
#t2010
#cMathematical Structures in Computer Science
#index2925980
#%175325
#%327754
#%487100
#%664433
#%741653
#%772823
#%973504
#%984515
#%993329
#%1057337
#%1089760
#%1123699
#%1129042
#%3003848
#!
  
#*Pointwise extensions of GSOS-defined operations.
#@Helle Hvid Hansen,Bartek Klin
#t2011
#cMathematical Structures in Computer Science
#index3075879
#%126785
#%485186
#%559591
#%890112
#%1092971
#%1094319
#%1094318
#%1095255
#!
  
#*A system of interaction and structure V: the exponentials and splitting.
#@Alessio Guglielmi,Lutz Straßburger
#t2011
#cMathematical Structures in Computer Science
#index3075886
#% 
#!
  
#*Domains occur among spaces as strict algebras among lax.
#@Rory B. B. Lucyshyn-Wright
#t2011
#cMathematical Structures in Computer Science
#index3075873
#% 
#!
  
#*Foreword: special issue on coalgebraic logic.
#@Ernst-Erich Doberkat,Alexander Kurz
#t2011
#cMathematical Structures in Computer Science
#index3075874
#% 
#!
  
#*Traces for coalgebraic components.
#@Ichiro Hasuo,Bart Jacobs
#t2011
#cMathematical Structures in Computer Science
#index3075882
#%213779
#%213906
#%485241
#%485186
#%888930
#%890112
#%998048
#%1014599
#%1014627
#%1014875
#%1056603
#%1056883
#%1089151
#%1094318
#%1238679
#%1338810
#%2920310
#%2920308
#!
  
#*The formal ball model for -categories.
#@Mateusz Kostanek,Pawel Waszkiewicz
#t2011
#cMathematical Structures in Computer Science
#index3075883
#%484613
#%880732
#%887707
#%1014696
#%1014862
#%1015104
#%1090757
#%1090759
#%1091210
#%1092806
#%1094321
#%1096242
#%1223565
#%1279087
#!
  
#*Coalgebraic logic over general measurable spaces - a survey.
#@Ernst-Erich Doberkat,Christoph Schubert
#t2011
#cMathematical Structures in Computer Science
#index3075876
#%626128
#%626127
#%866963
#%869429
#%887611
#%888651
#%889907
#%1014668
#%1014692
#%1059040
#%1094318
#%1095940
#%1127381
#%1240184
#%2864743
#%2925793
#%2925778
#%2939581
#!
  
#*Noetherian orders.
#@Hervé Perdry,Peter Schuster
#t2011
#cMathematical Structures in Computer Science
#index3075889
#%994015
#%1015004
#!
  
#*Equational presentations of functors and monads.
#@Jiri Velebil,Alexander Kurz
#t2011
#cMathematical Structures in Computer Science
#index3075884
#%484702
#%869416
#%889935
#%1006850
#%1226539
#%2866538
#%3005241
#!
  
#*The structure of first-order causality.
#@Samuel Mimram
#t2011
#cMathematical Structures in Computer Science
#index3075875
#%17589
#%484823
#%546908
#%548085
#%888303
#%1089817
#%1093341
#!
  
#*The representational adequacy of Hybrid.
#@Roy L. Crole
#t2011
#cMathematical Structures in Computer Science
#index3075881
#% 
#!
  
#*Initial algebras and terminal coalgebras in many-sorted sets.
#@Jirí Adámek,Vera Trnková
#t2011
#cMathematical Structures in Computer Science
#index3075885
#% 
#!
  
#*On monotone modalities and adjointness.
#@Marta Bílková,Jiri Velebil,Yde Venema
#t2011
#cMathematical Structures in Computer Science
#index3075880
#%487426
#%829217
#%1093931
#%1238693
#%1271165
#%2781321
#%2853899
#!
  
#*Stably compact spaces.
#@Jimmie Lawson
#t2011
#cMathematical Structures in Computer Science
#index3075878
#%185478
#%269071
#%870450
#%2866539
#!
  
#*Choquet-Kendall-Matheron theorems for non-Hausdorff spaces.
#@Jean Goubault-Larrecq,Klaus Keimel
#t2011
#cMathematical Structures in Computer Science
#index3075887
#% 
#!
  
#*Non-uniform (hyper/multi)coherence spaces.
#@Pierre Boudes
#t2011
#cMathematical Structures in Computer Science
#index3075877
#%124488
#%625581
#%628797
#%867231
#%887413
#%887741
#%887401
#%888875
#%1014704
#%1090868
#%1091506
#%1093432
#!
  
#*Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra.
#@Lutz Schröder,Dirk Pattinson
#t2011
#cMathematical Structures in Computer Science
#index3075888
#%213956
#%213896
#%478364
#%485206
#%556578
#%629312
#%888651
#%949658
#%949951
#%1089151
#%1094318
#%1095085
#%1095892
#%1095940
#%1117259
#%1117315
#%1249622
#%2925776
#!
  
#*Elgot theories: a new perspective on the equational properties of iteration.
#@Jirí Adámek,Stefan Milius,Jiri Velebil
#t2011
#cMathematical Structures in Computer Science
#index3075872
#%484680
#%485241
#%889919
#%971887
#%1014989
#%1088611
#%1093596
#%1093597
#%1238685
#%1252108
#%1271159
#%2806270
#%2866537
#%2921703
#!
  
#*Formalising foundations of mathematics.
#@Mihnea Iancu,Florian Rabe
#t2011
#cMathematical Structures in Computer Science
#index3131969
#% 
#!
  
#*Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables.
#@Murdoch James Gabbay
#t2011
#cMathematical Structures in Computer Science
#index3131965
#% 
#!
  
#*Type classes for mathematics in type theory.
#@Bas Spitters,Eelis van der Weegen
#t2011
#cMathematical Structures in Computer Science
#index3131975
#% 
#!
  
#*Formalising Overlap Algebras in Matita.
#@Claudio Sacerdoti Coen,Enrico Tassi
#t2011
#cMathematical Structures in Computer Science
#index3131972
#% 
#!
  
#*A formal study of Bernstein coefficients and polynomials.
#@Yves Bertot,Frédérique Guilhot,Assia Mahboubi
#t2011
#cMathematical Structures in Computer Science
#index3131970
#% 
#!
  
#*Preface.
#@Gérard P. Huet
#t2011
#cMathematical Structures in Computer Science
#index3131973
#% 
#!
  
#*Zen and the art of formalisation.
#@Andrea Asperti,Jeremy Avigad
#t2011
#cMathematical Structures in Computer Science
#index3131966
#% 
#!
  
#*Dagger extension theorem.
#@Zoltán Ésik,Tamás Hajgató
#t2011
#cMathematical Structures in Computer Science
#index3131978
#% 
#!
  
#*A pluralist approach to the formalisation of mathematics.
#@Robin Adams,Zhaohui Luo
#t2011
#cMathematical Structures in Computer Science
#index3131979
#% 
#!
  
#*Formal proofs for theoretical properties of Newton's method.
#@Ioana Pasca
#t2011
#cMathematical Structures in Computer Science
#index3131968
#% 
#!
  
#*A formal proof of Pick's Theorem.
#@John Harrison
#t2011
#cMathematical Structures in Computer Science
#index3131967
#%209238
#%1256604
#!
  
#*CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
#@Frédéric Blanqui,Adam Koprowski
#t2011
#cMathematical Structures in Computer Science
#index3131971
#% 
#!
  
#*Classical mathematics for a constructive world.
#@Russell O'Connor
#t2011
#cMathematical Structures in Computer Science
#index3131976
#% 
#!
  
#*The λ-calculus in the π-calculus.
#@Xiaojuan Cai,Yuxi Fu
#t2011
#cMathematical Structures in Computer Science
#index3131974
#% 
#!
  
#*Final coalgebras in accessible categories.
#@Panagis Karazeris,Apostolos Matzaris,Jiri Velebil
#t2011
#cMathematical Structures in Computer Science
#index3131977
#% 
#!
  
#*Non-disclosure for distributed mobile code.
#@Ana Almeida Matos,Jan Cederquist
#t2011
#cMathematical Structures in Computer Science
#index3247634
#%124107
#%124068
#%185631
#%188900
#%219820
#%546320
#%546561
#%572931
#%613049
#%625627
#%771214
#%889799
#%970566
#%970642
#%1089608
#%1089893
#%1123353
#%1123596
#%1124301
#%1240163
#%2863622
#%546493
#!
  
#*Secure information flow by self-composition.
#@Gilles Barthe,Pedro R. D'Argenio,Tamara Rezk
#t2011
#cMathematical Structures in Computer Science
#index3247632
#%84293
#%123867
#%124028
#%124212
#%267211
#%485149
#%542973
#%545962
#%545913
#%545921
#%546229
#%546338
#%546344
#%546564
#%546763
#%568868
#%613049
#%628090
#%771237
#%772823
#%970642
#%1056907
#%1095597
#%1123281
#%1123449
#%1256332
#%2781797
#%2853628
#!
  
#*On the computational complexity of dynamic slicing problems for program schemas.
#@Sebastian Danicic,Robert M. Hierons,Michael R. Laurence
#t2011
#cMathematical Structures in Computer Science
#index3247633
#%125051
#%364359
#%364208
#%465518
#%542338
#%543306
#%546554
#%576871
#%621778
#%790184
#%932255
#%933040
#%951500
#%972554
#%1073377
#%1075998
#%1089405
#%1092915
#%1093628
#%1094336
#%1095568
#%1128154
#!
  
#*Provenance as dependency analysis.
#@James Cheney,Amal Ahmed,Umut A. Acar
#t2011
#cMathematical Structures in Computer Science
#index3247631
#%71
#%145204
#%156328
#%299967
#%301360
#%304004
#%309844
#%310174
#%363361
#%530389
#%538403
#%544880
#%545595
#%545562
#%545606
#%545891
#%545911
#%546057
#%546561
#%546888
#%598235
#%613952
#%636596
#%642038
#%643982
#%811436
#%823543
#%832268
#%970642
#%970721
#%973129
#%1064729
#%1065671
#%1089796
#%1118296
#%1230095
#%1247157
#!
  
#*Non-termination and secure information flow.
#@Geoffrey Smith,Rafael Alpízar
#t2011
#cMathematical Structures in Computer Science
#index3247637
#%84167
#%124022
#%124068
#%124137
#%189475
#%484365
#%543060
#%542974
#%545916
#%546763
#%546923
#%546903
#%771237
#%888651
#%970643
#%970660
#%970642
#%2799232
#!
  
#*Modelling declassification policies using abstract domain completeness.
#@Isabella Mastroeni,Anindya Banerjee
#t2011
#cMathematical Structures in Computer Science
#index3247636
#%124022
#%124186
#%267211
#%542957
#%542970
#%545962
#%546062
#%546058
#%546229
#%546057
#%572679
#%613049
#%613912
#%613900
#%620456
#%646883
#%771310
#%820199
#%869427
#%950411
#%1006848
#%1006887
#%1056907
#%1060205
#%1090236
#%2863617
#%3005873
#!
  
#*Foreword: programming language interference and dependence.
#@David Clark,Roberto Giacobazzi,Chunyan Mu
#t2011
#cMathematical Structures in Computer Science
#index3247635
#% 
#!
  
#*systèmes schématiques généralises.
#@Laurent Kott
#t1977
#cTheoretical Computer Science
#index627459
#% 
#!
  
#*A comparative study of one-counter Ianov schemes.
#@Tadashi Ae,Toru Kikuno,Norio Tamura
#t1977
#cTheoretical Computer Science
#index627460
#% 
#!
  
#*Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen.
#@Helmut Alt
#t1977
#cTheoretical Computer Science
#index627461
#% 
#!
  
#*Cycle-Free N-Algebraic Systems.
#@Werner Kuich
#t1981
#cTheoretical Computer Science
#index627462
#% 
#!
  
#*Gylindres de languages simples et pseudo-simples.
#@Jean-Michel Autebert
#t1977
#cTheoretical Computer Science
#index627463
#% 
#!
  
#*Complexity theory on real numbers and functions.
#@Christoph Kreitz,Klaus Weihrauch
#t1983
#cTheoretical Computer Science
#index627464
#% 
#!
  
#*Un resultat de discontinuité dans les familles de langages.
#@Jean-Michel Autebert
#t1981
#cTheoretical Computer Science
#index627465
#% 
#!
  
#*A multifit algorithm for uniform multiprocessor scheduling.
#@Manfred Kunde
#t1983
#cTheoretical Computer Science
#index627466
#% 
#!
  
#*P-Complete Problems in Free Groups.
#@Jürgen Avenhaus,Klaus Madlener
#t1981
#cTheoretical Computer Science
#index627467
#% 
#!
  
#*Sur deux langages linéaires.
#@Michel Latteux
#t1979
#cTheoretical Computer Science
#index627468
#% 
#!
  
#*Interprocedural data flow systems.
#@Gerhard Barth
#t1983
#cTheoretical Computer Science
#index627469
#% 
#!
  
#*The LBA-problem and the transormability of the class epsilon.
#@Burkhard Monien
#t1977
#cTheoretical Computer Science
#index627470
#% 
#!
  
#*Centers of Languages.
#@Luc Boasson,Maurice Nivat
#t1981
#cTheoretical Computer Science
#index627471
#% 
#!
  
#*Reachability Analysis with Assertion Systems.
#@Horst Müller
#t1981
#cTheoretical Computer Science
#index627472
#% 
#!
  
#*Strong Non-Deterministic Context-Free Languages.
#@Joffroy Beauquier
#t1979
#cTheoretical Computer Science
#index627473
#% 
#!
  
#*A general scheme for some deterministically parsable grammars and their strong equivalents.
#@Anton Nijholt,Jan Pittl
#t1983
#cTheoretical Computer Science
#index627474
#% 
#!
  
#*On the crossing-free, rectangular embedding of weighted graphs in the plane.
#@Bernd Becker
#t1983
#cTheoretical Computer Science
#index627475
#% 
#!
  
#*A decidability result about sufficient-completeness of axiomatically specified abstract data types.
#@Tobias Nipkow,Gerhard Weikum
#t1983
#cTheoretical Computer Science
#index627476
#% 
#!
  
#*Information Content Characterizations of Complexity Theoretic Properties.
#@Victor L. Bennison
#t1979
#cTheoretical Computer Science
#index627477
#% 
#!
  
#*On alpha-balanced Binary Search Trees.
#@Henk J. Olivié
#t1981
#cTheoretical Computer Science
#index627478
#% 
#!
  
#*On polynomial time isomorphisms of complete sets.
#@Leonard Berman,Juris Hartmanis
#t1977
#cTheoretical Computer Science
#index627479
#% 
#!
  
#*Node-Visit Optimal 1-2 Brother Trees.
#@Thomas Ottmann,Arnold L. Rosenberg,Hans-Werner Six,Derick Wood
#t1979
#cTheoretical Computer Science
#index627480
#% 
#!
  
#*Discreteness, k-density and d-continuity of occurrence nets.
#@Eike Best,Agathe Merceron
#t1983
#cTheoretical Computer Science
#index627481
#% 
#!
  
#*Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.
#@Mark H. Overmars,Jan van Leeuwen
#t1981
#cTheoretical Computer Science
#index627482
#% 
#!
  
#*A syntactic connection between proof procedures and refutation prcedures.
#@Wolfgang Bibel
#t1977
#cTheoretical Computer Science
#index627483
#% 
#!
  
#*A Decidable Property of Iterated Morphisms.
#@Jean-Jacques Pansiot
#t1981
#cTheoretical Computer Science
#index627484
#% 
#!
  
#*Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.
#@Norbert Blum,Kurt Mehlhorn
#t1979
#cTheoretical Computer Science
#index627485
#% 
#!
  
#*Theory of concurrency control.
#@Christos H. Papadimitriou
#t1983
#cTheoretical Computer Science
#index627486
#% 
#!
  
#*Move Rules and Trade-Offs in the Pebble Game.
#@Peter van Emde Boas,Jan van Leeuwen
#t1979
#cTheoretical Computer Science
#index627487
#% 
#!
  
#*Two remarks on the power of counting.
#@Christos H. Papadimitriou,Stathis Zachos
#t1983
#cTheoretical Computer Science
#index627488
#% 
#!
  
#*Un langage algébrique non-générateur.
#@Luc Boasson
#t1977
#cTheoretical Computer Science
#index627489
#% 
#!
  
#*Context-Free Sets of Infinite Words.
#@Luc Boasson
#t1979
#cTheoretical Computer Science
#index627490
#% 
#!
  
#*New bounds on formula size.
#@Mike Paterson
#t1977
#cTheoretical Computer Science
#index627491
#% 
#!
  
#*Some Applications of CFL's over Infinte Alphabets.
#@Luc Boasson
#t1981
#cTheoretical Computer Science
#index627492
#% 
#!
  
#*A Graph Theoretic Approach to Determinism versus Non-Determinism.
#@Wolfgang J. Paul,Rüdiger Reischuk
#t1979
#cTheoretical Computer Science
#index627493
#% 
#!
  
#*(Erasing)* Strings.
#@Ronald V. Book,Matthias Jantzen,Celia Wrathall
#t1981
#cTheoretical Computer Science
#index627494
#% 
#!
  
#*Codes et sous-monoides possedant des mots neutres.
#@Dominique Perri,Marcel Paul Schützenberger
#t1977
#cTheoretical Computer Science
#index627495
#% 
#!
  
#*Controlled relativizations of P and NP.
#@Ronald V. Book,Timothy J. Long,Alan L. Selman
#t1983
#cTheoretical Computer Science
#index627496
#% 
#!
  
#*Informationque et algébre la theorie des codes a longueur variable.
#@Jean-François Perrot
#t1977
#cTheoretical Computer Science
#index627497
#% 
#!
  
#*A new Recursion Induction Principle.
#@Gérard Boudol
#t1979
#cTheoretical Computer Science
#index627498
#% 
#!
  
#*Une caractérisation de trois variétés de langages bien connues.
#@Jean-Eric Pin
#t1979
#cTheoretical Computer Science
#index627499
#% 
#!
  
#*On one-way auxiliary pushdown automata.
#@Franz-Josef Brandenburg
#t1977
#cTheoretical Computer Science
#index627500
#% 
#!
  
#*Un analogue du théorème des variétés pour les cones et les cylindres.
#@Jean-Eric Pin
#t1981
#cTheoretical Computer Science
#index627501
#% 
#!
  
#*On the Height of Syntactical Graphs.
#@Franz-Josef Brandenburg
#t1981
#cTheoretical Computer Science
#index627502
#% 
#!
  
#*Some operations and transductions that preserve rationality.
#@Jean-Eric Pin,Jacques Sakarovitch
#t1983
#cTheoretical Computer Science
#index627503
#% 
#!
  
#*The computational complexity of certain graph grammars.
#@Franz-Josef Brandenburg
#t1983
#cTheoretical Computer Science
#index627504
#% 
#!
  
#*On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.
#@Axel Poigné
#t1983
#cTheoretical Computer Science
#index627505
#% 
#!
  
#*Finite-Change Automata.
#@Burchard von Braunmühl,Rutger Verbeek
#t1979
#cTheoretical Computer Science
#index627506
#% 
#!
  
#*Über eine minimale universelle Turing-Maschine.
#@Lutz Priese
#t1979
#cTheoretical Computer Science
#index627507
#% 
#!
  
#*Ein vollständiges Problem auf der Baummaschine.
#@H. Bremer
#t1977
#cTheoretical Computer Science
#index627508
#% 
#!
  
#*Eigenschaften färbbarer Petri-Netze.
#@Rainer Prinoth
#t1977
#cTheoretical Computer Science
#index627509
#% 
#!
  
#*Prefix-Preservation fo Rational Partial Functions Is Decidable.
#@Christian Choffrut
#t1981
#cTheoretical Computer Science
#index627510
#% 
#!
  
#*Sur les variétés de langages et de monoídes.
#@Christophe Reutenauer
#t1979
#cTheoretical Computer Science
#index627511
#% 
#!
  
#*Partial functions in constructive formal theories.
#@Robert L. Constable
#t1983
#cTheoretical Computer Science
#index627512
#% 
#!
  
#*Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen.
#@C. Reynvaan,Claus-Peter Schnorr
#t1977
#cTheoretical Computer Science
#index627513
#% 
#!
  
#*On a description of tree-languages by languages.
#@Bruno Courcelle
#t1977
#cTheoretical Computer Science
#index627514
#% 
#!
  
#*Familles de languages fermées par crochet et crochet ouvert.
#@F. Rodriguez
#t1977
#cTheoretical Computer Science
#index627515
#% 
#!
  
#*Higher type program schemes and their tree languages.
#@Werner Damm
#t1977
#cTheoretical Computer Science
#index627516
#% 
#!
  
#*Automaten in planaren Graphen.
#@Hans-Anton Rollik
#t1979
#cTheoretical Computer Science
#index627517
#% 
#!
  
#*Grobstrukturen für kontextfreie Grammatiken.
#@Ernst-Wolfgang Dieterich
#t1977
#cTheoretical Computer Science
#index627518
#% 
#!
  
#*Computable Algebras, Word Problems and Canonical Term Algebras.
#@Herbert Klaeren,Martin Schulz
#t1981
#cTheoretical Computer Science
#index627519
#% 
#!
  
#*On the Subword Complexity and Square-Freeness of Formal Languages.
#@Andrzej Ehrenfeucht,Grzegorz Rozenberg
#t1981
#cTheoretical Computer Science
#index627520
#% 
#!
  
#*Théorème de transversale rationnelle pour les automates à pile déterministes.
#@Jacques Sakarovitch
#t1979
#cTheoretical Computer Science
#index627521
#% 
#!
  
#*Bemerkungen zu den Übergangshalbgruppen linear realisierbarer Automaten.
#@Lutz Eichner
#t1977
#cTheoretical Computer Science
#index627522
#% 
#!
  
#*Netzwerke zur simultanen Berechnung Boolescher Funktionen.
#@Jürgen Sattler
#t1981
#cTheoretical Computer Science
#index627523
#% 
#!
  
#*Inconsistencies of pure LISP.
#@Andreas Eick,Elfriede Fehr
#t1983
#cTheoretical Computer Science
#index627524
#% 
#!
  
#*Über die Länge einer Berechnung bei linearer Parameter-abhängigkeit der Operationszeit.
#@R. Schauerte
#t1977
#cTheoretical Computer Science
#index627525
#% 
#!
  
#*Strukturelle Untersuchungen zur schwersten kontextfreien Sprache.
#@Klaus Estenfeld
#t1977
#cTheoretical Computer Science
#index627526
#% 
#!
  
#*Struktur von Programmbündeln.
#@Britta Schinzel
#t1977
#cTheoretical Computer Science
#index627527
#% 
#!
  
#*Fifo nets: a new model of parallel computation.
#@Alain Finkel,Gérard Memmi
#t1983
#cTheoretical Computer Science
#index627528
#% 
#!
  
#*A Family of Graphs with Expensive Depth-Reduction.
#@Georg Schnitger
#t1981
#cTheoretical Computer Science
#index627529
#% 
#!
  
#*Transition Diagrams and Strict Deterministic Grammars.
#@Dietmar Friede
#t1979
#cTheoretical Computer Science
#index627530
#% 
#!
  
#*An algorithm for stransitive closure with linear expected time.
#@Claus-Peter Schnorr
#t1977
#cTheoretical Computer Science
#index627531
#% 
#!
  
#*Exact Expressions for some Randomness Tests.
#@Péter Gács
#t1979
#cTheoretical Computer Science
#index627532
#% 
#!
  
#*On the Additive Complexity of Polynomials and some New Lower Bounds.
#@Claus-Peter Schnorr
#t1979
#cTheoretical Computer Science
#index627533
#% 
#!
  
#*On Storage Optimization for Automatically Generated Compilers.
#@Harald Ganzinger
#t1979
#cTheoretical Computer Science
#index627534
#% 
#!
  
#*Monte-Carlo factoring algorithm with finite storage.
#@Claus-Peter Schnorr
#t1983
#cTheoretical Computer Science
#index627535
#% 
#!
  
#*Aspects of unbounded parallelism.
#@G. Gati
#t1977
#cTheoretical Computer Science
#index627536
#% 
#!
  
#*Storage Modification Machines.
#@Arnold Schönhage
#t1979
#cTheoretical Computer Science
#index627537
#% 
#!
  
#*Une extension aux mots infinis de la notion de transduction rationelle.
#@Françoise Gire
#t1983
#cTheoretical Computer Science
#index627538
#% 
#!
  
#*Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.
#@Patrice Séébold
#t1983
#cTheoretical Computer Science
#index627539
#% 
#!
  
#*Algebraic and operational semantics of exceptions and errors.
#@Martin Gogolla,Klaus Drosten,Udo W. Lipeck,Hans-Dieter Ehrich
#t1983
#cTheoretical Computer Science
#index627540
#% 
#!
  
#*The equivalence problem for N.T.S. languages is decidable.
#@Géraud Sénizergues
#t1983
#cTheoretical Computer Science
#index627541
#% 
#!
  
#*On Continuous Completions.
#@Irène Guessarian
#t1979
#cTheoretical Computer Science
#index627542
#% 
#!
  
#*Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi.
#@Kurt Sieber
#t1983
#cTheoretical Computer Science
#index627543
#% 
#!
  
#*Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies.
#@Ralf Hartmut Güting,Hans-Peter Kriegel
#t1981
#cTheoretical Computer Science
#index627544
#% 
#!
  
#*Das Normalisierungsproblem und er Zusammenhang mit der Zeitkomplexität der Kontextsensitiven Analyse.
#@N. Stadel
#t1977
#cTheoretical Computer Science
#index627545
#% 
#!
  
#*Erzeugung optimalen Codes für Series - Parallel Graphs.
#@Reiner Güttler
#t1981
#cTheoretical Computer Science
#index627546
#% 
#!
  
#*A hierarchy of sets of infinite trees.
#@Wolfgang Thomas
#t1983
#cTheoretical Computer Science
#index627547
#% 
#!
  
#*Efficiency of universal parallel computers.
#@Friedhelm Meyer auf der Heide
#t1983
#cTheoretical Computer Science
#index627548
#% 
#!
  
#*Maintaining order in a generalized linked list.
#@Athanasios K. Tsakalidis
#t1983
#cTheoretical Computer Science
#index627549
#% 
#!
  
#*A New Method to Show Lower Bounds for Polynomials which are Hard to Compute.
#@Joos Heintz
#t1979
#cTheoretical Computer Science
#index627550
#% 
#!
  
#*Remarks on the Nonexistence of some Covering Grammars.
#@Esko Ukkonen
#t1979
#cTheoretical Computer Science
#index627551
#% 
#!
  
#*Towards automation of proofs by induction.
#@Friedrich W. von Henke
#t1977
#cTheoretical Computer Science
#index627552
#% 
#!
  
#*Negative Results on Counting.
#@Leslie G. Valiant
#t1979
#cTheoretical Computer Science
#index627553
#% 
#!
  
#*Recent Directions in Algorithmic Research.
#@John E. Hopcroft
#t1981
#cTheoretical Computer Science
#index627554
#% 
#!
  
#*On the rationality of Petri net languages.
#@Rüdiger Valk,G. Vidal
#t1977
#cTheoretical Computer Science
#index627555
#% 
#!
  
#*Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sprachen.
#@Günter Hotz
#t1981
#cTheoretical Computer Science
#index627556
#% 
#!
  
#*Boolean Functions Whose Monotone Complexity is of Size n/log n.
#@Ingo Wegener
#t1981
#cTheoretical Computer Science
#index627557
#% 
#!
  
#*Robust Balancing in B-Trees.
#@Scott Huddleston,Kurt Mehlhorn
#t1981
#cTheoretical Computer Science
#index627558
#% 
#!
  
#*Recursion and Complexity Theory on CPO-S.
#@Klaus Weihrauch
#t1981
#cTheoretical Computer Science
#index627559
#% 
#!
  
#*Das Äquivalenzproblem für spezielle klassen von Loop-1-programmen.
#@Hagen Huwig,Volker Claus
#t1977
#cTheoretical Computer Science
#index627560
#% 
#!
  
#*Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
#@Harry A. G. Wijshoff,Jan van Leeuwen
#t1983
#cTheoretical Computer Science
#index627561
#% 
#!
  
#*Decidabilite de la finitude des demi-groupes de matrices.
#@Gérard Jacob
#t1977
#cTheoretical Computer Science
#index627562
#% 
#!
  
#*Zur Komplexität der Presburger Artihmetik und des Äquivalenzproblems einfacher Programme.
#@Kai Wöhl
#t1979
#cTheoretical Computer Science
#index627563
#% 
#!
  
#*On Zerotesting-Bounded Multicounter Machines.
#@Matthias Jantzen
#t1979
#cTheoretical Computer Science
#index627564
#% 
#!
  
#*Concurrency and Automata on Infinite Sequences.
#@David Michael Ritchie Park
#t1981
#cTheoretical Computer Science
#index627565
#% 
#!
  
#*An Effective Retract Calculus.
#@Bernhard Josko
#t1981
#cTheoretical Computer Science
#index627566
#% 
#!
  
#*A polynomial-time test for the deadlock-freedom of computer systems.
#@Tiko Kameda
#t1977
#cTheoretical Computer Science
#index627567
#% 
#!
  
#*When are two Effectively given Domains Identical?.
#@Akira Kanda,David Michael Ritchie Park
#t1979
#cTheoretical Computer Science
#index627568
#% 
#!
  
#*Verallgemeinerte kommutative Sprachen.
#@Ioannis Keklikoglou
#t1981
#cTheoretical Computer Science
#index627569
#% 
#!
  
#*The expected number of nodes and leaves at level k in ordered trees.
#@R. Kemp
#t1983
#cTheoretical Computer Science
#index627570
#% 
#!
  
#*Quelques propriétés des langages à un Comptuer.
#@Michel Latteux
#t1981
#cTheoretical Computer Science
#index627571
#% 
#!
  
#*Analysis of polynomial approximation algorithms for constraint expressions.
#@Karl J. Lieberherr,Stephen A. Vavasis
#t1983
#cTheoretical Computer Science
#index627572
#% 
#!
  
#*Heuristics for minimum edge length rectangular partitions of rectilinear figures.
#@Andrzej Lingas
#t1983
#cTheoretical Computer Science
#index627573
#% 
#!
  
#*Formale Korrecktheitsbeweise für While-Programme.
#@Jacques Loeckx
#t1977
#cTheoretical Computer Science
#index627574
#% 
#!
  
#*Eine klasse geordneter Monoide und ihre Anwendbarkeit in der Fixpunktsemantik.
#@V. Lohberger
#t1977
#cTheoretical Computer Science
#index627575
#% 
#!
  
#*An Efficient On-Line Position Tree Construction Algorithm.
#@Mila E. Majster-Cederbaum,Angelika Reiser
#t1979
#cTheoretical Computer Science
#index627576
#% 
#!
  
#*An axiomatic approach to semantics of specification languages.
#@Johann A. Makowsky,Bernd Mahr
#t1983
#cTheoretical Computer Science
#index627577
#% 
#!
  
#*New Aspects of Homomorphisms.
#@Hermann A. Maurer
#t1979
#cTheoretical Computer Science
#index627578
#% 
#!
  
#*Sorting Presorted Files.
#@Kurt Mehlhorn
#t1979
#cTheoretical Computer Science
#index627579
#% 
#!
  
#*Can Partial Correctness Assertions Specify Programming Language Semantics?.
#@Albert R. Meyer,Irene Greif
#t1979
#cTheoretical Computer Science
#index627580
#% 
#!
  
#*An Algebraic Theory for Synchronization.
#@Robin Milner
#t1979
#cTheoretical Computer Science
#index627581
#% 
#!
  
#*Theoretical Computer Science, 3rd GI-Conference, Darmstadt, Germany, March 28-30, 1977, Proceedings
#@H. Tzschach,H. Waldschmidt,Hermann K.-G. Walter
#t1977
#cTheoretical Computer Science
#index2817723
#% 
#!
  
#*Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings
#@Armin B. Cremers,Hans-Peter Kriegel
#t1982
#cTheoretical Computer Science
#index2817726
#% 
#!
  
#*Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings
#@Klaus Weihrauch
#t1979
#cTheoretical Computer Science
#index2817724
#% 
#!
  
#*Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings
#@Peter Deussen
#t1981
#cTheoretical Computer Science
#index2817725
#% 
#!
  
#*Separable Partitions.
#@Noga Alon,Shmuel Onn
#t1999
#cDiscrete Applied Mathematics
#index835824
#% 
#!
  
#*Non-standard approaches to integer programming.
#@Karen Aardal,Robert Weismantel,Laurence A. Wolsey
#t2002
#cDiscrete Applied Mathematics
#index835825
#%16629
#%186063
#%186481
#%191742
#%211444
#%219690
#%406978
#%611209
#%621778
#%783674
#%861932
#%950268
#%950828
#%950958
#%950667
#%971974
#%1013074
#%1014208
#%1014310
#%1061853
#%1094479
#%3005546
#%3007117
#!
  
#*Covering with Latin Transversals.
#@Noga Alon,Joel Spencer,Prasad Tetali
#t1995
#cDiscrete Applied Mathematics
#index835826
#% 
#!
  
#*Biconvex graphs: ordering and algorithms.
#@Nesrine Abbas,Lorna K. Stewart
#t2000
#cDiscrete Applied Mathematics
#index835827
#% 
#!
  
#*T-choosability in Graphs.
#@Noga Alon,Ayal Zaks
#t1998
#cDiscrete Applied Mathematics
#index835828
#% 
#!
  
#*Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms.
#@Nesrine Abbas,Lorna K. Stewart
#t1999
#cDiscrete Applied Mathematics
#index835829
#% 
#!
  
#*Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure.
#@Kazutoshi Ando,Satoru Fujishige,Toshio Nemoto
#t1996
#cDiscrete Applied Mathematics
#index835830
#% 
#!
  
#*Lower Bounds for Hypergraph Ramsey Numbers.
#@H. L. Abbott,M. J. Smuga-Otto
#t1995
#cDiscrete Applied Mathematics
#index835831
#% 
#!
  
#*Using Lagrangian dual information to generate degree constrained spanning trees.
#@Rafael Andrade,Abilio Lucena,Nelson Maculan
#t2006
#cDiscrete Applied Mathematics
#index835832
#%110808
#%568295
#%622968
#%838003
#%843693
#%885452
#%952917
#%1059765
#!
  
#*Almost resolvable perfect Mendelsohn designs with block size five.
#@R. Julian R. Abel,Frank E. Bennett,Gennian Ge
#t2002
#cDiscrete Applied Mathematics
#index835833
#% 
#!
  
#*Some Results on Visibility Graphs.
#@Thomas Andreae
#t1992
#cDiscrete Applied Mathematics
#index835834
#% 
#!
  
#*Directed-ordered whist tournaments and (, 5, 1) difference families: existence results and some new classes of -cyclic solutions.
#@R. Julian R. Abel,Stephanie Costa,Norman J. Finizio
#t2004
#cDiscrete Applied Mathematics
#index835835
#% 
#!
  
#*Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three.
#@Thomas Andreae,Martin Hintz,Michael Nölle,Gerald Schreiber,Gerald W. Schuster,Hajo Seng
#t1997
#cDiscrete Applied Mathematics
#index835836
#% 
#!
  
#*Stable Matchings and Linear Inequalities.
#@Hernán G. Abeledo,Uriel G. Rothblum
#t1994
#cDiscrete Applied Mathematics
#index835837
#% 
#!
  
#*On a Problem Concerning Tolerance Graphs.
#@Thomas Andreae,Ulf Hennig,Andreas Parra
#t1993
#cDiscrete Applied Mathematics
#index835838
#% 
#!
  
#*Paths to Marriage Stability.
#@Hernán G. Abeledo,Uriel G. Rothblum
#t1995
#cDiscrete Applied Mathematics
#index835839
#% 
#!
  
#*New () Graphs Discovered by Heuristic Search.
#@James Allwright
#t1992
#cDiscrete Applied Mathematics
#index835840
#% 
#!
  
#*On the Complexity of Linear Programming in the BSS-model.
#@Gunter Bär
#t1999
#cDiscrete Applied Mathematics
#index835841
#% 
#!
  
#*Bipartite Embeddings of Trees in the Plane.
#@Manuel Abellanas,Jesus Garcia-Lopez,Gregorio Hernández-Peñalver,Marc Noy,Pedro A. Ramos
#t1999
#cDiscrete Applied Mathematics
#index835842
#% 
#!
  
#*Path Covering Problems and Testing of Printed Circuits.
#@Giovanni Andreatta,Francesco Mason
#t1995
#cDiscrete Applied Mathematics
#index835843
#% 
#!
  
#*Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach.
#@Nair Maria Maia de Abreu,Paulo Oswaldo Boaventura Netto,Tania Maia Querido,Elizabeth Ferreira Gouvea
#t2002
#cDiscrete Applied Mathematics
#index835844
#%835852
#!
  
#*Embedding complete trees into the hypercube.
#@Sergei L. Bezrukov
#t2001
#cDiscrete Applied Mathematics
#index835845
#% 
#!
  
#*The Erdos-Ko-Rado Bound for the Function Lattice.
#@Christian Bey
#t1999
#cDiscrete Applied Mathematics
#index835846
#% 
#!
  
#*Heat Conduction on Graphs.
#@Nafiz Abu-Jaradeh,David L. Powers
#t1994
#cDiscrete Applied Mathematics
#index835847
#% 
#!
  
#*Parametric Min-cuts Analysis in a Network.
#@Yash P. Aneja,R. Chandrasekaran,Kunhiraman Nair
#t2003
#cDiscrete Applied Mathematics
#index835848
#%1059273
#!
  
#*Cyclic Codes of Length 2 Over Z.
#@Taher Abualrub,Robert H. Oehmke
#t2003
#cDiscrete Applied Mathematics
#index835849
#% 
#!
  
#*On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.
#@Eric Angel,Vassilis Zissimopoulos
#t2000
#cDiscrete Applied Mathematics
#index835850
#% 
#!
  
#*On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems.
#@Warren P. Adams,Perino M. Dearing
#t1994
#cDiscrete Applied Mathematics
#index835851
#% 
#!
  
#*On the Quality of Local Search for the Quadratic Assignment Problem.
#@Eric Angel,Vassilis Zissimopoulos
#t1998
#cDiscrete Applied Mathematics
#index835852
#% 
#!
  
#*Generating Bent Sequences.
#@Carlisle M. Adams,Stafford E. Tavares
#t1992
#cDiscrete Applied Mathematics
#index835853
#% 
#!
  
#*An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.
#@Shoshana Anily,Julien Bramel
#t2004
#cDiscrete Applied Mathematics
#index835854
#% 
#!
  
#*Monge and Feasibility Sequences in General Flow Problems.
#@Ilan Adler,Alan J. Hoffman,Ron Shamir
#t1993
#cDiscrete Applied Mathematics
#index835855
#% 
#!
  
#*The Scheduling of Maintenance Service.
#@Shoshana Anily,Celia A. Glass,Refael Hassin
#t1998
#cDiscrete Applied Mathematics
#index835856
#% 
#!
  
#*The Parallel Complexity of Single Rule Logic Programs.
#@Foto N. Afrati
#t1992
#cDiscrete Applied Mathematics
#index835857
#% 
#!
  
#*Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem.
#@Miguel F. Anjos,Henry Wolkowicz
#t2002
#cDiscrete Applied Mathematics
#index835858
#% 
#!
  
#*Designing PTASs for MIN-SUM scheduling problems.
#@Foto N. Afrati,Ioannis Milis
#t2006
#cDiscrete Applied Mathematics
#index835859
#%46602
#%186508
#%186480
#%209818
#%211802
#%268897
#%557851
#%609740
#%610205
#%610206
#%610702
#%611191
#%611223
#%611328
#%611365
#%611324
#%621700
#%622471
#%622620
#%623035
#%651449
#%839414
#%932457
#%951514
#%951616
#%1014115
#%1059743
#%1061395
#!
  
#*The Complexities of the Coefficients of the Tutte Polynomial.
#@J. D. Annan
#t1995
#cDiscrete Applied Mathematics
#index835860
#% 
#!
  
#*Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations.
#@Richa Agarwala,Leslie G. Biesecker,Alejandro A. Schäffer
#t2000
#cDiscrete Applied Mathematics
#index835861
#% 
#!
  
#*Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram.
#@Fred S. Annexstein,John V. Franco
#t1995
#cDiscrete Applied Mathematics
#index835862
#% 
#!
  
#*A Shifting Algorithm for Constrained min-max Partition on Trees.
#@Eliezer Agasi,Ronald I. Becker,Yehoshua Perl
#t1993
#cDiscrete Applied Mathematics
#index835863
#% 
#!
  
#*On Testing Consecutive-ones Property in Parallel.
#@Fred S. Annexstein,Ramjee P. Swaminathan
#t1998
#cDiscrete Applied Mathematics
#index835864
#% 
#!
  
#*Complexity of finding a join of maximum weight.
#@Alexander A. Ageev
#t2001
#cDiscrete Applied Mathematics
#index835865
#% 
#!
  
#*A non-ambiguous decomposition of regular languages and factorizing codes.
#@Marcella Anselmo
#t2003
#cDiscrete Applied Mathematics
#index835866
#%268918
#%619959
#%854697
#%945392
#%949893
#%1090972
#%3000906
#!
  
#*An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.
#@Alexander A. Ageev,Maxim Sviridenko
#t1999
#cDiscrete Applied Mathematics
#index835867
#% 
#!
  
#*Non-abelian key agreement protocols.
#@Iris Anshel,Michael Anshel,Dorian Goldfeld
#t2003
#cDiscrete Applied Mathematics
#index835868
#%127055
#!
  
#*Consecutive Interval Query and Dynamic Programming on Intervals.
#@Alok Aggarwal,Takeshi Tokuyama
#t1998
#cDiscrete Applied Mathematics
#index835869
#% 
#!
  
#*Minimum Vertex Weighted Deficiency of ()-Factors: A Greedy Algorithm.
#@Richard P. Anstee
#t1993
#cDiscrete Applied Mathematics
#index835870
#% 
#!
  
#*Modelling piecewise linear concave costs in a tree partitioning problem.
#@El Houssaine Aghezzaf,Laurence A. Wolsey
#t1994
#cDiscrete Applied Mathematics
#index835871
#% 
#!
  
#*Maximum-entropy remote sampling.
#@Kurt M. Anstreicher,Marcia Fampa,Jon Lee,Joy Williams
#t2001
#cDiscrete Applied Mathematics
#index835872
#% 
#!
  
#*Powers of geometric intersection graphs and dispersion algorithms.
#@Geir Agnarsson,Peter Damaschke,Magnús M. Halldórsson
#t2003
#cDiscrete Applied Mathematics
#index835873
#%147
#%836811
#%836748
#%839224
#%931783
#%931781
#%931791
#%1059959
#%1059863
#!
  
#*On data classification by iterative linear partitioning.
#@Martin Anthony
#t2004
#cDiscrete Applied Mathematics
#index835874
#%441191
#%441188
#%441187
#%514983
#%620523
#%622442
#%751483
#%798317
#%835889
#%887725
#%888666
#%949807
#%951349
#%984926
#%1009685
#%1009836
#%1025983
#%1032561
#!
  
#*Batch Scheduling in a Two-machine Flow Shop with Limited Buffer.
#@Alessandro Agnetis,Dario Pacciarelli,Fabrizio Rossi
#t1997
#cDiscrete Applied Mathematics
#index835875
#% 
#!
  
#*Some connections between learning and optimization.
#@Martin Anthony
#t2004
#cDiscrete Applied Mathematics
#index835876
#%39305
#%887725
#%888181
#%888180
#%949807
#%951349
#%972213
#%972970
#%1009615
#%1009685
#%3006875
#!
  
#*Lift and project relaxations for the matching and related polytopes.
#@Néstor E. Aguilera,Silvia M. Bianchi,Graciela L. Nasini
#t2004
#cDiscrete Applied Mathematics
#index835877
#%1013086
#%1013437
#!
  
#*Classification by Polynomial Surfaces.
#@Martin Anthony
#t1995
#cDiscrete Applied Mathematics
#index835878
#% 
#!
  
#*The disjunctive procedure and blocker duality.
#@Néstor E. Aguilera,Mariana S. Escalante,Graciela L. Nasini
#t2002
#cDiscrete Applied Mathematics
#index835879
#%1013437
#%3007117
#!
  
#*Accuracy of Techniques for the Logical Analysis of Data.
#@Martin Anthony
#t1999
#cDiscrete Applied Mathematics
#index835880
#% 
#!
  
#*On Maximal Shadows of Members in Left-compressed Sets.
#@Rudolf Ahlswede,Zhen Zhang
#t1999
#cDiscrete Applied Mathematics
#index835881
#% 
#!
  
#*Introduction to special volume of Discrete Applied Mathematics.
#@Martin Anthony,Endre Boros,Peter L. Hammer,Alexander Kogan
#t2004
#cDiscrete Applied Mathematics
#index835882
#% 
#!
  
#*A survey of very large-scale neighborhood search techniques.
#@Ravindra K. Ahuja,Özlem Ergun,James B. Orlin,Abraham P. Punnen
#t2002
#cDiscrete Applied Mathematics
#index835883
#%2616
#%406989
#%623263
#%812068
#%812926
#%812928
#%836665
#%836664
#%836943
#%837855
#%839345
#%885523
#%933320
#%951694
#%952954
#%1060148
#%3417351
#!
  
#*Scheduling workover rigs for onshore oil production.
#@Dario J. Aloise,Daniel Aloise,Caroline T. M. Rocha,Celso C. Ribeiro,José C. Ribeiro Filho,Luiz S. S. Moura
#t2006
#cDiscrete Applied Mathematics
#index835884
#%813608
#!
  
#*Matrices with Maximum Exponents in the Class of Doubly Stochastic Primitive Matrices.
#@Zhou Bo,Bolian Liu
#t1999
#cDiscrete Applied Mathematics
#index835885
#% 
#!
  
#*Generalized self-approaching curves.
#@Oswin Aichholzer,Franz Aurenhammer,Christian Icking,Rolf Klein,Elmar Langetepe,Günter Rote
#t2001
#cDiscrete Applied Mathematics
#index835886
#% 
#!
  
#*Preface.
#@Martin Anthony,Endre Boros,Peter L. Hammer,Alexander Kogan
#t2006
#cDiscrete Applied Mathematics
#index835887
#% 
#!
  
#*Variants of the majority problem.
#@Martin Aigner
#t2004
#cDiscrete Applied Mathematics
#index835888
#% 
#!
  
#*On Specifying Boolean Functions by Labelled Examples.
#@Martin Anthony,Graham Brightwell,John Shawe-Taylor
#t1995
#cDiscrete Applied Mathematics
#index835889
#% 
#!
  
#*Finding the Maximum and Minimum.
#@Martin Aigner
#t1997
#cDiscrete Applied Mathematics
#index835890
#% 
#!
  
#*A Result of Vapnik with Applications.
#@Martin Anthony,John Shawe-Taylor
#t1993
#cDiscrete Applied Mathematics
#index835891
#% 
#!
  
#*Bounds on the Size of Merging Networks.
#@Martin Aigner,Otfried Schwarzkopf
#t1995
#cDiscrete Applied Mathematics
#index835892
#% 
#!
  
#*A Result of Vapnik with Applications.
#@Martin Anthony,John Shawe-Taylor
#t1994
#cDiscrete Applied Mathematics
#index835893
#% 
#!
  
#*A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem.
#@Mustafa Akgül
#t1993
#cDiscrete Applied Mathematics
#index835894
#% 
#!
  
#*A Sufficient Condition for Polynomial Distribution-dependent Learnability.
#@Martin Anthony,John Shawe-Taylor
#t1997
#cDiscrete Applied Mathematics
#index835895
#% 
#!
  
#*Preface.
#@Mustafa Akgül,Horst W. Hamacher,Süleyman Tüfekci
#t1993
#cDiscrete Applied Mathematics
#index835896
#% 
#!
  
#*On a Problem of P. Erds.
#@Carla Antoni,Angela Dalena
#t1996
#cDiscrete Applied Mathematics
#index835897
#% 
#!
  
#*Triangulating the Surface of a Molecule.
#@Nataraj Akkiraju,Herbert Edelsbrunner
#t1996
#cDiscrete Applied Mathematics
#index835898
#% 
#!
  
#*Probing the Arrangement of Hyperplanes.
#@Yasukazu Aoki
#t1995
#cDiscrete Applied Mathematics
#index835899
#% 
#!
  
#*Robotic cell scheduling with operational flexibility.
#@M. Selim Akturk,Hakan Gultekin,Oya Ekin Karasan
#t2005
#cDiscrete Applied Mathematics
#index835900
#%837232
#!
  
#*New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24).
#@Alberto Apostolico,Mikhail J. Atallah,Susanne E. Hambrusch
#t1993
#cDiscrete Applied Mathematics
#index835901
#% 
#!
  
#*Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots.
#@Tatsuya Akutsu
#t2000
#cDiscrete Applied Mathematics
#index835902
#% 
#!
  
#*Optimal discovery of repetitions in 2D.
#@Alberto Apostolico,Valentin E. Brimkov
#t2005
#cDiscrete Applied Mathematics
#index835903
#%210384
#%210715
#%609802
#%846960
#%971345
#%1058354
#%1088874
#%1090276
#%1090879
#!
  
#*Point matching under non-uniform distortions.
#@Tatsuya Akutsu,Kyotetsu Kanaya,Akira Ohyama,Asao Fujiyama
#t2003
#cDiscrete Applied Mathematics
#index835904
#%111188
#%111167
#%210296
#%842840
#%1040806
#%1092272
#!
  
#*A new class of facets for the Latin square polytope.
#@Gautam Appa,Dimitris Magos,Ioannis Mourtos
#t2006
#cDiscrete Applied Mathematics
#index835905
#%850565
#!
  
#*Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.
#@Jochen Alber,Frederic Dorn,Rolf Niedermeier
#t2005
#cDiscrete Applied Mathematics
#index835906
#%525
#%481074
#%493212
#%610529
#%621214
#%624014
#%651496
#%836158
#%837988
#%846825
#%924108
#%949686
#%952547
#%952663
#%952767
#%971693
#%977717
#%1341919
#%1341763
#!
  
#*Fixed points and maximal independent sets in AND-OR networks.
#@Julio Aracena,Jacques Demongeot,Eric Goles Ch.
#t2004
#cDiscrete Applied Mathematics
#index835907
#%850835
#!
  
#*The Complexity of One-Machine Batching Problems.
#@Susanne Albers,Peter Brucker
#t1993
#cDiscrete Applied Mathematics
#index835908
#% 
#!
  
#*Generalization of aTheorem on the Parametric Maximum Flow Problem.
#@Tadashi Arai,Shuichi Ueno,Yoji Kajitani
#t1993
#cDiscrete Applied Mathematics
#index835909
#% 
#!
  
#*Scheduling with unexpected machine breakdowns.
#@Susanne Albers,Günter Schmidt
#t2001
#cDiscrete Applied Mathematics
#index835910
#% 
#!
  
#*On the upper chromatic number of (v, b)-configurations.
#@Claudio Arbib,Michele Flammini
#t2002
#cDiscrete Applied Mathematics
#index835911
#% 
#!
  
#*Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip.
#@Christoph Albrecht,Bernhard Korte,Jürgen Schietke,Jens Vygen
#t2002
#cDiscrete Applied Mathematics
#index835912
#%132447
#%133021
#%133268
#%134042
#%142267
#%283131
#%283238
#%891180
#%891161
#%951147
#%1079176
#!
  
#*How to Survive While Visiting a Graph.
#@Claudio Arbib,Michele Flammini,Enrico Nardelli
#t2000
#cDiscrete Applied Mathematics
#index835913
#% 
#!
  
#*Cliques and extended triangles. A necessary condition for planar clique graphs.
#@Liliana Alcón,Marisa Gutierrez
#t2004
#cDiscrete Applied Mathematics
#index835914
#% 
#!
  
#*A Three-dimensional Matching Model for Perishable Production Scheduling.
#@Claudio Arbib,Dario Pacciarelli,Stefano Smriglio
#t1999
#cDiscrete Applied Mathematics
#index835915
#% 
#!
  
#*Stable Matchings with Couples.
#@Brian Aldershof,Olivia M. Carducci
#t1996
#cDiscrete Applied Mathematics
#index835916
#% 
#!
  
#*Efficient Computation of Implicit Representations of Sparse Graphs.
#@Srinivasa Rao Arikati,Anil Maheshwari,Christos D. Zaroliagis
#t1997
#cDiscrete Applied Mathematics
#index835917
#% 
#!
  
#*On easy and hard hereditary classes of graphs with respect to the independent set problem.
#@Vladimir E. Alekseev
#t2003
#cDiscrete Applied Mathematics
#index835918
#%933023
#!
  
#*A Linear Algorithm for the Group Path Problem on Chordal Graphs.
#@Srinivasa Rao Arikati,Uri N. Peled
#t1993
#cDiscrete Applied Mathematics
#index835919
#% 
#!
  
#*Polynomial algorithm for finding the largest independent sets in graphs without forks.
#@Vladimir E. Alekseev
#t2004
#cDiscrete Applied Mathematics
#index835920
#%838161
#!
  
#*A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.
#@Srinivasa Rao Arikati,Uri N. Peled
#t1996
#cDiscrete Applied Mathematics
#index835921
#% 
#!
  
#*Local transformations of graphs preserving independence number.
#@Vladimir E. Alekseev,Vadim V. Lozin
#t2004
#cDiscrete Applied Mathematics
#index835922
#%854378
#%953009
#!
  
#*An addition algorithm in Jacobian of C curves.
#@Seigo Arita
#t2003
#cDiscrete Applied Mathematics
#index835923
#% 
#!
  
#*Augmenting graphs for independent sets.
#@Vladimir E. Alekseev,Vadim V. Lozin
#t2004
#cDiscrete Applied Mathematics
#index835924
#%837128
#%838161
#%838324
#%933023
#!
  
#*A note on orientations of mixed graphs.
#@Esther M. Arkin,Refael Hassin
#t2002
#cDiscrete Applied Mathematics
#index835925
#% 
#!
  
#*Strong Elimination Ordering of the Total Graph of a Tree.
#@J. Ales,Roman Bacik
#t1992
#cDiscrete Applied Mathematics
#index835926
#% 
#!
  
#*Approximation Algorithms for the Geometric Covering Salesman Problem.
#@Esther M. Arkin,Refael Hassin
#t1994
#cDiscrete Applied Mathematics
#index835927
#% 
#!
  
#*Utility Representation via Additive or Multiplicative Error Functions.
#@Fuad Aleskerov,Yusufcan Masatlioglu
#t2003
#cDiscrete Applied Mathematics
#index835928
#% 
#!
  
#*Increasing digraph arc-connectivity by arc addition, reversal and complement.
#@Esther M. Arkin,Refael Hassin,Shimon Shahar
#t2002
#cDiscrete Applied Mathematics
#index835929
#%622068
#%798187
#%952969
#%1061044
#%1061347
#!
  
#*Consensus algorithms for the generation of all maximal bicliques.
#@Gabriela Alexe,Sorin Alexe,Yves Crama,Stephan Foldes,Peter L. Hammer,Bruno Simeone
#t2004
#cDiscrete Applied Mathematics
#index835930
#%73
#%110529
#%623296
#%836813
#%837816
#%842872
#%931101
#%931986
#%952838
#%953009
#%953079
#%953243
#%953241
#!
  
#*A 2 2/3 Superstring Approximation Algorithm.
#@Chris Armen,Clifford Stein
#t1998
#cDiscrete Applied Mathematics
#index835931
#% 
#!
  
#*Spanned patterns for the logical analysis of data.
#@Gabriela Alexe,Peter L. Hammer
#t2006
#cDiscrete Applied Mathematics
#index835932
#%835930
#%837055
#%836813
#%838842
#%931986
#%1009652
#%1013425
#%1112474
#%3458528
#!
  
#*Polynomial transformations and data-independent neighborhood functions.
#@Derek E. Armstrong,Sheldon H. Jacobson
#t2004
#cDiscrete Applied Mathematics
#index835933
#%621778
#%953434
#%1089010
#!
  
#*Accelerated algorithm for pattern detection in logical analysis of data.
#@Sorin Alexe,Peter L. Hammer
#t2006
#cDiscrete Applied Mathematics
#index835934
#%950173
#%953248
#%1009652
#%1013425
#%1112474
#%1121602
#!
  
#*Data-independent neighborhood functions and strict local optima.
#@Derek E. Armstrong,Sheldon H. Jacobson
#t2005
#cDiscrete Applied Mathematics
#index835935
#%2616
#%835883
#%835933
#%953434
#%972341
#!
  
#*Struction revisited.
#@Gabriela Alexe,Peter L. Hammer,Vadim V. Lozin,Dominique de Werra
#t2003
#cDiscrete Applied Mathematics
#index835936
#%837128
#%837129
#%838161
#%839491
#%848317
#%854378
#%933023
#%953009
#%952767
#!
  
#*Transmitting in the -Dimensional Cube.
#@Noga Alon
#t1992
#cDiscrete Applied Mathematics
#index835937
#% 
#!
  
#*A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor.
#@Jin-yi Cai
#t2003
#cDiscrete Applied Mathematics
#index835938
#%210268
#%621122
#%887800
#%971643
#%1059809
#%1088861
#!
  
#*Minimal Connected Enclosures on an Embedded Planar Graph.
#@Christos Alexopoulos,J. Scott Provan,H. Donald Ratliff,Bryan R. Stutzman
#t1999
#cDiscrete Applied Mathematics
#index835939
#% 
#!
  
#*Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing.
#@Ronald D. Armstrong,Zhiying Jin
#t1996
#cDiscrete Applied Mathematics
#index835940
#% 
#!
  
#*Adjacency on the Constrained Assignment Problem.
#@Abdo Y. Alfakih,Katta G. Murty
#t1998
#cDiscrete Applied Mathematics
#index835941
#% 
#!
  
#*Computing the Jump Number on Semi-orders Is Polynomial.
#@Angela von Arnim,Colin de la Higuera
#t1994
#cDiscrete Applied Mathematics
#index835942
#% 
#!
  
#*On Variations of the Subset Sum Problem.
#@Jorge L. Ramírez Alfonsín
#t1998
#cDiscrete Applied Mathematics
#index835943
#% 
#!
  
#*Facets of the Generalized Permutahedron of a Poset.
#@Annelie von Arnim,Andreas S. Schulz
#t1997
#cDiscrete Applied Mathematics
#index835944
#% 
#!
  
#*On Pseudomodular Matroids and Adjoints.
#@Marion Alfter,Winfried Hochstättler
#t1995
#cDiscrete Applied Mathematics
#index835945
#% 
#!
  
#*Euler circuits and DNA sequencing by hybridization.
#@Richard Arratia,Béla Bollobás,Don Coppersmith,Gregory B. Sorkin
#t2000
#cDiscrete Applied Mathematics
#index835946
#% 
#!
  
#*Generation of lower bounds for minimum span frequency assignment.
#@Stuart M. Allen,Derek H. Smith,Steve Hurley
#t2002
#cDiscrete Applied Mathematics
#index835947
#% 
#!
  
#*An Alternate Formulation of the Symmetric Traveling Salesman Problem and Its Properties.
#@Tiru S. Arthanari,M. Usha
#t2000
#cDiscrete Applied Mathematics
#index835948
#% 
#!
  
#*Linear Cellular Automata, Finite Automata and Pascal's Triangle.
#@Jean-Paul Allouche,Fritz von Haeseler,Heinz-Otto Peitgen,Guentcho Skordev
#t1996
#cDiscrete Applied Mathematics
#index835949
#% 
#!
  
#*Spectral Partitioning with Multiple Eigenvectors.
#@Charles J. Alpert,Andrew B. Kahng,So-Zen Yao
#t1999
#cDiscrete Applied Mathematics
#index835950
#% 
#!
  
#*Complexity of finding dense subgraphs.
#@Yuichi Asahiro,Refael Hassin,Kazuo Iwama
#t2002
#cDiscrete Applied Mathematics
#index835951
#%621778
#%624055
#%1059273
#!
  
#*On the Deterministic Complexity of Searching Local Maxima.
#@Ingo Althöfer,Klaus-Uwe Koschnick
#t1993
#cDiscrete Applied Mathematics
#index835952
#% 
#!
  
#*Two sensitivity theorems in fuzzy integer programming.
#@Armen S. Asratian,Nikolai N. Kuzjurin
#t2004
#cDiscrete Applied Mathematics
#index835953
#%622873
#%623075
#!
  
#*On nearest points of a finite set in a normed linear space.
#@Elisabetta Alvoni
#t2004
#cDiscrete Applied Mathematics
#index835954
#% 
#!
  
#*On Physical Mapping and the Consecutive Ones Property for Sparse Matrices.
#@Jonathan E. Atkins,Martin Middendorf
#t1996
#cDiscrete Applied Mathematics
#index835955
#% 
#!
  
#*The MIN PFS problem and piecewise linear model estimation.
#@Edoardo Amaldi,Marco Mattavelli
#t2002
#cDiscrete Applied Mathematics
#index835956
#%312041
#%834022
#%924135
#%930086
#%1013773
#%1046268
#%1088831
#%3077310
#!
  
#*Faster Isometric Embedding in Products of Complete Graphs.
#@Franz Aurenhammer,Michael Formann,Ramana M. Idury,Alejandro A. Schäffer,Frank Wagner
#t1994
#cDiscrete Applied Mathematics
#index835957
#% 
#!
  
#*A Review of Combinatorial Problems Arising in Feedforward Neural Network Design.
#@Edoardo Amaldi,Eddy Mayoraz,Dominique de Werra
#t1994
#cDiscrete Applied Mathematics
#index835958
#% 
#!
  
#*Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths.
#@Igor Averbakh
#t2003
#cDiscrete Applied Mathematics
#index835959
#%924059
#!
  
#*On the negation-limited circuit complexity of merging.
#@Kazuyuki Amano,Akira Maruoka,Jun Tarui
#t2003
#cDiscrete Applied Mathematics
#index835960
#%695
#%60490
#%493123
#%622984
#%797853
#%951106
#%1058547
#!
  
#*K-submodular functions and convexity of their Lovász extension.
#@Kazutoshi Ando
#t2002
#cDiscrete Applied Mathematics
#index835961
#% 
#!
  
#*NP-Completeness of Minimum Spanner Problems.
#@Leizhen Cai
#t1994
#cDiscrete Applied Mathematics
#index835962
#% 
#!
  
#*Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs.
#@Jérôme Amilhastre,Marie-Catherine Vilarem,Philippe Janssen
#t1998
#cDiscrete Applied Mathematics
#index835963
#% 
#!
  
#*A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree.
#@Igor Averbakh,Oded Berman
#t1996
#cDiscrete Applied Mathematics
#index835964
#% 
#!
  
#*Foreword.
#@Amihood Amir,Gad M. Landau
#t2005
#cDiscrete Applied Mathematics
#index835965
#% 
#!
  
#*(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective.
#@Igor Averbakh,Oded Berman
#t1997
#cDiscrete Applied Mathematics
#index835966
#% 
#!
  
#*The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs.
#@Lars Døvling Andersen,Herbert Fleischner
#t1995
#cDiscrete Applied Mathematics
#index835967
#% 
#!
  
#*Constrained Matroidal Bottleneck Problems.
#@Igor Averbakh,Oded Berman,Abraham P. Punnen
#t1995
#cDiscrete Applied Mathematics
#index835968
#% 
#!
  
#*Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs.
#@Lars Døvling Andersen,Herbert Fleischner,Susanne Regner
#t1998
#cDiscrete Applied Mathematics
#index835969
#% 
#!
  
#*Interval data minmax regret network optimization problems.
#@Igor Averbakh,Vasilij Lebedev
#t2004
#cDiscrete Applied Mathematics
#index835970
#%3005546
#!
  
#*Efficient line broadcasting in a d-dimensional grid.
#@Amir Averbuch,Yehuda Roditty,Barack Shoham
#t2001
#cDiscrete Applied Mathematics
#index835971
#% 
#!
  
#*Perfect binary (n, 3) codes: the structure of graphs of minimum distances.
#@Sergey V. Avgustinovich
#t2001
#cDiscrete Applied Mathematics
#index835972
#% 
#!
  
#*Vertex characterization of partition polytopes of bipartitions and of planar point sets.
#@Sharon Aviran,Nissan Lev-Tov,Shmuel Onn,Uriel G. Rothblum
#t2002
#cDiscrete Applied Mathematics
#index835973
#%835824
#%1013314
#%2892347
#!
  
#*On the binary solitaire cone.
#@David Avis,Antoine Deza
#t2001
#cDiscrete Applied Mathematics
#index835974
#% 
#!
  
#*Reverse Search for Enumeration.
#@David Avis,Komei Fukuda
#t1996
#cDiscrete Applied Mathematics
#index835975
#% 
#!
  
#*Container ship stowage problem: complexity and connection to the coloring of circle graphs.
#@Mordecai Avriel,Michal Penn,Naomi Shpirer
#t2000
#cDiscrete Applied Mathematics
#index835976
#% 
#!
  
#*Homotopy in digital spaces.
#@Rafael Ayala,Eladio Domínguez,Angel R. Francés,Antonio Quintero
#t2003
#cDiscrete Applied Mathematics
#index835977
#%153960
#%154141
#%1089031
#!
  
#*Digital homotopy with obstacles.
#@Rafael Ayala,Eladio Domínguez,Angel R. Francés,Antonio Quintero
#t2004
#cDiscrete Applied Mathematics
#index835978
#%153960
#%834111
#%834104
#%835977
#%1089031
#!
  
#*On-line scheduling with precedence constraints.
#@Yossi Azar,Leah Epstein
#t2002
#cDiscrete Applied Mathematics
#index835979
#% 
#!
  
#*The bisection width and the isoperimetric number of arrays.
#@M. Cemil Azizoglu,Ömer Eeciolu
#t2004
#cDiscrete Applied Mathematics
#index835980
#%660880
#%977258
#%1061055
#!
  
#*Decomposition of integer matrices and multileaf collimator sequencing.
#@Davaatseren Baatar,Horst W. Hamacher,Matthias Ehrgott,Gerhard J. Woeginger
#t2005
#cDiscrete Applied Mathematics
#index835981
#%837047
#%1024213
#%3007117
#!
  
#*Sequential and simultaneous aggregation of diophantine equations.
#@Djangir A. Babayev,Sahib S. Mardanov
#t1994
#cDiscrete Applied Mathematics
#index835982
#% 
#!
  
#*Recognition and Isomorphism of Tree-like P-connected Graphs.
#@Luitpold Babel
#t2000
#cDiscrete Applied Mathematics
#index835983
#% 
#!
  
#*Triangulating Graphs with Few P's.
#@Luitpold Babel
#t1998
#cDiscrete Applied Mathematics
#index835984
#% 
#!
  
#*Recognizing the P-structure of Bipartite Graphs.
#@Luitpold Babel,Andreas Brandstädt,Van Bang Le
#t1999
#cDiscrete Applied Mathematics
#index835985
#% 
#!
  
#*Algorithms for on-line bin-packing problems with cardinality constraints.
#@Luitpold Babel,Bo Chen,Hans Kellerer,Vladimir Kotov
#t2004
#cDiscrete Applied Mathematics
#index835986
#%839203
#%934300
#%950929
#%950928
#%951002
#%951884
#!
  
#*On the Structure of Graphs with Few Ps.
#@Luitpold Babel,Stephan Olariu
#t1998
#cDiscrete Applied Mathematics
#index835987
#% 
#!
  
#*On the p-connectedness of Graphs - A Survey.
#@Luitpold Babel,Stephan Olariu
#t1999
#cDiscrete Applied Mathematics
#index835988
#% 
#!
  
#*Hard-to-color Graphs for Connected Sequential Colorings.
#@Luitpold Babel,Gottfried Tinhofer
#t1994
#cDiscrete Applied Mathematics
#index835989
#% 
#!
  
#*Enumeration of Acyclic Walks in a Graph.
#@Darko Babic,Ante Graovac
#t1993
#cDiscrete Applied Mathematics
#index835990
#% 
#!
  
#*Möbius Inversion on a Poset of a Graph and Its Acyclic Subgraphs.
#@Darko Babic,Nenad Trinajstic
#t1996
#cDiscrete Applied Mathematics
#index835991
#% 
#!
  
#*The Simulated Trading Heuristic for Solving Vehicle Routing Problems.
#@Achim Bachem,Winfried Hochstättler,Martin Malich
#t1996
#cDiscrete Applied Mathematics
#index835992
#% 
#!
  
#*On the growth of components with non-fixed excesses.
#@Anne-Elisabeth Baert,Vlady Ravelomanana,Loÿs Thimonier
#t2003
#cDiscrete Applied Mathematics
#index835993
#%1052069
#!
  
#*Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles).
#@Vineet Bafna,Babu O. Narayanan,R. Ravi
#t1996
#cDiscrete Applied Mathematics
#index835994
#% 
#!
  
#*Gossiping with Multiple Sends and Receives.
#@Anindo Bagchi,Edward F. Schmeichel,S. Louis Hakimi
#t1996
#cDiscrete Applied Mathematics
#index835995
#% 
#!
  
#*2-satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems.
#@Ansuman Bagchi,Brigitte Servatius,Weigeng Shi
#t1995
#cDiscrete Applied Mathematics
#index835996
#% 
#!
  
#*A Survey of Integrity.
#@Kunwarjit S. Bagga,Lowell W. Beineke,Wayne Goddard,Marc J. Lipman,Raymond E. Pippert
#t1992
#cDiscrete Applied Mathematics
#index835997
#% 
#!
  
#*Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.
#@O. Bahn,Jean-Louis Goffin,Jean-Philippe Vial,O. Du Merle
#t1994
#cDiscrete Applied Mathematics
#index835998
#% 
#!
  
#*Expected Value Expansions in Rooted Graphs.
#@Alison Bailey,Gary Gordon,Matthew Patton,Jennifer Scancella
#t2003
#cDiscrete Applied Mathematics
#index835999
#%831197
#%837067
#%838145
#%839320
#%849008
#!
  
#*On the dominant of the Steiner 2-edge connected subgraph polytope.
#@Mourad Baïou
#t2001
#cDiscrete Applied Mathematics
#index836000
#% 
#!
  
#*Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry).
#@Mourad Baïou,Michel Balinski
#t2000
#cDiscrete Applied Mathematics
#index836001
#% 
#!
  
#*Dynamic maintenance and visualization of molecular surfaces.
#@Chandrajit L. Bajaj,Valerio Pascucci,Ariel Shamir,Robert J. Holt,Arun N. Netravali
#t2003
#cDiscrete Applied Mathematics
#index836002
#%110680
#%111445
#%219471
#%593251
#%605839
#%610173
#%624001
#%660714
#%780156
#%835898
#%837920
#%1058477
#%1119006
#%1119099
#%1119196
#%1119588
#%1133577
#!
  
#*All-pairs-shortest-length on Strongly Chordal Graphs.
#@V. Balachandhran,C. Pandu Rangan
#t1996
#cDiscrete Applied Mathematics
#index836003
#% 
#!
  
#*Disjunctive Programming: Properties of the Convex Hull of Feasible Points.
#@Egon Balas
#t1998
#cDiscrete Applied Mathematics
#index836004
#% 
#!
  
#*On the Dimension of Projected Polyhedra.
#@Egon Balas,Maarten Oosten
#t1998
#cDiscrete Applied Mathematics
#index836005
#% 
#!
  
#*Lift-and-project for Mixed 0-1 programming: recent progress.
#@Egon Balas,Michael Perregaard
#t2002
#cDiscrete Applied Mathematics
#index836006
#%836004
#%1013398
#%1013437
#!
  
#*Linear-Time Separation Algorithms for the Three-Index Assignment Polytope.
#@Egon Balas,Liqun Qi
#t1993
#cDiscrete Applied Mathematics
#index836007
#% 
#!
  
#*Reconstruction of 8-connected but not 4-connected hv-convex discrete sets.
#@Péter Balázs,Emese Balogh,Attila Kuba
#t2005
#cDiscrete Applied Mathematics
#index836008
#%818086
#%835183
#%854261
#%930582
#%934459
#%1089139
#%1092775
#%1093147
#!
  
#*A Unified Approach to Polynomially Solvable Cases of Integer "non-separable" Quadratic optimization.
#@Ross Baldick
#t1995
#cDiscrete Applied Mathematics
#index836009
#% 
#!
  
#*A Linear Time and Space Algorithm to Regonize Interval Orders.
#@Philippe Baldy,Michel Morvan
#t1993
#cDiscrete Applied Mathematics
#index836010
#% 
#!
  
#*A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components.
#@Krystyna T. Balinska,Henryk Galina,Louis V. Quintas,Jerzy Szymanski
#t1996
#cDiscrete Applied Mathematics
#index836011
#% 
#!
  
#*Two-path Subsets: Efficient Counting and Applications to Performability Analysis.
#@Michael O. Ball,Jane N. Hagstrom,J. Scott Provan
#t1998
#cDiscrete Applied Mathematics
#index836012
#% 
#!
  
#*Measures on monotone properties of graphs.
#@József Balogh,Béla Bollobás,David Weinreich
#t2002
#cDiscrete Applied Mathematics
#index836013
#% 
#!
  
#*Some Models for Scheduling Parallel Programs with Communication Delays.
#@Evripidis Bampis,Frédéric Guinand,Denis Trystram
#t1997
#cDiscrete Applied Mathematics
#index836014
#% 
#!
  
#*Introduction.
#@Evripidis Bampis,Klaus Jansen
#t2006
#cDiscrete Applied Mathematics
#index836015
#% 
#!
  
#*Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
#@Hans-Jürgen Bandelt,Yves Crama,Frits C. R. Spieksma
#t1994
#cDiscrete Applied Mathematics
#index836016
#% 
#!
  
#*Absolute Reflexive Retracts and Absolute Bipartite Retracts.
#@Hans-Jürgen Bandelt,Martin Farber,Pavol Hell
#t1993
#cDiscrete Applied Mathematics
#index836017
#% 
#!
  
#*Quasi-median graphs from sets of partitions.
#@Hans-Jürgen Bandelt,Katharina T. Huber,Vincent Moulton
#t2002
#cDiscrete Applied Mathematics
#index836018
#%522
#%837640
#%848038
#%851273
#%853284
#%974463
#%1061713
#!
  
#*On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
#@Jørgen Bang-Jensen,Gregory Gutin
#t1999
#cDiscrete Applied Mathematics
#index836019
#% 
#!
  
#*Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.
#@Jørgen Bang-Jensen,Gregory Gutin,Anders Yeo
#t1998
#cDiscrete Applied Mathematics
#index836020
#% 
#!
  
#*A New Sufficient Condition for a Digraph to Be Hamiltonian.
#@Jørgen Bang-Jensen,Yubao Guo,Anders Yeo
#t1999
#cDiscrete Applied Mathematics
#index836021
#% 
#!
  
#*Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.
#@Jørgen Bang-Jensen,Pavol Hell
#t1993
#cDiscrete Applied Mathematics
#index836022
#% 
#!
  
#*Finding complementary cycles in locally semicomplete digraphs.
#@Jørgen Bang-Jensen,Morten Hegner Nielsen
#t2005
#cDiscrete Applied Mathematics
#index836023
#%854506
#%977979
#!
  
#*Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.
#@Jørgen Bang-Jensen,Stéphan Thomassé
#t2003
#cDiscrete Applied Mathematics
#index836024
#%853571
#!
  
#*Making a tournament k-arc-strong by reversing or deorienting arcs.
#@Jørgen Bang-Jensen,Anders Yeo
#t2004
#cDiscrete Applied Mathematics
#index836025
#% 
#!
  
#*Generation of Molecular Graphs Based on Flexible Utilization of the Available Structural Information.
#@Ivan P. Bangov
#t1996
#cDiscrete Applied Mathematics
#index836026
#% 
#!
  
#*Reliable broadcasting in product networks.
#@Feng Bao,Yoshihide Igarashi,Sabine R. Öhring
#t1998
#cDiscrete Applied Mathematics
#index836027
#% 
#!
  
#*Scheduling equal-length jobs on identical parallel machines.
#@Philippe Baptiste
#t2000
#cDiscrete Applied Mathematics
#index836028
#% 
#!
  
#*Sharing Video on Demand.
#@Amotz Bar-Noy,Juan A. Garay,Amir Herzberg
#t2003
#cDiscrete Applied Mathematics
#index836029
#%185891
#%185875
#%211889
#%211781
#%400817
#%597547
#%621326
#%776121
#!
  
#*A New Competitive Algorithm for Group Testing.
#@Amotz Bar-Noy,Frank K. Hwang,Ilan Kessler,Shay Kutten
#t1994
#cDiscrete Applied Mathematics
#index836030
#% 
#!
  
#*Broadcasting Multiple Messages in Simultaneous Send/receive Systems.
#@Amotz Bar-Noy,Shlomo Kipnis
#t1994
#cDiscrete Applied Mathematics
#index836031
#% 
#!
  
#*optimal Computation of Census Functions in the Postal Model.
#@Amotz Bar-Noy,Shlomo Kipnis,Baruch Schieber
#t1995
#cDiscrete Applied Mathematics
#index836032
#% 
#!
  
#*Optimal multiple message broadcasting in telephone-like communication systems.
#@Amotz Bar-Noy,Shlomo Kipnis,Baruch Schieber
#t2000
#cDiscrete Applied Mathematics
#index836033
#% 
#!
  
#*Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.
#@Reuven Bar-Yehuda,Tuvi Etzion
#t1992
#cDiscrete Applied Mathematics
#index836034
#% 
#!
  
#*On some difficult linear programs coming from set partitioning.
#@Francisco Barahona,Ranga Anbil
#t2002
#cDiscrete Applied Mathematics
#index836035
#%406823
#%891649
#%1013495
#%1013847
#!
  
#*Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2.
#@André Barbé
#t2000
#cDiscrete Applied Mathematics
#index836036
#% 
#!
  
#*Scaling properties of generalized Carlitz sequences of polynomials.
#@André Barbé,Fritz von Haeseler,Guentcho Skordev
#t2004
#cDiscrete Applied Mathematics
#index836037
#%837036
#%839214
#%846850
#%973021
#!
  
#*An algorithm for the reconstruction of discrete sets from two projections in presence of absorption.
#@Elena Barcucci,Andrea Frosini,Simone Rinaldi
#t2005
#cDiscrete Applied Mathematics
#index836038
#%153974
#!
  
#*Extremal Values for Ratios of Distances in Trees.
#@Curtis A. Barefoot,Roger C. Entringer,László A. Székely
#t1997
#cDiscrete Applied Mathematics
#index836039
#% 
#!
  
#*2-Point site Voronoi diagrams.
#@Gill Barequet,Matthew T. Dickerson,Robert L. (Scot) Drysdale III
#t2002
#cDiscrete Applied Mathematics
#index836040
#%3482
#%111041
#%1059096
#!
  
#*Gray code for derangements.
#@Jean-Luc Baril,Vincent Vajnovszki
#t2004
#cDiscrete Applied Mathematics
#index836041
#%415908
#%833069
#%839258
#%848222
#%931016
#%931381
#%1095028
#%3006910
#!
  
#*Efficient Generation of Graphical Partitions.
#@Tiffany M. Barnes,Carla D. Savage
#t1997
#cDiscrete Applied Mathematics
#index836042
#% 
#!
  
#*On Minimal Imperfect Graphs Without Induced P.
#@Vincent Barré,Jean-Luc Fouquet
#t1999
#cDiscrete Applied Mathematics
#index836043
#% 
#!
  
#*Symmetry properties of chordal rings of degree 3.
#@Lali Barrière
#t2003
#cDiscrete Applied Mathematics
#index836044
#%105339
#%611108
#%838416
#%839343
#%848395
#%933102
#%951854
#%1079731
#!
  
#*Decomposable trees: a polynomial algorithm fortripodes.
#@Dominique Barth,Olivier Baudon,Joël Puech
#t2002
#cDiscrete Applied Mathematics
#index836045
#% 
#!
  
#*Compatible Eulerian Circuits in K**.
#@Dominique Barth,Johny Bond,André Raspaud
#t1995
#cDiscrete Applied Mathematics
#index836046
#% 
#!
  
#*Uniform emulations of Cartesian-product and Cayley graphs.
#@Dominique Barth,Paraskevi Fragopoulou,Marie-Claude Heydemann
#t2002
#cDiscrete Applied Mathematics
#index836047
#% 
#!
  
#*A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
#@Dominique Barth,Marie-Claude Heydemann
#t1997
#cDiscrete Applied Mathematics
#index836048
#% 
#!
  
#*A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
#@Dominique Barth,Marie-Claude Heydemann
#t1997
#cDiscrete Applied Mathematics
#index836049
#% 
#!
  
#*The Reversing Number of a Digraph.
#@Jean-Pierre Barthélemy,Olivier Hudry,Garth Isaak,Fred S. Roberts,Barry A. Tesman
#t1995
#cDiscrete Applied Mathematics
#index836050
#% 
#!
  
#*Approximation algorithms for multi-parameter graph optimization problems.
#@Ivan Basov,Alek Vainshtein
#t2002
#cDiscrete Applied Mathematics
#index836051
#% 
#!
  
#*An evolutionary algorithm for discrete tomography.
#@Kees Joost Batenburg
#t2005
#cDiscrete Applied Mathematics
#index836052
#%836797
#%851477
#%854154
#%1089139
#%3005546
#!
  
#*Editorial.
#@Roberto Battiti,Alan A. Bertossi,Silvano Martello
#t2001
#cDiscrete Applied Mathematics
#index836053
#% 
#!
  
#*Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP).
#@Roberto Battiti,Marco Protasi
#t1999
#cDiscrete Applied Mathematics
#index836054
#% 
#!
  
#*Routing permutations and 2-1 routing requests in the hypercube.
#@Olivier Baudon,Guillaume Fertin,Ivan Havel
#t2001
#cDiscrete Applied Mathematics
#index836055
#% 
#!
  
#*Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
#@Douglas Bauer,Hajo Broersma,Aurora Morgana,Edward F. Schmeichel
#t2002
#cDiscrete Applied Mathematics
#index836056
#%839446
#%851363
#%851341
#%854750
#!
  
#*Not Every 2-tough Graph Is Hamiltonian.
#@Douglas Bauer,Hajo Broersma,Henk Jan Veldman
#t2000
#cDiscrete Applied Mathematics
#index836057
#% 
#!
  
#*The Complexity of Recognizing Tough Cubic Graphs.
#@Douglas Bauer,Willem-Jan van den Heuvel,Aurora Morgana,Edward F. Schmeichel
#t1997
#cDiscrete Applied Mathematics
#index836058
#% 
#!
  
#*Chordality and 2-factors in Tough Graphs.
#@Douglas Bauer,Gyula Y. Katona,Dieter Kratsch,Henk Jan Veldman
#t2000
#cDiscrete Applied Mathematics
#index836059
#% 
#!
  
#*on Edge-hamiltonian Cayley Graphs.
#@Ulrike Baumann
#t1994
#cDiscrete Applied Mathematics
#index836060
#% 
#!
  
#*An Algebraic Analysis of the Connectivity of DeBruijn and Shuffle-exchange Digraphs.
#@Marc Baumslag
#t1995
#cDiscrete Applied Mathematics
#index836061
#% 
#!
  
#*Approximation algorithms for some vehicle routing problems.
#@Cristina Bazgan,Refael Hassin,Jérôme Monnot
#t2005
#cDiscrete Applied Mathematics
#index836062
#%622513
#%622887
#%931619
#%931620
#%932989
#%949675
#%951516
#%1090494
#!
  
#*The satisfactory partition problem.
#@Cristina Bazgan,Zsolt Tuza,Daniel Vanderpooten
#t2006
#cDiscrete Applied Mathematics
#index836063
#%1091459
#!
  
#*On the complexity of unfrozen problems.
#@Adam Beacham,Joseph C. Culberson
#t2005
#cDiscrete Applied Mathematics
#index836064
#%11670
#%387927
#%745867
#%1090337
#!
  
#*The resolution complexity of random graph -colorability.
#@Paul Beame,Joseph C. Culberson,David G. Mitchell,Cristopher Moore
#t2005
#cDiscrete Applied Mathematics
#index836065
#% 
#!
  
#*Optimal Wavelength-routed Multicasting.
#@Bruno Beauquier,Pavol Hell,Stephane Perennes
#t1998
#cDiscrete Applied Mathematics
#index836066
#% 
#!
  
#*Finding the l-core of a tree.
#@Ronald I. Becker,Yen-I Chiang,Isabella Lari,Andrea Scozzari,Giovanni Storchi
#t2002
#cDiscrete Applied Mathematics
#index836067
#% 
#!
  
#*The Shifting Algorithm Technique for the Partitioning of Trees.
#@Ronald I. Becker,Yehoshua Perl
#t1995
#cDiscrete Applied Mathematics
#index836068
#% 
#!
  
#*The algebraic Monge property and path problems.
#@Wolfgang W. Bein,Peter Brucker,Lawrence L. Larmore,James K. Park
#t2005
#cDiscrete Applied Mathematics
#index836069
#%836303
#%837323
#%839152
#%952973
#%953291
#%953654
#%1059511
#!
  
#*A Monge Property for the D-dimensional Transportation Problem.
#@Wolfgang W. Bein,Peter Brucker,James K. Park,Pramod K. Pathak
#t1995
#cDiscrete Applied Mathematics
#index836070
#% 
#!
  
#*on the Steiner Median of a Tree.
#@Lowell W. Beineke,Ortrud Oellermann,Raymond E. Pippert
#t1996
#cDiscrete Applied Mathematics
#index836071
#% 
#!
  
#*Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time.
#@Hocine Belouadah,Chris N. Potts
#t1994
#cDiscrete Applied Mathematics
#index836072
#% 
#!
  
#*Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes.
#@Shai Ben-David,Ami Litman
#t1998
#cDiscrete Applied Mathematics
#index836073
#% 
#!
  
#*Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems.
#@András A. Benczúr
#t2003
#cDiscrete Applied Mathematics
#index836074
#%185907
#%622069
#%622430
#%973099
#%975675
#%975674
#%976473
#%977037
#%980006
#%1061347
#!
  
#*An Efficient Matching Algorithm Applied in Statistical Physics.
#@Jürgen Bendisch,Ulrich Derigs,Alfred Heske
#t1994
#cDiscrete Applied Mathematics
#index836075
#% 
#!
  
#*optimal Separable Partitioning in the Plane.
#@Michal Benelli,Refael Hassin
#t1995
#cDiscrete Applied Mathematics
#index836076
#% 
#!
  
#*How Do I Marry Thee? Let Me Count the Ways!.
#@Arthur T. Benjamin,Cherlyn Converse,Henry A. Krieger
#t1995
#cDiscrete Applied Mathematics
#index836077
#% 
#!
  
#*A Brief Survey of Perfect Mendelsohn Packing and Covering Designs.
#@Frank E. Bennett
#t1999
#cDiscrete Applied Mathematics
#index836078
#% 
#!
  
#*Minimum Matrix Representation of Sperner Systems.
#@Frank E. Bennett,Lisheng Wu
#t1998
#cDiscrete Applied Mathematics
#index836079
#% 
#!
  
#*Tandem cyclic alignment.
#@Gary Benson
#t2005
#cDiscrete Applied Mathematics
#index836080
#%118601
#%932705
#%951779
#%1059827
#%1060393
#!
  
#*From Logical Gates Synthesis to Chromatic Bicritical Clutters.
#@Claude Benzaken
#t1999
#cDiscrete Applied Mathematics
#index836081
#% 
#!
  
#*Uniform Tag Systems for Paperfolding Sequences.
#@Christiane Bercoff
#t1997
#cDiscrete Applied Mathematics
#index836082
#% 
#!
  
#*An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix.
#@V. L. Beresnev
#t2001
#cDiscrete Applied Mathematics
#index836083
#% 
#!
  
#*Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem.
#@Claude Berge
#t1996
#cDiscrete Applied Mathematics
#index836084
#% 
#!
  
#*Local rule mechanism for selecting icosahedral shell geometry.
#@Bonnie Berger,Jonathan A. King,Russell Schwartz,Peter W. Shor
#t2000
#cDiscrete Applied Mathematics
#index836085
#% 
#!
  
#*Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing.
#@Toby Berger,Vladimir I. Levenshtein
#t2003
#cDiscrete Applied Mathematics
#index836086
#%610934
#%974422
#!
  
#*A very elementary presentation of the Hannenhalli-Pevzner theory.
#@Anne Bergeron
#t2005
#cDiscrete Applied Mathematics
#index836087
#%118578
#%118817
#%558741
#%559108
#%950590
#%1059710
#!
  
#*Almost Fully-parallel Parentheses Matching.
#@Omer Berkman,Uzi Vishkin
#t1995
#cDiscrete Applied Mathematics
#index836088
#% 
#!
  
#*Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time.
#@Kenneth A. Berman,John V. Franco,John S. Schlipf
#t1995
#cDiscrete Applied Mathematics
#index836089
#% 
#!
  
#*Generalized Bicycles.
#@Kenneth A. Berman,Yanpei Liu
#t1997
#cDiscrete Applied Mathematics
#index836090
#% 
#!
  
#*Verifiable broadcasting and gossiping in communication networks.
#@Kenneth A. Berman,Jerome L. Paul
#t2002
#cDiscrete Applied Mathematics
#index836091
#% 
#!
  
#*Foreword.
#@Jean-Claude Bermond
#t1992
#cDiscrete Applied Mathematics
#index836092
#% 
#!
  
#*The Power of Small Coalitions in Graphs.
#@Jean-Claude Bermond,Johny Bond,David Peleg,Stephane Perennes
#t2003
#cDiscrete Applied Mathematics
#index836093
#%2022
#!
  
#*Hamilton Circuits in the Directed Wrapped Butterfly Network.
#@Jean-Claude Bermond,Olivier Delmas,Éric Darrot,Stephane Perennes
#t1998
#cDiscrete Applied Mathematics
#index836094
#% 
#!
  
#*Table of Large ()-Graphs.
#@Jean-Claude Bermond,Charles Delorme,Jean-Jacques Quisquater
#t1992
#cDiscrete Applied Mathematics
#index836095
#% 
#!
  
#*Bus Interconnection Networks.
#@Jean-Claude Bermond,Fahir Ö. Ergincan
#t1996
#cDiscrete Applied Mathematics
#index836096
#% 
#!
  
#*Optimal Sequential Gossiping by Short Messages.
#@Jean-Claude Bermond,Luisa Gargano,Stephane Perennes
#t1998
#cDiscrete Applied Mathematics
#index836097
#% 
#!
  
#*Deadlock Prevention by Acyclic Orientations.
#@Jean-Claude Bermond,Miriam Di Ianni,Michele Flammini,Stephane Perennes
#t2003
#cDiscrete Applied Mathematics
#index836098
#%543622
#%543847
#%614088
#%614493
#%972811
#%1078814
#!
  
#*Efficient Sets in Graphs.
#@Philip J. Bernhard,Stephen T. Hedetniemi,David Pokrass Jacobs
#t1993
#cDiscrete Applied Mathematics
#index836099
#% 
#!
  
#*Asteroidal triples of moplexes.
#@Anne Berry,Jean Paul Bordat
#t2001
#cDiscrete Applied Mathematics
#index836100
#% 
#!
  
#*Separability Generalizes Dirac's Theorem.
#@Anne Berry,Jean Paul Bordat
#t1998
#cDiscrete Applied Mathematics
#index836101
#% 
#!
  
#*Path Optimization for Graph Partitioning Problems.
#@Jonathan W. Berry,Mark K. Goldberg
#t1999
#cDiscrete Applied Mathematics
#index836102
#% 
#!
  
#*Representing a concept lattice by a graph.
#@Anne Berry,Alain Sigayret
#t2004
#cDiscrete Applied Mathematics
#index836103
#%268840
#%521428
#%610043
#%836101
#%836100
#%837719
#%853647
#%933155
#%1059553
#%1059793
#%1094587
#!
  
#*Generalized domination in closure systems.
#@Anne Berry,Eric SanJuan,Alain Sigayret
#t2006
#cDiscrete Applied Mathematics
#index836104
#%3391
#%172441
#%184162
#%302628
#%521428
#%522200
#%836103
#%836355
#%931574
#%932945
#!
  
#*A Characterization of Overlap-Free Morphisms.
#@Jean Berstel,Patrice Séébold
#t1993
#cDiscrete Applied Mathematics
#index836105
#% 
#!
  
#*A Nice Class for the Vertex Packing Problem.
#@Paola Bertolazzi,Caterina De Simone,Anna Galluccio
#t1997
#cDiscrete Applied Mathematics
#index836106
#% 
#!
  
#*An approximation algorithm for the maximum cut problem and its experimental analysis.
#@Alberto Bertoni,Paola Campadelli,Giuliano Grossi
#t2001
#cDiscrete Applied Mathematics
#index836107
#% 
#!
  
#*Pyramids and weak hierarchies in the ordinal model for clustering.
#@Patrice Bertrand,Melvin F. Janowitz
#t2002
#cDiscrete Applied Mathematics
#index836108
#%851638
#%854352
#%864088
#!
  
#*The k-weak Hierarchical Representations: An Extension of the Indexed Closed Weak Hierarchies.
#@Patrice Bertrand,Melvin F. Janowitz
#t2003
#cDiscrete Applied Mathematics
#index836109
#% 
#!
  
#*The Proper Linear Spaces on 17 Points.
#@Anton Betten,Dieter Betten
#t1999
#cDiscrete Applied Mathematics
#index836110
#% 
#!
  
#*Counting Symmetric Configurations v.
#@Anton Betten,Gunnar Brinkmann,Tomaz Pisanski
#t2000
#cDiscrete Applied Mathematics
#index836111
#% 
#!
  
#*Simple 8-(40, 11, 1440) Designs.
#@Anton Betten,Reinhard Laue,Alfred Wassermann
#t1999
#cDiscrete Applied Mathematics
#index836112
#% 
#!
  
#*Balanced vertex-orderings of graphs.
#@Therese C. Biedl,Timothy M. Chan,Yashar Ganjali,Mohammad Taghi Hajiaghayi,David R. Wood
#t2005
#cDiscrete Applied Mathematics
#index836113
#%2022
#%185828
#%185983
#%224881
#%621842
#%623072
#%750724
#%803513
#%803945
#%836671
#%836846
#%837542
#%930979
#%952653
#%953266
#%1090178
#%1092451
#%1095252
#!
  
#*On k-partitioning of Hamming Graphs.
#@Sergei L. Bezrukov,Robert Elsässer,Ulf-Peter Schroeder
#t1999
#cDiscrete Applied Mathematics
#index836114
#% 
#!
  
#*A note on reconfiguring tree linkages: trees can lock.
#@Therese C. Biedl,Erik D. Demaine,Martin L. Demaine,Sylvain Lazard,Anna Lubiw,Joseph O'Rourke,Steve Robbins,Ileana Streinu,Godfried T. Toussaint,Sue Whitesides
#t2002
#cDiscrete Applied Mathematics
#index836115
#% 
#!
  
#*On Edge Numberings of the -Cube Graph.
#@Sergei L. Bezrukov,Norbert Grünwald,Karl Weber
#t1993
#cDiscrete Applied Mathematics
#index836116
#% 
#!
  
#*Steiner trees and polyhedra.
#@Mohamed Didi Biha,Hervé Kerivin,Ali Ridha Mahjoub
#t2001
#cDiscrete Applied Mathematics
#index836117
#% 
#!
  
#*Embedding ladders and caterpillars into the hypercube.
#@Sergei L. Bezrukov,Burkhard Monien,Walter Unger,Gerd Wechsung
#t1998
#cDiscrete Applied Mathematics
#index836118
#% 
#!
  
#*The Shapley value on convex geometries.
#@Jesús Mario Bilbao,Paul H. Edelman
#t2000
#cDiscrete Applied Mathematics
#index836119
#% 
#!
  
#*The Cyclic Wirelength of Trees.
#@Sergei L. Bezrukov,Ulf-Peter Schroeder
#t1998
#cDiscrete Applied Mathematics
#index836120
#% 
#!
  
#*Fun-Sort--or the chaos of unordered binary search.
#@Therese C. Biedl,Timothy M. Chan,Erik D. Demaine,Rudolf Fleischer,Mordecai J. Golin,James A. King,J. Ian Munro
#t2004
#cDiscrete Applied Mathematics
#index836121
#%211653
#%231333
#%950951
#!
  
#*On Spanning 2-trees in a Graph.
#@Leizhen Cai
#t1997
#cDiscrete Applied Mathematics
#index836122
#% 
#!
  
#*Time-optimal Tree Computations on Sparse Meshes.
#@Dharmavani Bhagavathi,Venkatavasu Bokka,Himabindu Gurla,Stephan Olariu,James L. Schwing
#t1997
#cDiscrete Applied Mathematics
#index836123
#% 
#!
  
#*Solving the Uncapacited Plant Location Problem on Trees.
#@Alain Billionnet,Marie-Christine Costa
#t1994
#cDiscrete Applied Mathematics
#index836124
#% 
#!
  
#*Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness.
#@Lucio Bianco,Jacek Blazewicz,Paolo Dell'Olmo,Maciej Drozdowski
#t1997
#cDiscrete Applied Mathematics
#index836125
#% 
#!
  
#*Best reduction of the quadratic semi-assignment problem.
#@Alain Billionnet,Sourour Elloumi
#t2001
#cDiscrete Applied Mathematics
#index836126
#% 
#!
  
#*Scheduling Independent Tasks with Multiple Modes.
#@Lucio Bianco,Paolo Dell'Olmo,Maria Grazia Speranza
#t1995
#cDiscrete Applied Mathematics
#index836127
#% 
#!
  
#*A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem.
#@Alain Billionnet,Alain Faye
#t1997
#cDiscrete Applied Mathematics
#index836128
#% 
#!
  
#*Neighborhood Subtree Tolerance Graphs.
#@Eric Bibelnieks,Perino M. Dearing
#t1993
#cDiscrete Applied Mathematics
#index836129
#% 
#!
  
#*The complexity of modular decomposition of Boolean functions.
#@Jan C. Bioch
#t2005
#cDiscrete Applied Mathematics
#index836130
#%70760
#%611111
#%746251
#%836133
#%836265
#%887270
#%952739
#%3006547
#!
  
#*A note on 3D orthogonal graph drawing.
#@Therese C. Biedl,Timothy M. Chan
#t2005
#cDiscrete Applied Mathematics
#index836131
#%224631
#%750724
#%836671
#%930981
#%1095252
#!
  
#*Primitive partial words.
#@Francine Blanchet-Sadri
#t2005
#cDiscrete Applied Mathematics
#index836132
#%2487
#%974698
#%976042
#%1089338
#%1089441
#%1089437
#%1089439
#%1089440
#!
  
#*Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions.
#@Jan C. Bioch,Toshihide Ibaraki,Kazuhisa Makino
#t1999
#cDiscrete Applied Mathematics
#index836133
#% 
#!
  
#*Optimal Match-up Strategies in Stochastic Scheduling.
#@John R. Birge,Michael A. H. Dempster
#t1995
#cDiscrete Applied Mathematics
#index836134
#% 
#!
  
#*Communication Complexity of two Decision Problems.
#@Anders Björner,Johan Karlander,Bernt Lindström
#t1992
#cDiscrete Applied Mathematics
#index836135
#% 
#!
  
#*Cyclic Codes Over Z of Oddly Even Length.
#@Thomas Blackford
#t2003
#cDiscrete Applied Mathematics
#index836136
#% 
#!
  
#*The Efficiency of AC Graphs.
#@Jean R. S. Blair
#t1993
#cDiscrete Applied Mathematics
#index836137
#% 
#!
  
#*Sensitivity Analysis for Knapsack Problems: A Negative Result.
#@Charles R. Blair
#t1998
#cDiscrete Applied Mathematics
#index836138
#% 
#!
  
#*New lower bounds for the three-dimensional finite bin packing problem.
#@Marco A. Boschetti
#t2004
#cDiscrete Applied Mathematics
#index836139
#%837528
#%1275185
#!
  
#*On extendibility of voltage and current regimes from subnetworks.
#@J. Cel
#t2000
#cDiscrete Applied Mathematics
#index836140
#% 
#!
  
#*Games, Equations and Dot-Depth Two Monoids.
#@Francine Blanchet-Sadri
#t1992
#cDiscrete Applied Mathematics
#index836141
#% 
#!
  
#*Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis.
#@Endre Boros,Vladimir Menkov
#t2004
#cDiscrete Applied Mathematics
#index836142
#%2360
#%744494
#%751380
#%836271
#%930086
#%1009307
#%1009807
#%1013425
#%1112474
#%1275197
#!
  
#*Existence of resolvable optimal strong partially balanced designs.
#@Beiliang Du
#t2006
#cDiscrete Applied Mathematics
#index836143
#%847417
#%850670
#!
  
#*On a complete set of generators for dot-depth two.
#@Francine Blanchet-Sadri
#t1994
#cDiscrete Applied Mathematics
#index836144
#% 
#!
  
#*Minimum 3-geodetically connected graphs.
#@Martina Bosíková
#t2003
#cDiscrete Applied Mathematics
#index836145
#% 
#!
  
#*on Component-size Bounded Steiner Trees.
#@Ding-Zhu Du
#t1995
#cDiscrete Applied Mathematics
#index836146
#% 
#!
  
#*Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy.
#@Francine Blanchet-Sadri
#t1996
#cDiscrete Applied Mathematics
#index836147
#% 
#!
  
#*Some New Results Concerning three Counterfeit Coins Problem.
#@Ivica Bosnjak
#t1994
#cDiscrete Applied Mathematics
#index836148
#% 
#!
  
#*Competitive Group Testing.
#@Ding-Zhu Du,Frank K. Hwang
#t1993
#cDiscrete Applied Mathematics
#index836149
#% 
#!
  
#*Trees, Congruences and Varieties of Finite Semigroups.
#@Francine Blanchet-Sadri
#t1998
#cDiscrete Applied Mathematics
#index836150
#% 
#!
  
#*Probability of Diameter Two for Steinhaus Graphs.
#@Neal Brand,Stephen M. Curran,Sajal K. Das,Tom Jacob
#t1993
#cDiscrete Applied Mathematics
#index836151
#% 
#!
  
#*Distributed Processing of Divisible Jobs with Communication Startup Costs.
#@Jacek Blazewicz,Maciej Drozdowski
#t1997
#cDiscrete Applied Mathematics
#index836152
#% 
#!
  
#*Edge Deletion Preserving the Diameter of the Hypercube.
#@Abdelmadjid Bouabdallah,Charles Delorme,Selma Djelloul
#t1995
#cDiscrete Applied Mathematics
#index836153
#% 
#!
  
#*Scheduling a Divisible Task in a Two-dimensional Toroidal Mesh.
#@Jacek Blazewicz,Maciej Drozdowski,Frédéric Guinand,Denis Trystram
#t1999
#cDiscrete Applied Mathematics
#index836154
#% 
#!
  
#*On the Directionality of Interval Orders.
#@Vincent Bouchitté,Roland Jégou,Jean-Xavier Rampon
#t1994
#cDiscrete Applied Mathematics
#index836155
#% 
#!
  
#*Lattice hypercube designs.
#@Tung-Shan Fu,Kwun-Shen Lin
#t2003
#cDiscrete Applied Mathematics
#index836156
#% 
#!
  
#*Deadline Scheduling of Multiprocessor Tasks.
#@Jacek Blazewicz,Maciej Drozdowski,Dominique de Werra,Jan Weglarz
#t1996
#cDiscrete Applied Mathematics
#index836157
#% 
#!
  
#*On treewidth approximations.
#@Vincent Bouchitté,Dieter Kratsch,Haiko Müller,Ioan Todinca
#t2004
#cDiscrete Applied Mathematics
#index836158
#%210686
#%837785
#%951026
#%952725
#%1058697
#%1059793
#%1089606
#%3005546
#!
  
#*Sequencing by hybridization with isothermic oligonucleotide libraries.
#@Jacek Blazewicz,Piotr Formanowicz,Marta Kasprzak,Wojciech T. Markiewicz
#t2004
#cDiscrete Applied Mathematics
#index836159
#%494370
#%558814
#%836162
#%1089453
#!
  
#*Approximating the treewidth of AT-free graphs.
#@Vincent Bouchitté,Ioan Todinca
#t2003
#cDiscrete Applied Mathematics
#index836160
#%660365
#%837785
#%952725
#%1058697
#%1061054
#%1092634
#!
  
#*A new construction for Z-cyclic whist tournaments.
#@Gennian Ge,Alan C. H. Ling
#t2003
#cDiscrete Applied Mathematics
#index836161
#% 
#!
  
#*On some Properties of DNA Graphs.
#@Jacek Blazewicz,Alain Hertz,Daniel Kobler,Dominique de Werra
#t1999
#cDiscrete Applied Mathematics
#index836162
#% 
#!
  
#*A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.
#@Ulrik Brandes,Wolfram Schlickenrieder,Gabriele Neyer,Dorothea Wagner,Karsten Weihe
#t1999
#cDiscrete Applied Mathematics
#index836163
#% 
#!
  
#*Computational complexity of isothermic DNA sequencing by hybridization.
#@Jacek Blazewicz,Marta Kasprzak
#t2006
#cDiscrete Applied Mathematics
#index836164
#%182652
#%558821
#%835946
#%836159
#%836162
#%961990
#%1089453
#!
  
#*(P, diamond)-free graphs revisited: structure and linear time optimization.
#@Andreas Brandstädt
#t2004
#cDiscrete Applied Mathematics
#index836165
#% 
#!
  
#*Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints.
#@Jacek Blazewicz,Wieslaw Kubiak,Silvano Martello
#t1993
#cDiscrete Applied Mathematics
#index836166
#% 
#!
  
#*A fair and efficient solution to the socialist millionaires' problem.
#@Fabrice Boudot,Berry Schoenmakers,Jacques Traoré
#t2001
#cDiscrete Applied Mathematics
#index836167
#% 
#!
  
#*Whist tournaments with the three person property.
#@Gennian Ge,Clement W. H. Lam
#t2004
#cDiscrete Applied Mathematics
#index836168
#% 
#!
  
#*Open shop scheduling problems with late work criteria.
#@Jacek Blazewicz,Erwin Pesch,Malgorzata Sterna,Frank Werner
#t2004
#cDiscrete Applied Mathematics
#index836169
#%930071
#%950482
#%953075
#%1060445
#%3005546
#!
  
#*The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.
#@Andreas Brandstädt,Victor Chepoi,Feodor F. Dragan
#t1998
#cDiscrete Applied Mathematics
#index836170
#% 
#!
  
#*Locally restricted colorings.
#@Ivo Blöchliger,Dominique de Werra
#t2006
#cDiscrete Applied Mathematics
#index836171
#% 
#!
  
#*On linear and circular structure of (claw, net)-free graphs.
#@Andreas Brandstädt,Feodor F. Dragan
#t2003
#cDiscrete Applied Mathematics
#index836172
#%837122
#%839333
#%852117
#%930691
#%950229
#%951035
#%977944
#%1058703
#%1058966
#%1061125
#%1061230
#%1061595
#!
  
#*Maximizing Traveling Salesman Problem for Special Matrices.
#@David Blokh,Gregory Gutin
#t1995
#cDiscrete Applied Mathematics
#index836173
#% 
#!
  
#*On stable cutsets in graphs.
#@Andreas Brandstädt,Feodor F. Dragan,Van Bang Le,Thomas Szymczak
#t2000
#cDiscrete Applied Mathematics
#index836174
#% 
#!
  
#*An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices.
#@David Blokh,Eugene Levner
#t2002
#cDiscrete Applied Mathematics
#index836175
#% 
#!
  
#*Preface: ODSA.
#@Andreas Brandstädt,Konrad Engel,Hans-Dietrich O. F. Gronau,Roger Labahn
#t2004
#cDiscrete Applied Mathematics
#index836176
#% 
#!
  
#*Decompositions into Linear Forests and Difference Labelings of Graphs.
#@Gary S. Bloom,Sergio Ruiz
#t1994
#cDiscrete Applied Mathematics
#index836177
#% 
#!
  
#*On the Stability Number of Claw-free P-free and More General Graphs.
#@Andreas Brandstädt,Peter L. Hammer
#t1999
#cDiscrete Applied Mathematics
#index836178
#% 
#!
  
#*Local Search Algorithms for the k-cardinality Tree Problem.
#@Christian Blum,Matthias Ehrgott
#t2003
#cDiscrete Applied Mathematics
#index836179
#% 
#!
  
#*Stability number of bull- and chair-free graphs revisited.
#@Andreas Brandstädt,Chính T. Hoàng,Van Bang Le
#t2003
#cDiscrete Applied Mathematics
#index836180
#%70760
#%610337
#%611111
#%836522
#%838161
#%971764
#!
  
#*A Ramp Model for Distributed Key Distribution Schemes.
#@Carlo Blundo,Paolo D'Arco,Carles Padró
#t2003
#cDiscrete Applied Mathematics
#index836181
#%83945
#%119629
#%119868
#%120010
#%120325
#%368294
#%621452
#%774577
#%775946
#%887198
#%887196
#!
  
#*On the structure of (, gem)-free graphs.
#@Andreas Brandstädt,Dieter Kratsch
#t2005
#cDiscrete Applied Mathematics
#index836182
#% 
#!
  
#*Anonymous Secret Sharing Schemes.
#@Carlo Blundo,Douglas R. Stinson
#t1997
#cDiscrete Applied Mathematics
#index836183
#% 
#!
  
#*Recognizing the P-structure of Block Graphs.
#@Andreas Brandstädt,Van Bang Le
#t2000
#cDiscrete Applied Mathematics
#index836184
#% 
#!
  
#*On the Chvátal Rank of Polytopes in the 0/1 Cube.
#@Alexander Bockmayr,Friedrich Eisenbrand,Mark E. Hartmann,Andreas S. Schulz
#t1999
#cDiscrete Applied Mathematics
#index836185
#% 
#!
  
#*A note on alpha-redundant vertices in graphs.
#@Andreas Brandstädt,Vadim V. Lozin
#t2001
#cDiscrete Applied Mathematics
#index836186
#% 
#!
  
#*Improved Self-reduction Algorithms for Graphs with Bounded Treewidth.
#@Hans L. Bodlaender
#t1994
#cDiscrete Applied Mathematics
#index836187
#% 
#!
  
#*Tree- and Forest-perfect Graphs.
#@Andreas Brandstädt,Van Bang Le
#t1999
#cDiscrete Applied Mathematics
#index836188
#% 
#!
  
#*Tree decompositions with small cost.
#@Hans L. Bodlaender,Fedor V. Fomin
#t2005
#cDiscrete Applied Mathematics
#index836189
#%268840
#%632667
#%745763
#%952725
#%1058651
#%1058697
#%1061056
#!
  
#*Chordal co-gem-free and (, gem)-free graphs have bounded clique-width.
#@Andreas Brandstädt,Hoàng-Oanh Le,Raffaele Mosca
#t2005
#cDiscrete Applied Mathematics
#index836190
#% 
#!
  
#*On Intervalizing K-colored Graphs for DNA Physical Mapping.
#@Hans L. Bodlaender,Babette van Antwerpen-de Fluiter
#t1996
#cDiscrete Applied Mathematics
#index836191
#% 
#!
  
#*An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System.
#@Jean Paul Boufflet,Jacques Carlier
#t1999
#cDiscrete Applied Mathematics
#index836192
#% 
#!
  
#*The Multi-SAT Algorithm.
#@Jun Gu
#t1999
#cDiscrete Applied Mathematics
#index836193
#% 
#!
  
#*Scheduling with Incompatible Jobs.
#@Hans L. Bodlaender,Klaus Jansen,Gerhard J. Woeginger
#t1994
#cDiscrete Applied Mathematics
#index836194
#% 
#!
  
#*The Complexity of some Problems Related to Graph 3-colorability.
#@Andreas Brandstädt,Van Bang Le,Thomas Szymczak
#t1998
#cDiscrete Applied Mathematics
#index836195
#% 
#!
  
#*Treewidth for Graphs with Small Chordality.
#@Hans L. Bodlaender,Dimitrios M. Thilikos
#t1997
#cDiscrete Applied Mathematics
#index836196
#% 
#!
  
#*Competitive Video on Demand Schedulers for Popular Movies.
#@Christos Bouras,Vaggelis Kapoulas,Grammati E. Pantziou,Paul G. Spirakis
#t2003
#cDiscrete Applied Mathematics
#index836197
#%185875
#%212312
#%400817
#%559895
#%609917
#%795469
#%806062
#%1011395
#%1037175
#%3005125
#!
  
#*Multicolor routing in the undirected hypercube.
#@Qian-Ping Gu,Hisao Tamaki
#t2000
#cDiscrete Applied Mathematics
#index836198
#% 
#!
  
#*Finding a bigtriangleup-regular supergraph of minimum order.
#@Hans L. Bodlaender,Richard B. Tan,Jan van Leeuwen
#t2003
#cDiscrete Applied Mathematics
#index836199
#% 
#!
  
#*On variations of P-sparse graphs.
#@Andreas Brandstädt,Raffaele Mosca
#t2003
#cDiscrete Applied Mathematics
#index836200
#% 
#!
  
#*Graphs with Most Number of Three Point Induced Connected Subgraphs.
#@Francis T. Boesch,Xiaoming Li,José Rodriguez
#t1995
#cDiscrete Applied Mathematics
#index836201
#% 
#!
  
#*On the structure and stability number of P- and co-chair-free graphs.
#@Andreas Brandstädt,Raffaele Mosca
#t2003
#cDiscrete Applied Mathematics
#index836202
#% 
#!
  
#*Interval orders Based on Weak orders.
#@Kenneth P. Bogart,Joseph E. Bonin,Jutta Mitas
#t1995
#cDiscrete Applied Mathematics
#index836203
#% 
#!
  
#*Short Disjoint Cycles in Graphs with Degree Constraints.
#@Andreas Brandstädt,Heinz-Jürgen Voss
#t1996
#cDiscrete Applied Mathematics
#index836204
#% 
#!
  
#*Proper and Unit Tolerance Graphs.
#@Kenneth P. Bogart,Peter C. Fishburn,Garth Isaak,Larry J. Langley
#t1995
#cDiscrete Applied Mathematics
#index836205
#% 
#!
  
#*Triangle-free graphs and forbidden subgraphs.
#@Stephan Brandt
#t2002
#cDiscrete Applied Mathematics
#index836206
#%611199
#%853437
#%854497
#!
  
#*Radon transforms and packings.
#@Michael I. Boguslavsky
#t2001
#cDiscrete Applied Mathematics
#index836207
#% 
#!
  
#*A Sufficient Condition for All Short Cycles.
#@Stephan Brandt
#t1997
#cDiscrete Applied Mathematics
#index836208
#% 
#!
  
#*Edge and total coloring of interval graphs.
#@V. A. Bojarshinov
#t2001
#cDiscrete Applied Mathematics
#index836209
#% 
#!
  
#*Surmise Relations Between Tests - Mathematical Considerations.
#@Silke Brandt,Dietrich Albert,Cord Hockemeyer
#t2003
#cDiscrete Applied Mathematics
#index836210
#%3005077
#!
  
#*An augmenting graph approach to the stable set problem in P-free graphs.
#@Rodica Boliac,Vadim V. Lozin
#t2003
#cDiscrete Applied Mathematics
#index836211
#%838161
#%933023
#%977414
#!
  
#*A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints.
#@Heidemarie Bräsel,David Kluge,Frank Werner
#t1995
#cDiscrete Applied Mathematics
#index836212
#% 
#!
  
#*Optimal Paths in Network Games with P Players.
#@Rodica Boliac,Dmitrii Lozovanu,D. Solomon
#t2000
#cDiscrete Applied Mathematics
#index836213
#% 
#!
  
#*The maximum deviation just-in-time scheduling problem.
#@Nadia Brauner,Yves Crama
#t2004
#cDiscrete Applied Mathematics
#index836214
#%849071
#%949652
#!
  
#*Random Walks and Electrical Resistances in Products of Graphs.
#@Béla Bollobás,Graham Brightwell
#t1997
#cDiscrete Applied Mathematics
#index836215
#% 
#!
  
#*Fast recognition algorithms for classes of partial cubes.
#@Bostjan Bresar,Wilfried Imrich,Sandi Klavzar
#t2003
#cDiscrete Applied Mathematics
#index836216
#%864171
#%864547
#%1058809
#%1061548
#%1091716
#%3480201
#!
  
#*Matchings and Paths in the Cube.
#@Béla Bollobás,Imre Leader
#t1997
#cDiscrete Applied Mathematics
#index836217
#% 
#!
  
#*The Complexity of Colouring Symmetric Relational Systems.
#@Richard C. Brewster
#t1994
#cDiscrete Applied Mathematics
#index836218
#% 
#!
  
#*Annealed replication: a new heuristic for the maximum clique problem.
#@Immanuel M. Bomze,Marco Budinich,Marcello Pelillo,Claudio Rossi
#t2002
#cDiscrete Applied Mathematics
#index836219
#%2616
#%210090
#%210576
#%621446
#%950272
#%1279782
#%1339449
#!
  
#*Homomorphically Full Graphs.
#@Richard C. Brewster,Gary MacGillivray
#t1996
#cDiscrete Applied Mathematics
#index836220
#% 
#!
  
#*On the Computational Power of DNA.
#@Dan Boneh,Christopher Dunworth,Richard J. Lipton,Jiri Sgall
#t1996
#cDiscrete Applied Mathematics
#index836221
#% 
#!
  
#*Two - ø - Tolerance Competition Graphs.
#@Robert C. Brigham,Fred R. McMorris,Richard P. Vitray
#t1996
#cDiscrete Applied Mathematics
#index836222
#% 
#!
  
#*A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance.
#@Annalisa De Bonis
#t1998
#cDiscrete Applied Mathematics
#index836223
#% 
#!
  
#*Plane digitization and related combinatorial problems.
#@Valentin E. Brimkov,Reneta P. Barneva
#t2005
#cDiscrete Applied Mathematics
#index836224
#%609802
#%837317
#%846960
#%953734
#%1089149
#%1089349
#%1089697
#%1090879
#%3004083
#!
  
#*optimal Detection of a Counterfeit Coin with Multi-arms Balances.
#@Annalisa De Bonis,Luisa Gargano,Ugo Vaccaro
#t1995
#cDiscrete Applied Mathematics
#index836225
#% 
#!
  
#*Codage des polyominos convexes et équations pour l'énumération suivant l'aire.
#@Mireille Bousquet-Mélou
#t1994
#cDiscrete Applied Mathematics
#index836226
#% 
#!
  
#*On the power of circular splicing.
#@Paola Bonizzoni,Clelia de Felice,Giancarlo Mauri,Rosalba Zizza
#t2005
#cDiscrete Applied Mathematics
#index836227
#%342147
#%376433
#%837844
#%837796
#%888172
#%1094047
#!
  
#*Bounds on Certain Multiplications of Affine Combinations.
#@Joan Boyar,Faith E. Fich,Kim S. Larsen
#t1994
#cDiscrete Applied Mathematics
#index836228
#% 
#!
  
#*Spanning Local Tournaments in Locally Semicomplete Digraphs.
#@Yubao Guo
#t1997
#cDiscrete Applied Mathematics
#index836229
#% 
#!
  
#*Linear splicing and syntactic monoid.
#@Paola Bonizzoni,Clelia de Felice,Giancarlo Mauri,Rosalba Zizza
#t2006
#cDiscrete Applied Mathematics
#index836230
#%837844
#%837796
#%838616
#%839127
#%1059524
#!
  
#*The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees.
#@Gunnar Brinkmann,Thomas Harmuth,Oliver Heidemeier
#t2003
#cDiscrete Applied Mathematics
#index836231
#% 
#!
  
#*Experimenting an approximation algorithm for the LCS.
#@Paola Bonizzoni,Gianluca Della Vedova,Giancarlo Mauri
#t2001
#cDiscrete Applied Mathematics
#index836232
#% 
#!
  
#*A constructive enumeration of nanotube cap.
#@Gunnar Brinkmann,U. von Nathusius,A. H. R. Palser
#t2002
#cDiscrete Applied Mathematics
#index836233
#% 
#!
  
#*Sparsest cuts and concurrent flows in product graphs.
#@Paul S. Bonsma
#t2004
#cDiscrete Applied Mathematics
#index836234
#%839430
#%951026
#%951572
#%1124600
#!
  
#*A Simple as Correct Algorithm for Deciding If a Graph Has a Perfect Matching.
#@María Rosa Brito
#t1995
#cDiscrete Applied Mathematics
#index836235
#% 
#!
  
#*Foreword.
#@Maurizio A. Bonuccelli,Alberto Marchetti-Spaccamela
#t2003
#cDiscrete Applied Mathematics
#index836236
#% 
#!
  
#*Algorithms for polyominoes based on the discrete Green theorem.
#@Srecko Brlek,Gilbert Labelle,Annie Lacasse
#t2005
#cDiscrete Applied Mathematics
#index836237
#%852341
#%1089139
#%1093147
#!
  
#*A Fast and Simple Steiner Routing Heuristic.
#@Manjit Borah,Robert Michael Owens,Mary Jane Irwin
#t1999
#cDiscrete Applied Mathematics
#index836238
#% 
#!
  
#*A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
#@Hajo Broersma,Elias Dahlhaus,Ton Kloks
#t2000
#cDiscrete Applied Mathematics
#index836239
#% 
#!
  
#*Weighted digital distance transforms in four dimensions.
#@Gunilla Borgefors
#t2003
#cDiscrete Applied Mathematics
#index836240
#%154009
#%154097
#%618815
#%833662
#%834853
#%835130
#%951478
#%1041949
#%1045649
#!
  
#*Some approaches to a conjecture on short cycles in digraphs.
#@Hajo Broersma,Xueliang Li
#t2002
#cDiscrete Applied Mathematics
#index836241
#%851113
#%853457
#%976096
#%977942
#!
  
#*Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time.
#@Richard B. Borie,Jeremy Spinrad
#t1999
#cDiscrete Applied Mathematics
#index836242
#% 
#!
  
#*Subgraphs, Closures and Hamiltonicity.
#@Hajo Broersma,Ingo Schiermeyer
#t1994
#cDiscrete Applied Mathematics
#index836243
#% 
#!
  
#*On the Non-minimal Codewords in Binary Reed-Muller Codes.
#@Yuri L. Borissov,Nickolai Manev,Svetla Nikova
#t2003
#cDiscrete Applied Mathematics
#index836244
#% 
#!
  
#*Splicing Representations of Strictly Locally Testable Languages.
#@Tom Head
#t1998
#cDiscrete Applied Mathematics
#index836245
#% 
#!
  
#*Semi-online scheduling jobs with tightly-grouped processing times on three identical machines.
#@Yong He,György Dósa
#t2005
#cDiscrete Applied Mathematics
#index836246
#%493530
#%621159
#%741859
#%809403
#%953152
#%971460
#%1058437
#%1089038
#!
  
#*Some simple optimization techniques for self-organized public key management in mobile ad hoc networks.
#@T. Bornand-Jaccard,David Schindl,Dominique de Werra
#t2006
#cDiscrete Applied Mathematics
#index836247
#%506431
#%812882
#%1114197
#!
  
#*A note on minimum degree conditions for supereulerian graphs.
#@Hajo Broersma,Liming Xiong
#t2002
#cDiscrete Applied Mathematics
#index836248
#%851258
#%852287
#%854743
#!
  
#*Discrete relaxations of combinatorial programs.
#@Ralf Borndörfer,Robert Weismantel
#t2001
#cDiscrete Applied Mathematics
#index836249
#% 
#!
  
#*On "The Matching Polynomial of a Polygraph".
#@Hajo Broersma,Xueliang Li
#t1993
#cDiscrete Applied Mathematics
#index836250
#% 
#!
  
#*Preface.
#@Oleg V. Borodin
#t2001
#cDiscrete Applied Mathematics
#index836251
#% 
#!
  
#*Interval arithmetic yields efficient dynamic filters for computational geometry.
#@Hervé Brönnimann,Christoph Burnikel,Sylvain Pion
#t2001
#cDiscrete Applied Mathematics
#index836252
#% 
#!
  
#*Preface: Russian Translations II.
#@Oleg V. Borodin
#t2004
#cDiscrete Applied Mathematics
#index836253
#% 
#!
  
#*The Complexity of Generalized Graph Colorings.
#@Jason I. Brown
#t1996
#cDiscrete Applied Mathematics
#index836254
#% 
#!
  
#*Acyclic colouring of 1-planar graphs.
#@Oleg V. Borodin,Alexandr V. Kostochka,André Raspaud,Eric Sopena
#t2001
#cDiscrete Applied Mathematics
#index836255
#% 
#!
  
#*Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes.
#@T. J. N. Brown,Roger B. Mallion,Paul Pollak,Arnd Roth
#t1996
#cDiscrete Applied Mathematics
#index836256
#% 
#!
  
#*Height of minor faces in plane normal maps.
#@Oleg V. Borodin,D. V. Loparev
#t2004
#cDiscrete Applied Mathematics
#index836257
#%851975
#!
  
#*Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes.
#@T. J. N. Brown,Roger B. Mallion,Paul Pollak,Arnd Roth
#t1997
#cDiscrete Applied Mathematics
#index836258
#% 
#!
  
#*Preface.
#@Endre Boros
#t1995
#cDiscrete Applied Mathematics
#index836259
#% 
#!
  
#*On the poset of all posets on n elements.
#@Richard A. Brualdi,Hyung Chan Jung,William T. Trotter
#t1994
#cDiscrete Applied Mathematics
#index836260
#% 
#!
  
#*Maximum Renamable Horn sub-CNFs.
#@Endre Boros
#t1999
#cDiscrete Applied Mathematics
#index836261
#% 
#!
  
#*Generalized Exponents of Primitive Symmetric Digraphs.
#@Richard A. Brualdi,Jia-Yu Shao
#t1997
#cDiscrete Applied Mathematics
#index836262
#% 
#!
  
#*An inequality for polymatroid functions and its applications.
#@Endre Boros,Khaled M. Elbassioni,Vladimir Gurvich,Leonid Khachiyan
#t2003
#cDiscrete Applied Mathematics
#index836263
#%2067
#%211482
#%620029
#%837012
#%837659
#%837657
#%887270
#%931986
#%952955
#%1058694
#%1089353
#!
  
#*On optimal broadcasting in faulty hypercubes.
#@Jehoshua Bruck
#t1994
#cDiscrete Applied Mathematics
#index836264
#% 
#!
  
#*Decomposability of Partially Defined Boolean Functions.
#@Endre Boros,Vladimir Gurvich,Peter L. Hammer,Toshihide Ibaraki,Alexander Kogan
#t1995
#cDiscrete Applied Mathematics
#index836265
#% 
#!
  
#*Scheduling and constraint propagation.
#@Peter Brucker
#t2002
#cDiscrete Applied Mathematics
#index836266
#%186405
#%406918
#%836284
#!
  
#*Dual-bounded generating problems: weighted transversals of a hypergraph.
#@Endre Boros,Vladimir Gurvich,Leonid Khachiyan,Kazuhisa Makino
#t2004
#cDiscrete Applied Mathematics
#index836267
#% 
#!
  
#*From hypertrees to arboreal quasi-ultrametrics.
#@François Brucker
#t2005
#cDiscrete Applied Mathematics
#index836268
#%741094
#%851642
#%864088
#%1061113
#!
  
#*On the number of vertices belonging to all maximum stable sets of a graph.
#@Endre Boros,Martin Charles Golumbic,Vadim E. Levit
#t2002
#cDiscrete Applied Mathematics
#index836269
#%837002
#!
  
#*Sub-dominant theory in numerical taxonomy.
#@François Brucker
#t2006
#cDiscrete Applied Mathematics
#index836270
#%741094
#%851642
#%1013773
#!
  
#*Pseudo-Boolean optimization.
#@Endre Boros,Peter L. Hammer
#t2002
#cDiscrete Applied Mathematics
#index836271
#%210090
#%211095
#%611395
#%622353
#%622266
#%798622
#%812882
#%835851
#%836275
#%836261
#%837128
#%837129
#%837440
#%837308
#%839491
#%851350
#%851680
#%854378
#%861892
#%950272
#%950456
#%950583
#%951077
#%953434
#%953667
#%972793
#%974776
#%977868
#%1013566
#%1013568
#%1061446
#%1061569
#!
  
#*Efficient Algorithms for Some Path Partitioning Problems.
#@Peter Brucker
#t1995
#cDiscrete Applied Mathematics
#index836272
#% 
#!
  
#*Balancing Problems in Acyclic Networks.
#@Endre Boros,Peter L. Hammer,Mark E. Hartmann,Ron Shamir
#t1994
#cDiscrete Applied Mathematics
#index836273
#% 
#!
  
#*A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags.
#@Peter Brucker,Thomas Hilbig,Johann Hurink
#t1999
#cDiscrete Applied Mathematics
#index836274
#% 
#!
  
#*Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization.
#@Endre Boros,Peter L. Hammer,Michel Minoux,David J. Rader Jr.
#t1999
#cDiscrete Applied Mathematics
#index836275
#% 
#!
  
#*A Branch & Bound Algorithm for the Open-shop Problem.
#@Peter Brucker,Johann Hurink,Bernd Jurisch,Birgit Wöstmann
#t1997
#cDiscrete Applied Mathematics
#index836276
#% 
#!
  
#*Combinatorial problems related to origin-destination matrices.
#@Endre Boros,Peter L. Hammer,Federica Ricca,Bruno Simeone
#t2001
#cDiscrete Applied Mathematics
#index836277
#% 
#!
  
#*Improving Local Search Heuristics for Some Scheduling Problems-I.
#@Peter Brucker,Johann Hurink,Frank Werner
#t1996
#cDiscrete Applied Mathematics
#index836278
#% 
#!
  
#*Recognition of q-Horn Formulae in Linear Time.
#@Endre Boros,Peter L. Hammer,Xiaorong Sun
#t1994
#cDiscrete Applied Mathematics
#index836279
#% 
#!
  
#*Improving Local Search Heuristics for some Scheduling Problems. Part II.
#@Peter Brucker,Johann Hurink,Frank Werner
#t1997
#cDiscrete Applied Mathematics
#index836280
#% 
#!
  
#*Block linear majorants in quadratic 0-1 optimization.
#@Endre Boros,Isabella Lari,Bruno Simeone
#t2004
#cDiscrete Applied Mathematics
#index836281
#%2616
#%851675
#!
  
#*Polyhedral Results for the Precedence-Constrained Knapsack Problem.
#@E. Andrew Boyd
#t1993
#cDiscrete Applied Mathematics
#index836282
#% 
#!
  
#*Outpaths in Semicomplete Multipartite Digraphs.
#@Yubao Guo
#t1999
#cDiscrete Applied Mathematics
#index836283
#% 
#!
  
#*A Branch and Bound Algorithm for the Job-Shop Scheduling Problem.
#@Peter Brucker,Bernd Jurisch,Bernd Sievers
#t1994
#cDiscrete Applied Mathematics
#index836284
#% 
#!
  
#*Cardinality constrained minimum cut problems: complexity and algorithms.
#@Maurizio Bruglieri,Francesco Maffioli,Matthias Ehrgott
#t2004
#cDiscrete Applied Mathematics
#index836285
#%798319
#%812393
#%836880
#%950456
#%951554
#%951673
#%1013705
#%1014136
#!
  
#*A polyhedral approach to an integer multicommodity flow problem.
#@Lorenzo Brunetta,Michele Conforti,Matteo Fischetti
#t2000
#cDiscrete Applied Mathematics
#index836286
#% 
#!
  
#*Solving the feedback vertex set problem on undirected graphs.
#@Lorenzo Brunetta,Francesco Maffioli,Marco Trubian
#t2000
#cDiscrete Applied Mathematics
#index836287
#% 
#!
  
#*Stability in Discrete Tomography: some positive results.
#@Sara Brunetti,Alain Daurat
#t2005
#cDiscrete Applied Mathematics
#index836288
#%854154
#%1089739
#%2892320
#!
  
#*Approximating minimal unsatisfiable subformulae by means of adaptive core search.
#@Renato Bruni
#t2003
#cDiscrete Applied Mathematics
#index836289
#%72072
#%371415
#%771155
#%950130
#%1078407
#!
  
#*Discrete models for data imputation.
#@Renato Bruni
#t2004
#cDiscrete Applied Mathematics
#index836290
#%328124
#%371415
#%813805
#%1013425
#%3007117
#!
  
#*A Complete Adaptive Algorithm for Propositional Satisfiability.
#@Renato Bruni,Antonio Sassano
#t2003
#cDiscrete Applied Mathematics
#index836291
#%72072
#%771155
#%950130
#%1013789
#%1058692
#%1078407
#!
  
#*Exact Bounds on the Order of the Maximum Clique of a Graph.
#@Marco Budinich
#t2003
#cDiscrete Applied Mathematics
#index836292
#%978455
#!
  
#*Mixed Interval Hypergraphs.
#@Elena Bulgaru,Vitaly I. Voloshin
#t1997
#cDiscrete Applied Mathematics
#index836293
#% 
#!
  
#*An analytic study of the phase transition line in local sequence alignment with gaps.
#@Ralf Bundschuh,Terence Hwa
#t2000
#cDiscrete Applied Mathematics
#index836294
#% 
#!
  
#*On subclasses of minimal unsatisfiable formulas.
#@Hans Kleine Büning
#t2000
#cDiscrete Applied Mathematics
#index836295
#% 
#!
  
#*Resolution Remains Hard Under Equivalence.
#@Hans Kleine Büning,Theodor Lettmann
#t1999
#cDiscrete Applied Mathematics
#index836296
#% 
#!
  
#*On the structure of some classes of minimal unsatisfiable formulas.
#@Hans Kleine Büning,Xishun Zhao
#t2003
#cDiscrete Applied Mathematics
#index836297
#%104660
#%751599
#%771155
#%836295
#%861073
#%950043
#%950130
#%951756
#%972760
#%974301
#%1059634
#!
  
#*An upper bound for the minimum number of queens covering the n x n chessboard.
#@Alewyn P. Burger,Christina M. Mynhardt
#t2002
#cDiscrete Applied Mathematics
#index836298
#%852431
#%852812
#%852823
#!
  
#*Strong thinning and polyhedric approximation of the surface of a voxel object.
#@Jasmine Burguet,Rémy Malgouyres
#t2003
#cDiscrete Applied Mathematics
#index836299
#%110530
#%154116
#%593822
#%833982
#%834104
#%834224
#%834577
#%842975
#%1031542
#%1031799
#%1043907
#%1091191
#%1093250
#!
  
#*Selected topics on assignment problems.
#@Rainer E. Burkard
#t2002
#cDiscrete Applied Mathematics
#index836300
#%406837
#%809611
#%809752
#%812092
#%836007
#%836303
#%836304
#%836709
#%837300
#%837916
#%839348
#%850565
#%951516
#%951554
#%952973
#%993684
#%1014141
#%2892280
#%3545704
#!
  
#*Finding all essential terms of a characteristic maxpolynomial.
#@Rainer E. Burkard,Peter Butkovic
#t2003
#cDiscrete Applied Mathematics
#index836301
#%3005546
#!
  
#*2-Medians in trees with pos/neg weights.
#@Rainer E. Burkard,Eranda Çela,Helidon Dollani
#t2000
#cDiscrete Applied Mathematics
#index836302
#% 
#!
  
#*Perspectives of Monge Properties in Optimization.
#@Rainer E. Burkard,Bettina Klinz,Rüdiger Rudolf
#t1996
#cDiscrete Applied Mathematics
#index836303
#% 
#!
  
#*Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients.
#@Rainer E. Burkard,Rüdiger Rudolf,Gerhard J. Woeginger
#t1996
#cDiscrete Applied Mathematics
#index836304
#% 
#!
  
#*Erratum: Constrained Partitioning Problems.
#@Rainer E. Burkard,En-Yu Yao
#t1993
#cDiscrete Applied Mathematics
#index836305
#% 
#!
  
#*A characterization of triangle-free tolerance graphs.
#@Arthur H. Busch
#t2006
#cDiscrete Applied Mathematics
#index836306
#%1144530
#!
  
#*Maximal cubic graphs with diameter 4.
#@Dominique Buset
#t2000
#cDiscrete Applied Mathematics
#index836307
#% 
#!
  
#*Simple image set of (max, +) linear mappings.
#@Peter Butkovic
#t2000
#cDiscrete Applied Mathematics
#index836308
#% 
#!
  
#*Strong Regularity of Matrices - A Survey of Results.
#@Peter Butkovic
#t1994
#cDiscrete Applied Mathematics
#index836309
#% 
#!
  
#*Regularity of Matrices in Min-algebra and Its Time- Complexity.
#@Peter Butkovic
#t1995
#cDiscrete Applied Mathematics
#index836310
#% 
#!
  
#*A strongly polynomial algorithm for solving two-sided linear systems in max-algebra.
#@Peter Butkovic,Karel Zimmermann
#t2006
#cDiscrete Applied Mathematics
#index836311
#% 
#!
  
#*On the number of generators for transeunt triangles.
#@Jon T. Butler,Gerhard W. Dueck,Svetlana N. Yanushkevich,Vlad P. Shmerko
#t2001
#cDiscrete Applied Mathematics
#index836312
#% 
#!
  
#*The path-variance problem on tree networks.
#@Teresa Cáceres,M. Cruz López-de-los-Mozos,Juan A. Mesa
#t2004
#cDiscrete Applied Mathematics
#index836313
#%75
#%813210
#!
  
#*Optimal embeddings of odd ladders into a hypercube.
#@Rostislav Caha,Václav Koubek
#t2002
#cDiscrete Applied Mathematics
#index836314
#% 
#!
  
#*Parameterized Complexity of Vertex Colouring.
#@Leizhen Cai
#t2003
#cDiscrete Applied Mathematics
#index836315
#%836194
#%837207
#%839345
#%887537
#%929689
#%952621
#%1058651
#%1059711
#!
  
#*The complexity of the locally connected spanning tree problem.
#@Leizhen Cai
#t2003
#cDiscrete Applied Mathematics
#index836316
#%836122
#%1059461
#!
  
#*An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order.
#@Mao-cheng Cai
#t1994
#cDiscrete Applied Mathematics
#index836317
#% 
#!
  
#*Multi-machine Scheduling with Variance Minimization.
#@Xiaoqiang Cai,T. C. Edwin Cheng
#t1998
#cDiscrete Applied Mathematics
#index836318
#% 
#!
  
#*On the SPANNING -Tree Problem.
#@Leizhen Cai,Frédéric Maffray
#t1993
#cDiscrete Applied Mathematics
#index836319
#% 
#!
  
#*A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph.
#@Leizhen Cai,Baruch Schieber
#t1997
#cDiscrete Applied Mathematics
#index836320
#% 
#!
  
#*Language-theoretic Complexity of Disjunctive Sequences.
#@Cristian Calude,Sheng Yu
#t1997
#cDiscrete Applied Mathematics
#index836321
#% 
#!
  
#*Design and Analysis of Fault-Tolerant Multibus Interconnection Networks.
#@Pietro Camarda,Mario Gerla
#t1992
#cDiscrete Applied Mathematics
#index836322
#% 
#!
  
#*Fine-grained forward-secure signature schemes without random oracles.
#@Jan Camenisch,Maciej Koprowski
#t2006
#cDiscrete Applied Mathematics
#index836323
#%83835
#%83825
#%83824
#%120154
#%120318
#%192939
#%193281
#%541132
#%541140
#%621630
#%1059369
#%3255938
#%3256778
#!
  
#*Fringe Thickness and Maximum Path Length of Binary Trees.
#@Helen Cameron
#t1998
#cDiscrete Applied Mathematics
#index836324
#% 
#!
  
#*Maximal Path Length of Binary Trees.
#@Helen Cameron,Derick Wood
#t1994
#cDiscrete Applied Mathematics
#index836325
#% 
#!
  
#*Dense Group Networks.
#@Lowell Campbell
#t1992
#cDiscrete Applied Mathematics
#index836326
#% 
#!
  
#*Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
#@Manoel B. Campêlo,Sulamita Klein
#t1998
#cDiscrete Applied Mathematics
#index836327
#% 
#!
  
#*Superfluous edges and exponential expansions of De Bruijn and Kautz graphs.
#@Eduardo A. Canale,José Gómez
#t2004
#cDiscrete Applied Mathematics
#index836328
#%836961
#%851238
#%1079168
#!
  
#*Asymptotically large (, )-graphs.
#@Eduardo A. Canale,José Gómez
#t2005
#cDiscrete Applied Mathematics
#index836329
#% 
#!
  
#*List signature schemes.
#@Sébastien Canard,Berry Schoenmakers,Martijn Stam,Jacques Traoré
#t2006
#cDiscrete Applied Mathematics
#index836330
#%83756
#%119675
#%119755
#%119848
#%119911
#%314749
#%327219
#%3255921
#%3256567
#!
  
#*Worst-case performance of Wong's Steiner tree heuristic.
#@Alfredo Candia-Véjar,Hugo Bravo-Azlán
#t2006
#cDiscrete Applied Mathematics
#index836331
#%837895
#%924227
#%934325
#%3612026
#!
  
#*An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.
#@E. Rodney Canfield,Konrad Engel
#t1999
#cDiscrete Applied Mathematics
#index836332
#% 
#!
  
#*On the facets of the simple plant location packing polytope.
#@Lázaro Cánovas,Mercedes Landete,Alfredo Marín
#t2002
#cDiscrete Applied Mathematics
#index836333
#%1013309
#!
  
#*Finding nonnormal bent functions.
#@Anne Canteaut,Magnus Daum,Hans Dobbertin,Gregor Leander
#t2006
#cDiscrete Applied Mathematics
#index836334
#%192907
#%959955
#!
  
#*Polyhedral Characterizations, Perfection of Line Graphs.
#@Dasong Cao,George L. Nemhauser
#t1998
#cDiscrete Applied Mathematics
#index836335
#% 
#!
  
#*Discrete facility location and routing of obnoxious activities.
#@Paola Cappanera,Giorgio Gallo,Francesco Maffioli
#t2003
#cDiscrete Applied Mathematics
#index836336
#% 
#!
  
#*Properties of some ILP Formulations of a Class of Partitioning Problems.
#@Alberto Caprara
#t1998
#cDiscrete Applied Mathematics
#index836337
#% 
#!
  
#*Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem.
#@Alberto Caprara,Juan José Salazar González
#t1999
#cDiscrete Applied Mathematics
#index836338
#% 
#!
  
#*On bandwidth-2 graphs.
#@Alberto Caprara,Federico Malucelli,Daniele Pretolani
#t2002
#cDiscrete Applied Mathematics
#index836339
#% 
#!
  
#*A Lagrangian heuristic algorithm for a real-world train timetabling problem.
#@Alberto Caprara,Michele Monaci,Paolo Toth,Pier Luigi Guida
#t2006
#cDiscrete Applied Mathematics
#index836340
#%812322
#%885405
#%1288761
#%1290096
#!
  
#*Lower bounds and algorithms for the 2-dimensional vector packing problem.
#@Alberto Caprara,Paolo Toth
#t2001
#cDiscrete Applied Mathematics
#index836341
#% 
#!
  
#*Approximate constrained bipartite edge coloring.
#@Ioannis Caragiannis,Afonso Ferreira,Christos Kaklamanis,Stephane Perennes,Pino Persiano,Hervé Rivano
#t2004
#cDiscrete Applied Mathematics
#index836342
#%268377
#%1060403
#%1089885
#!
  
#*Foreword.
#@Claude Carlet
#t2001
#cDiscrete Applied Mathematics
#index836343
#% 
#!
  
#*Preface.
#@Claude Carlet
#t2003
#cDiscrete Applied Mathematics
#index836344
#% 
#!
  
#*Preface.
#@Jacques Carlier,Alain Hertz,Frédéric Maffray,Marino Widmer
#t1999
#cDiscrete Applied Mathematics
#index836345
#% 
#!
  
#*A Decomposition Algorithm for Network Reliability Evaluation.
#@Jacques Carlier,Corinne Lucet
#t1996
#cDiscrete Applied Mathematics
#index836346
#% 
#!
  
#*Reliability Evaluation of Large Telecommunication Networks.
#@Jacques Carlier,Yu Li,Jean-Luc Lutton
#t1997
#cDiscrete Applied Mathematics
#index836347
#% 
#!
  
#*Jackson's pseudo-preemptive schedule and cumulative scheduling problems.
#@Jacques Carlier,Eric Pinson
#t2004
#cDiscrete Applied Mathematics
#index836348
#%836284
#%837996
#!
  
#*on the K-coloring of Intervals.
#@Martin C. Carlisle,Errol L. Lloyd
#t1995
#cDiscrete Applied Mathematics
#index836349
#% 
#!
  
#*Transistor Chaining in Static CMOS Functional Cells of Arbitrary Planar Topology.
#@Bradley S. Carlson,C. Y. Roger Chen,Dikran S. Meliksetian
#t1999
#cDiscrete Applied Mathematics
#index836350
#% 
#!
  
#*Some Democratic Secret Sharing Schemes.
#@Marco Carpentieri
#t1995
#cDiscrete Applied Mathematics
#index836351
#% 
#!
  
#*On the Number of Abelian Square-free Words on Four Letters.
#@Arturo Carpi
#t1998
#cDiscrete Applied Mathematics
#index836352
#% 
#!
  
#*Reduction of Symmetric Configurations n.
#@Hans Georg Carstens,Thomas Dinski,Eckhard Steffen
#t2000
#cDiscrete Applied Mathematics
#index836353
#% 
#!
  
#*Simultaneous fuzzy segmentation of multiple objects.
#@Bruno M. Carvalho,Gabor T. Herman,T. Yung Kong
#t2005
#cDiscrete Applied Mathematics
#index836354
#%2022
#%832677
#%834333
#%834578
#%1031894
#%1033214
#!
  
#*The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey.
#@Nathalie Caspard,Bernard Monjardet
#t2003
#cDiscrete Applied Mathematics
#index836355
#%105619
#%494897
#%836604
#%852315
#%852893
#%852564
#%1089816
#%1090655
#%1091373
#%3005077
#!
  
#*Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey: [Discrete Applied Mathematics 127(2) (2003) 241-269].
#@Nathalie Caspard,Bernard Monjardet
#t2005
#cDiscrete Applied Mathematics
#index836356
#% 
#!
  
#*Patterns in words and languages.
#@Giusi Castiglione,Antonio Restivo,Sergio Salemi
#t2004
#cDiscrete Applied Mathematics
#index836357
#%158468
#%741427
#!
  
#*Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
#@Paul A. Catlin,Jerrold W. Grossman,Arthur M. Hobbs,Hong-Jian Lai
#t1992
#cDiscrete Applied Mathematics
#index836358
#% 
#!
  
#*Scheduling projects with labor constraints.
#@Cristina C. B. Cavalcante,C. Carvalho de Souza,Martin W. P. Savelsbergh,Y. Wang,Laurence A. Wolsey
#t2001
#cDiscrete Applied Mathematics
#index836359
#% 
#!
  
#*On the complexity of exchange-stable roommates.
#@Katarína Cechlárová
#t2002
#cDiscrete Applied Mathematics
#index836360
#% 
#!
  
#*Eigenvectors of interval matrices over max-plus algebra.
#@Katarína Cechlárová
#t2005
#cDiscrete Applied Mathematics
#index836361
#%2616
#%620279
#%836303
#%1014221
#!
  
#*Trapezoidal Matrices and the Bottleneck Assignment Problem.
#@Katarína Cechlárová
#t1995
#cDiscrete Applied Mathematics
#index836362
#% 
#!
  
#*The stable crews problem.
#@Katarína Cechlárová,Sona Ferková
#t2004
#cDiscrete Applied Mathematics
#index836363
#%953161
#%953436
#%1061565
#%3003855
#!
  
#*Stable partitions with W -preferences.
#@Katarína Cechlárová,Jana Hajduková
#t2004
#cDiscrete Applied Mathematics
#index836364
#% 
#!
  
#*Persistency in combinatorial optimization problems on matroids.
#@Katarína Cechlárová,Vladimír Lacko
#t2001
#cDiscrete Applied Mathematics
#index836365
#% 
#!
  
#*The exchange-stable marriage problem.
#@Katarína Cechlárová,David Manlove
#t2005
#cDiscrete Applied Mathematics
#index836366
#%836360
#%953436
#%1061565
#%3003855
#!
  
#*Balanced Block Spacing for VLSI Layout.
#@Israel Cederbaum,Israel Koren,Shmuel Wimer
#t1992
#cDiscrete Applied Mathematics
#index836367
#% 
#!
  
#*Maximum independent set and maximum clique algorithms for overlap graphs.
#@Eowyn Cenek,Lorna Stewart
#t2003
#cDiscrete Applied Mathematics
#index836368
#%852428
#%853413
#%931337
#%934378
#!
  
#*Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing.
#@Ondrej Cepek,Petr Kucera
#t2005
#cDiscrete Applied Mathematics
#index836369
#%744723
#%745030
#%836275
#%836683
#%890323
#%931286
#%932945
#%949955
#%951084
#%953545
#%984529
#!
  
#*Establishing Determinantal Inequalities for Positive-definite Matrices.
#@J. Orestes Cerdeira,Isabel Faria,Paulo Bárcia
#t1995
#cDiscrete Applied Mathematics
#index836370
#% 
#!
  
#*Trees with three leaves are (n+1)-unavoidable.
#@Stéphan Ceroi,Frédéric Havet
#t2004
#cDiscrete Applied Mathematics
#index836371
#% 
#!
  
#*A Graph-theoretic Generalization of the Sauer-Shelah Lemma.
#@Nicolò Cesa-Bianchi,David Haussler
#t1998
#cDiscrete Applied Mathematics
#index836372
#% 
#!
  
#*Sandpiles and order structure of integer partitions.
#@Eric Goles Ch.,Michel Morvan,Ha Duong Phan
#t2002
#cDiscrete Applied Mathematics
#index836373
#% 
#!
  
#*Sensitivity Analysis in Isotonic Regression.
#@Nilotpal Chakravarti
#t1993
#cDiscrete Applied Mathematics
#index836374
#% 
#!
  
#*A simple algorithm to find the steps of double-loop networks.
#@Robin Chi-Feng Chan,Chiuyuan Chen,Zhi-Xin Hong
#t2002
#cDiscrete Applied Mathematics
#index836375
#%850711
#%853663
#%854572
#%951854
#%952776
#%988337
#%1078607
#%1090905
#%1092163
#%1122518
#!
  
#*Multi-terminal multipath flows: synthesis.
#@R. Chandrasekaran,Kunhiraman Nair,Yash P. Aneja,Santosh N. Kabadi
#t2004
#cDiscrete Applied Mathematics
#index836376
#% 
#!
  
#*The algorithmics of folding proteins on lattices.
#@Vijay Chandru,Abhi Dattasharma,V. S. Anil Kumar
#t2003
#cDiscrete Applied Mathematics
#index836377
#%186264
#%268846
#%310931
#%558690
#%609812
#%611116
#%811767
#%837787
#%962133
#%3006162
#!
  
#*Induced matchings in asteroidal triple-free graphs.
#@Jou-Ming Chang
#t2003
#cDiscrete Applied Mathematics
#index836378
#%660769
#%836956
#%836958
#%837122
#%837785
#%839458
#%847975
#%953368
#%1025783
#%1058703
#%1058966
#%1061125
#%1061230
#!
  
#*The weighted independent domination problem is NP-complete for chordal graphs.
#@Gerard J. Chang
#t2004
#cDiscrete Applied Mathematics
#index836379
#%836380
#!
  
#*Weighted Domination of Cocomparability Graphs.
#@Maw-Shang Chang
#t1997
#cDiscrete Applied Mathematics
#index836380
#% 
#!
  
#*Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.
#@Maw-Shang Chang,Yi-Hua Chen,Gerard J. Chang,Jing-Ho Yan
#t1996
#cDiscrete Applied Mathematics
#index836381
#% 
#!
  
#*Linear k-arboricities on trees.
#@Gerard J. Chang,Bor-Liang Chen,Hung-Lin Fu,Kuo-Ching Huang
#t2000
#cDiscrete Applied Mathematics
#index836382
#% 
#!
  
#*On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs.
#@Maw-Shang Chang,Chung-Chang Hsu
#t1997
#cDiscrete Applied Mathematics
#index836383
#% 
#!
  
#*The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines.
#@Soo Y. Chang,Hark-Chin Hwang
#t1999
#cDiscrete Applied Mathematics
#index836384
#% 
#!
  
#*Subtree and Substar Intersection Numbers.
#@Yi-Wu Chang,Michael S. Jacobson,Clyde L. Monma,Douglas B. West
#t1993
#cDiscrete Applied Mathematics
#index836385
#% 
#!
  
#*k-Subdomination in graphs.
#@Gerard J. Chang,Sheng-Chyang Liaw,Hong-Gwa Yeh
#t2002
#cDiscrete Applied Mathematics
#index836386
#% 
#!
  
#*Weighted Independent Perfect Domination on Cocomparability Graphs.
#@Gerard J. Chang,C. Pandu Rangan,Satyan R. Coorg
#t1995
#cDiscrete Applied Mathematics
#index836387
#% 
#!
  
#*Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
#@Maw-Shang Chang,Chuan Yi Tang,Richard C. T. Lee
#t1992
#cDiscrete Applied Mathematics
#index836388
#% 
#!
  
#*Domination in distance-hereditary graphs.
#@Maw-Shang Chang,Shaur-Ching Wu,Gerard J. Chang,Hong-Gwa Yeh
#t2002
#cDiscrete Applied Mathematics
#index836389
#% 
#!
  
#*Pseudo-Hamiltonian-connected graphs.
#@Gerard J. Chang,Xuding Zhu
#t2000
#cDiscrete Applied Mathematics
#index836390
#% 
#!
  
#*An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs.
#@H. S. Chao,Fang-Rong Hsu,Richard C. T. Lee
#t2000
#cDiscrete Applied Mathematics
#index836391
#% 
#!
  
#*A linear algorithm for minimum 1-identifying codes in oriented trees.
#@Irène Charon,Sylvain Gravier,Olivier Hudry,Antoine Lobstein,Michel Mollard,Julien Moncel
#t2006
#cDiscrete Applied Mathematics
#index836392
#%864090
#%1089985
#%3612438
#!
  
#*Noising methods for a clique partitioning problem.
#@Irène Charon,Olivier Hudry
#t2006
#cDiscrete Applied Mathematics
#index836393
#%741094
#%927129
#%1013773
#!
  
#*Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.
#@Irène Charon,Olivier Hudry,Frédéric Woirgard
#t1997
#cDiscrete Applied Mathematics
#index836394
#% 
#!
  
#*Special Issue on Coding and Cryptography.
#@Pascale Charpin,Gregory Kabatianski
#t2006
#cDiscrete Applied Mathematics
#index836395
#% 
#!
  
#*Resolvability in graphs and the metric dimension of a graph.
#@Gary Chartrand,Linda Eroh,Mark A. Johnson,Ortrud Oellermann
#t2000
#cDiscrete Applied Mathematics
#index836396
#% 
#!
  
#*Convexity in oriented graphs.
#@Gary Chartrand,John Frederick Fink,Ping Zhang
#t2002
#cDiscrete Applied Mathematics
#index836397
#% 
#!
  
#*Hamiltonian colorings of graphs.
#@Gary Chartrand,Ladislav Nebesky,Ping Zhang
#t2005
#cDiscrete Applied Mathematics
#index836398
#% 
#!
  
#*Average case complexity for finite Boolean functions.
#@A. V. Chashkin
#t2001
#cDiscrete Applied Mathematics
#index836399
#% 
#!
  
#*Lower bounds for the complexity of restrictions of Boolean functions.
#@A. V. Chashkin
#t2001
#cDiscrete Applied Mathematics
#index836400
#% 
#!
  
#*Local complexity of Boolean functions.
#@A. V. Chashkin
#t2004
#cDiscrete Applied Mathematics
#index836401
#%73
#!
  
#*Computation of Boolean functions by randomized programs.
#@A. V. Chashkin
#t2004
#cDiscrete Applied Mathematics
#index836402
#% 
#!
  
#*The Cyclic Cutwidth of Trees.
#@Joe D. Chavez,Rolland Trapp
#t1998
#cDiscrete Applied Mathematics
#index836403
#% 
#!
  
#*on the Structure of Trapezoid Graphs.
#@F. Cheah,Derek G. Corneil
#t1996
#cDiscrete Applied Mathematics
#index836404
#% 
#!
  
#*Asymptotically optimal erasure-resilient codes for large disk arrays.
#@Yeow Meng Chee,Charles J. Colbourn,Alan C. H. Ling
#t2000
#cDiscrete Applied Mathematics
#index836405
#% 
#!
  
#*A greedy approximation algorithm for the group Steiner problem.
#@Chandra Chekuri,Guy Even,Guy Kortsarz
#t2006
#cDiscrete Applied Mathematics
#index836406
#%210342
#%446414
#%610708
#%610476
#%610968
#%611392
#%621393
#%621671
#%621940
#%622234
#%622980
#%624142
#%660877
#%837402
#%929968
#%952980
#%1052141
#!
  
#*On a bidirected relaxation for the MULTIWAY CUT problem.
#@Chandra Chekuri,Anupam Gupta,Amit Kumar
#t2005
#cDiscrete Applied Mathematics
#index836407
#%268056
#%836698
#%971645
#%1013159
#%1058998
#%1129603
#!
  
#*Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine.
#@Chandra Chekuri,Rajeev Motwani
#t1999
#cDiscrete Applied Mathematics
#index836408
#% 
#!
  
#*Coronoid Systems with Perfect Matchings.
#@Rong-si Chen
#t1996
#cDiscrete Applied Mathematics
#index836409
#% 
#!
  
#*Parallel Machine Scheduling with Time Dependent Processing Times.
#@Zhi-Long Chen
#t1997
#cDiscrete Applied Mathematics
#index836410
#% 
#!
  
#*Total interval numbers of complete r-partite graphs.
#@Mingjang Chen,Gerard J. Chang
#t2002
#cDiscrete Applied Mathematics
#index836411
#% 
#!
  
#*On-line scheduling of small open shops.
#@Bo Chen,Donglei Du,Jiye Han,Jianjun Wen
#t2001
#cDiscrete Applied Mathematics
#index836412
#% 
#!
  
#*Lower bounds for computing geometric spanners and approximate shortest paths.
#@Danny Z. Chen,Gautam Das,Michiel H. M. Smid
#t2001
#cDiscrete Applied Mathematics
#index836413
#% 
#!
  
#*Regular Coronoid Systems.
#@Rong-si Chen,Fuji Zhang
#t1997
#cDiscrete Applied Mathematics
#index836414
#% 
#!
  
#*Hamilton Paths in Z-transformation Graphs of Perfect Matchings of Hexagonal Systems.
#@Rong-si Chen,Fuji Zhang
#t1997
#cDiscrete Applied Mathematics
#index836415
#% 
#!
  
#*Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests.
#@Zhi-Zhong Chen,Xin He
#t1996
#cDiscrete Applied Mathematics
#index836416
#% 
#!
  
#*Improved exact algorithms for M-S.
#@Jianer Chen,Iyad A. Kanj
#t2004
#cDiscrete Applied Mathematics
#index836417
#% 
#!
  
#*Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS).
#@Jianer Chen,Yanpei Liu,Suowang Chen,Songqiao Chen
#t2004
#cDiscrete Applied Mathematics
#index836418
#% 
#!
  
#*An Improved Lower Bound for the Bin Packing Problem.
#@Bintong Chen,Bharatendu Srivastava
#t1996
#cDiscrete Applied Mathematics
#index836419
#% 
#!
  
#*Sorting with Fixed-length Reversals.
#@Ting Chen,Steven Skiena
#t1996
#cDiscrete Applied Mathematics
#index836420
#% 
#!
  
#*A New Proof of Wojcicka's Conjecture.
#@Yaojun Chen,Feng Tian
#t2003
#cDiscrete Applied Mathematics
#index836421
#%849276
#%851547
#!
  
#*Equivalence classes of matchings and lattice-square designs.
#@William Y. C. Chen,David C. Torney
#t2005
#cDiscrete Applied Mathematics
#index836422
#%1061178
#!
  
#*Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems.
#@Bintong Chena,Monique Guignard
#t1998
#cDiscrete Applied Mathematics
#index836423
#% 
#!
  
#*A note on acyclic domination number in graphs of diameter two.
#@T. C. Edwin Cheng,Yaojun Chen,C. T. Ng
#t2006
#cDiscrete Applied Mathematics
#index836424
#%847861
#!
  
#*Time-stamped Graphs and Their Associated Influence Digraphs.
#@Eddie Cheng,Jerrold W. Grossman,Marc J. Lipman
#t2003
#cDiscrete Applied Mathematics
#index836425
#% 
#!
  
#*Batch Scheduling and Common Due-date Assignment on a Single Machine.
#@T. C. Edwin Cheng,Mikhail Y. Kovalyov
#t1996
#cDiscrete Applied Mathematics
#index836426
#% 
#!
  
#*Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness.
#@Eddie Cheng,Marc J. Lipman
#t2002
#cDiscrete Applied Mathematics
#index836427
#% 
#!
  
#*A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs.
#@Peng Cheng,Shigeru Masuyama
#t1995
#cDiscrete Applied Mathematics
#index836428
#% 
#!
  
#*Sparse orthogonal matrices and the Haar wavelet.
#@Gi-Sang Cheon,Bryan L. Shader
#t2000
#cDiscrete Applied Mathematics
#index836429
#% 
#!
  
#*A Multifacility Location Problem on Median Spaces.
#@Victor Chepoi
#t1996
#cDiscrete Applied Mathematics
#index836430
#% 
#!
  
#*Peakless Functions on Graphs.
#@Victor Chepoi
#t1997
#cDiscrete Applied Mathematics
#index836431
#% 
#!
  
#*Finding a central vertex in an HHD-free graph.
#@Victor Chepoi,Feodor F. Dragan
#t2003
#cDiscrete Applied Mathematics
#index836432
#%186031
#%621793
#%624118
#%851204
#%854351
#%1061268
#!
  
#*Clin D'oeil on L-embeddable Planar Graphs.
#@Victor Chepoi,Michel Deza,Viatcheslav P. Grishukhin
#t1997
#cDiscrete Applied Mathematics
#index836433
#% 
#!
  
#*Domination Number of the Cross Product of Paths.
#@Rachid Chérifi,Sylvain Gravier,Xavier Lagraula,Charles Payan,Ismaïl Zighem
#t1999
#cDiscrete Applied Mathematics
#index836434
#% 
#!
  
#*Residual reliability of P-threshold graphs.
#@Arkady A. Chernyak
#t2004
#cDiscrete Applied Mathematics
#index836435
#%836489
#%852753
#%1060511
#!
  
#*Note on Complexity of Computing the Domination of Binary Systems.
#@Arkady A. Chernyak,Zhanna A. Chernyak
#t1997
#cDiscrete Applied Mathematics
#index836436
#% 
#!
  
#*On an infinite sequence of improving Boolean bases.
#@D. U. Cherukhin
#t2001
#cDiscrete Applied Mathematics
#index836437
#% 
#!
  
#*Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance.
#@Grant A. Cheston,Gerd Fricke
#t1994
#cDiscrete Applied Mathematics
#index836438
#% 
#!
  
#*The even adjacency split problem for graphs.
#@Grant A. Cheston,Stephen T. Hedetniemi,Arthur L. Liestman,J. B. Stehman
#t2000
#cDiscrete Applied Mathematics
#index836439
#% 
#!
  
#*Generalized knight's tours on rectangular chessboards.
#@Gek L. Chia,Siew-Hui Ong
#t2005
#cDiscrete Applied Mathematics
#index836440
#%837453
#!
  
#*Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints.
#@Steve Y. Chiu,Louis Anthony Cox Jr.,Xiaorong Sun
#t1999
#cDiscrete Applied Mathematics
#index836441
#% 
#!
  
#*The structure of obstructions to treewidth and pathwidth.
#@Janka Chlebíková
#t2002
#cDiscrete Applied Mathematics
#index836442
#%837361
#%851391
#%932186
#%977721
#%1061748
#%1061780
#!
  
#*Fast gossiping with short unreliable messages.
#@Bogdan S. Chlebus,Krzysztof Diks,Andrzej Pelc
#t1994
#cDiscrete Applied Mathematics
#index836443
#% 
#!
  
#*A class of acyclic digraphs with interval competition graphs.
#@Han Hyuk Cho,Suh-Ryung Kim
#t2005
#cDiscrete Applied Mathematics
#index836444
#%853795
#%1061355
#%1061426
#!
  
#*The m-step competition graph of a digraph.
#@Han Hyuk Cho,Suh-Ryung Kim,Yunsun Nam
#t2000
#cDiscrete Applied Mathematics
#index836445
#% 
#!
  
#*Probabilistic Estimates for the Generalized Maximum Satisfiability Problem.
#@M. Chochand
#t1994
#cDiscrete Applied Mathematics
#index836446
#% 
#!
  
#*Improving the efficiency of parallel minimum spanning tree algorithms.
#@Ka Wong Chong,Yijie Han,Yoshihide Igarashi,Tak Wah Lam
#t2003
#cDiscrete Applied Mathematics
#index836447
#%105257
#%610245
#%610714
#%614187
#%621259
#%770603
#%772810
#%930665
#%953251
#%1058956
#%1058926
#%1078043
#%3006780
#!
  
#*Virtual network embedding in the cycle.
#@Sébastien Choplin,Aubin Jarry,Stéphane Pérennes
#t2005
#cDiscrete Applied Mathematics
#index836448
#%336612
#%543992
#%612202
#%653733
#%660522
#%836066
#%839343
#%1089221
#%1089320
#%1104914
#!
  
#*Compositions for Matroids with the Fulkerson Property.
#@Sunil Chopra
#t1995
#cDiscrete Applied Mathematics
#index836449
#% 
#!
  
#*Source Sink Flows with Capacity Installation in Batches.
#@Sunil Chopra,Itzhak Gilboa,S. Trilochan Sastry
#t1998
#cDiscrete Applied Mathematics
#index836450
#% 
#!
  
#*on Determining Non-isotopic Configurations of Points on a Circle.
#@Xin He,David B. Sher
#t1995
#cDiscrete Applied Mathematics
#index836451
#% 
#!
  
#*A Note on Formulations for the A-partition Problem on Hypergraphs.
#@Sunil Chopra,Jonathan H. Owen
#t1999
#cDiscrete Applied Mathematics
#index836452
#% 
#!
  
#*Facets of the K-partition Polytope.
#@Sunil Chopra,M. R. Rao
#t1995
#cDiscrete Applied Mathematics
#index836453
#% 
#!
  
#*Tree Scheduling with Communication Delays.
#@Philippe Chrétienne
#t1994
#cDiscrete Applied Mathematics
#index836454
#% 
#!
  
#*List Schedules for Cyclic Scheduling.
#@Philippe Chrétienne
#t1999
#cDiscrete Applied Mathematics
#index836455
#% 
#!
  
#*On constant composition codes.
#@Wensong Chu,Charles J. Colbourn,Peter Dukes
#t2006
#cDiscrete Applied Mathematics
#index836456
#%841876
#%1094756
#!
  
#*A Representation Theorem of the Suffixes of Characteristic Sequences.
#@Wai-fong Chuan
#t1998
#cDiscrete Applied Mathematics
#index836457
#% 
#!
  
#*Graphs with Small Diameter After Edge Deletion.
#@Fan R. K. Chung
#t1992
#cDiscrete Applied Mathematics
#index836458
#% 
#!
  
#*Note on Combinatorial Optimization with Max-Linear Objective Functions.
#@Sung-Jin Chung,Horst W. Hamacher,Francesco Maffioli,Katta G. Murty
#t1993
#cDiscrete Applied Mathematics
#index836459
#% 
#!
  
#*Which Claw-Free Graphs are Perfectly Orderable?
#@Vasek Chvátal
#t1993
#cDiscrete Applied Mathematics
#index836460
#% 
#!
  
#*Resolution Search.
#@Vasek Chvátal
#t1997
#cDiscrete Applied Mathematics
#index836461
#% 
#!
  
#*On searching strategies, parallel questions, and delayed answers.
#@Ferdinando Cicalese,Luisa Gargano,Ugo Vaccaro
#t2004
#cDiscrete Applied Mathematics
#index836462
#%209780
#%548303
#%836954
#%1015235
#%1093958
#!
  
#*Preface.
#@Ferdinando Cicalese,Daniele Mundici,Ugo Vaccaro
#t2004
#cDiscrete Applied Mathematics
#index836463
#% 
#!
  
#*Graphs with bounded induced distance.
#@Serafino Cicerone,Gabriele Di Stefano
#t2001
#cDiscrete Applied Mathematics
#index836464
#% 
#!
  
#*On the Extension of Bipartite to Parity Graphs.
#@Serafino Cicerone,Gabriele Di Stefano
#t1999
#cDiscrete Applied Mathematics
#index836465
#% 
#!
  
#*Graph Classes Between Parity and Distance-hereditary Graphs.
#@Serafino Cicerone,Gabriele Di Stefano
#t1999
#cDiscrete Applied Mathematics
#index836466
#% 
#!
  
#*Self-spanner graphs.
#@Serafino Cicerone,Gabriele Di Stefano,Dagmar Handke
#t2005
#cDiscrete Applied Mathematics
#index836467
#%544376
#%837060
#%836464
#%846815
#%974454
#%1058388
#%1058942
#%1058727
#%1059877
#%1079595
#%1125866
#!
  
#*Efficient Broadcasting with Linearly Bounded Faults.
#@Krzysztof Ciebiera,Adam Malinowski
#t1998
#cDiscrete Applied Mathematics
#index836468
#% 
#!
  
#*Algorithmic complexity of protein identification: combinatorics of weighted strings.
#@Mark Cieliebak,Thomas Erlebach,Zsuzsanna Lipták,Jens Stoye,Emo Welzl
#t2004
#cDiscrete Applied Mathematics
#index836469
#% 
#!
  
#*The Steiner ratio of high-dimensional Banach-Minkowski spaces.
#@Dietmar Cieslik
#t2004
#cDiscrete Applied Mathematics
#index836470
#%949569
#!
  
#*The Steiner Ratio of lamda.
#@Dietmar Cieslik
#t1999
#cDiscrete Applied Mathematics
#index836471
#% 
#!
  
#*Algorithms for the fixed linear crossing number problem.
#@Robert J. Cimikowski
#t2002
#cDiscrete Applied Mathematics
#index836472
#%61880
#%408681
#%660944
#%775237
#%803565
#%803948
#%837096
#%930435
#%951700
#%1080741
#%1124525
#%1124953
#%3401383
#!
  
#*On Certain Hamiltonian Inner Triangulations.
#@Robert J. Cimikowski
#t1993
#cDiscrete Applied Mathematics
#index836473
#% 
#!
  
#*Room allocation: a polynomial subcase of the quadratic assignment problem.
#@Valentina Ciriani,Nadia Pisanti,Anna Bernasconi
#t2004
#cDiscrete Applied Mathematics
#index836474
#%812728
#!
  
#*Circular a Avoiding Sequences with Prescribed Sum.
#@Dean S. Clark,James T. Lewis
#t1993
#cDiscrete Applied Mathematics
#index836475
#% 
#!
  
#*A Fixed Point Operator for the Generalised Maximum Satisfiability Problem.
#@Maurice Cochand
#t1993
#cDiscrete Applied Mathematics
#index836476
#% 
#!
  
#*on Preemptive Scheduling: A General Setting for the Two-phase Method.
#@Maurice Cochand,Arlette Gaillard
#t1996
#cDiscrete Applied Mathematics
#index836477
#% 
#!
  
#*Optimum Partitioning into Intersections of Ring Families.
#@Maurice Cochand,Arlette Gaillard,Heinz Gröflin
#t1997
#cDiscrete Applied Mathematics
#index836478
#% 
#!
  
#*An elementary algorithm for digital arc segmentation.
#@David Coeurjolly,Yan Gérard,Jean-Pierre Reveillès,Laure Tougne
#t2004
#cDiscrete Applied Mathematics
#index836479
#%154160
#%154223
#%974252
#%1032318
#%1033394
#%1044281
#!
  
#*On digital plane preimage structure.
#@David Coeurjolly,Isabelle Sivignon,Florent Dupont,Fabien Feschet,Jean-Marc Chassery
#t2005
#cDiscrete Applied Mathematics
#index836480
#%3482
#%154042
#%1032318
#%1044848
#!
  
#*on the Problem of Sorting Burnt Pancakes.
#@David S. Cohen,Manuel Blum
#t1995
#cDiscrete Applied Mathematics
#index836481
#% 
#!
  
#*Ladder orderings of pairs and RAID performance.
#@Myra B. Cohen,Charles J. Colbourn
#t2004
#cDiscrete Applied Mathematics
#index836482
#%419509
#%614185
#%832392
#%836405
#%1090197
#!
  
#*Supermodular functions and the complexity of MAX CSP.
#@David A. Cohen,Martin C. Cooper,Peter Jeavons,Andrei A. Krokhin
#t2005
#cDiscrete Applied Mathematics
#index836483
#%210235
#%210236
#%484521
#%611395
#%620802
#%623072
#%836303
#%838123
#%930781
#%950463
#%950618
#%950771
#%952151
#%971768
#%977868
#%1051942
#%1058998
#%1059760
#%1061284
#%1092339
#%1092390
#%3007117
#!
  
#*Intersecting Codes and Separating Codes.
#@Gérard D. Cohen,Sylvia B. Encheva,Simon Litsyn,Hans Georg Schaathun
#t2003
#cDiscrete Applied Mathematics
#index836484
#% 
#!
  
#*on the Channel Capacity of Read/write Isolated Memory.
#@Martin Cohn
#t1995
#cDiscrete Applied Mathematics
#index836485
#% 
#!
  
#*Projective planes and congestion-free networks.
#@Charles J. Colbourn
#t2002
#cDiscrete Applied Mathematics
#index836486
#%832459
#%836096
#%930662
#%1080073
#%1122846
#!
  
#*Coding, Cryptography, and Computer Security - Preface.
#@Charles J. Colbourn,Hadi Kharaghani
#t2000
#cDiscrete Applied Mathematics
#index836487
#% 
#!
  
#*A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
#@Charles J. Colbourn,J. Scott Provan,Dirk Vertigan
#t1995
#cDiscrete Applied Mathematics
#index836488
#% 
#!
  
#*Computing Residual Connectedness Reliability for Restricted Networks.
#@Charles J. Colbourn,Appajosyula Satyanarayana,Charles L. Suffel,Klaus Sutner
#t1993
#cDiscrete Applied Mathematics
#index836489
#% 
#!
  
#*Some Results on Greedy Algorithm Conjectures.
#@Timothy W. Cole
#t1994
#cDiscrete Applied Mathematics
#index836490
#% 
#!
  
#*Multiprocessor scheduling under precedence constraints: Polyhedral results.
#@Pablo E. Coll,Celso C. Ribeiro,Cid C. de Souza
#t2006
#cDiscrete Applied Mathematics
#index836491
#%2587
#%343249
#%410077
#%852219
#%950387
#%1013758
#%1014001
#%1035470
#%1061259
#%1125436
#%1125158
#%3006912
#!
  
#*Problem identification using program checking.
#@Christian S. Collberg,Todd A. Proebsting
#t2004
#cDiscrete Applied Mathematics
#index836492
#%219414
#%267413
#%546138
#%933638
#%949797
#%951800
#%953132
#%971885
#%3006063
#!
  
#*Vertex-symmetric Digraphs with Small Diameter.
#@Francesc Comellas,Miguel Angel Fiol
#t1995
#cDiscrete Applied Mathematics
#index836493
#% 
#!
  
#*Broadcasting in cycle prefix digraphs.
#@Francesc Comellas,Margarida Mitjana
#t1998
#cDiscrete Applied Mathematics
#index836494
#% 
#!
  
#*An approximation result for a periodic allocation problem.
#@Giuseppe Confessore,Paolo Dell'Olmo,Stefano Giordani
#t2001
#cDiscrete Applied Mathematics
#index836495
#% 
#!
  
#*An approximation result for the interval coloring problem on claw-free chordal graphs.
#@Giuseppe Confessore,Paolo Dell'Olmo,Stefano Giordani
#t2002
#cDiscrete Applied Mathematics
#index836496
#%610591
#%836495
#%836598
#%836947
#%852467
#%930825
#%932314
#%1080207
#!
  
#*Complexity and approximation results for scheduling multiprocessor tasks on a ring.
#@Giuseppe Confessore,Paolo Dell'Olmo,Stefano Giordani
#t2003
#cDiscrete Applied Mathematics
#index836497
#%836014
#%930069
#%930825
#%932314
#%1080207
#!
  
#*Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.
#@Michele Conforti,Gérard Cornuéjols,M. R. Rao
#t1995
#cDiscrete Applied Mathematics
#index836498
#% 
#!
  
#*Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.
#@Michele Conforti,Gérard Cornuéjols,Kristina Vuskovic
#t2004
#cDiscrete Applied Mathematics
#index836499
#%406720
#%975176
#%975180
#!
  
#*The complexity of minimizing certain cost metrics for k-source spanning trees.
#@Harold S. Connamacher,Andrzej Proskurowski
#t2003
#cDiscrete Applied Mathematics
#index836500
#%837634
#%838300
#%1061754
#!
  
#*Solution of the knight's Hamiltonian path problem on chessboards.
#@Axel Conrad,Tanja Hindrichs,Hussein Morsy,Ingo Wegener
#t1994
#cDiscrete Applied Mathematics
#index836501
#% 
#!
  
#*Graphs, networks, and linear unbiased estimates.
#@Gregory M. Constantine
#t2003
#cDiscrete Applied Mathematics
#index836502
#% 
#!
  
#*Polynomial Invariants for Trees a Statistical Mechanics Approach.
#@Roberto Conti,Pierluigi Contucci,Corrado Falcolini
#t1998
#cDiscrete Applied Mathematics
#index836503
#% 
#!
  
#*Probabilistic analysis of two k-cluster problems.
#@C. Cooper
#t1994
#cDiscrete Applied Mathematics
#index836504
#% 
#!
  
#*New Methods for Using Cayley Graphs in Interconnection Networks.
#@Gene Cooperman,Larry Finkelstein
#t1992
#cDiscrete Applied Mathematics
#index836505
#% 
#!
  
#*On the complexity of graph tree partition problems.
#@Roberto Cordone,Francesco Maffioli
#t2004
#cDiscrete Applied Mathematics
#index836506
#%837026
#%953048
#%1059341
#!
  
#*A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs.
#@Derek G. Corneil
#t2004
#cDiscrete Applied Mathematics
#index836507
#%85882
#%610994
#%930689
#%931133
#%933250
#%1059009
#%1059504
#%1059834
#%1091696
#!
  
#*Diameter determination on restricted graph families.
#@Derek G. Corneil,Feodor F. Dragan,Michel Habib,Christophe Paul
#t2001
#cDiscrete Applied Mathematics
#index836508
#% 
#!
  
#*Edge-disjoint packings of graphs.
#@Derek G. Corneil,Shigeru Masuyama,S. Louis Hakimi
#t1994
#cDiscrete Applied Mathematics
#index836509
#% 
#!
  
#*Ideal clutters.
#@Gérard Cornuéjols,Bertrand Guenin
#t2002
#cDiscrete Applied Mathematics
#index836510
#%406952
#%949978
#%949955
#%975209
#%977870
#%1013834
#%3007117
#%1061231
#!
  
#*Foreword.
#@Gérard Cornuéjols,William R. Pulleyblank
#t1998
#cDiscrete Applied Mathematics
#index836511
#% 
#!
  
#*On approximating the b-chromatic number.
#@Sylvie Corteel,Mario Valencia-Pabon,Juan Carlos Vera
#t2005
#cDiscrete Applied Mathematics
#index836512
#%660803
#%837221
#%950618
#!
  
#*Using graphs for some discrete tomography problems.
#@Marie-Christine Costa,Dominique de Werra,Christophe Picouleau
#t2006
#cDiscrete Applied Mathematics
#index836513
#%838351
#%1090176
#!
  
#*A solvable case of image reconstruction in discrete tomography.
#@Marie-Christine Costa,Dominique de Werra,Christophe Picouleau,David Schindl
#t2005
#cDiscrete Applied Mathematics
#index836514
#%1090176
#!
  
#*Definability of Boolean function classes by linear equations over GF(2).
#@Miguel Couceiro,Stephan Foldes
#t2004
#cDiscrete Applied Mathematics
#index836515
#% 
#!
  
#*Uncovering Generalized-Network Structure in Matrices.
#@Collette R. Coullard,John G. Del Greco,Donald K. Wagner
#t1993
#cDiscrete Applied Mathematics
#index836516
#% 
#!
  
#*Recognizing a Class of Bicircular Matroids.
#@Collette R. Coullard,John G. Del Greco,Donald K. Wagner
#t1993
#cDiscrete Applied Mathematics
#index836517
#% 
#!
  
#*The Dominant of the 2-connected-Steiner-subgraph Polytope for W-free Graphs.
#@Collette R. Coullard,Abdur Rais,Ronald L. Rardin,Donald K. Wagner
#t1996
#cDiscrete Applied Mathematics
#index836518
#% 
#!
  
#*The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures
#@Bruno Courcelle
#t1994
#cDiscrete Applied Mathematics
#index836519
#% 
#!
  
#*The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures.
#@Bruno Courcelle
#t1995
#cDiscrete Applied Mathematics
#index836520
#% 
#!
  
#*On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic.
#@Bruno Courcelle,Johann A. Makowsky,Udi Rotics
#t2001
#cDiscrete Applied Mathematics
#index836521
#% 
#!
  
#*Upper bounds to the clique width of graphs.
#@Bruno Courcelle,Stephan Olariu
#t2000
#cDiscrete Applied Mathematics
#index836522
#% 
#!
  
#*Query efficient implementation of graphs of bounded clique-width.
#@Bruno Courcelle,R. Vanicat
#t2003
#cDiscrete Applied Mathematics
#index836523
#%722
#%228672
#%228655
#%610585
#%836521
#%836522
#%1090212
#%1090228
#!
  
#*Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
#@Teodor Gabriel Crainic,Antonio Frangioni,Bernard Gendron
#t2001
#cDiscrete Applied Mathematics
#index836524
#% 
#!
  
#*Variable and Term Removal From Boolean Formulae.
#@Yves Crama,Oya Ekin,Peter L. Hammer
#t1997
#cDiscrete Applied Mathematics
#index836525
#% 
#!
  
#*Production planning problems in printed circuit board assembly.
#@Yves Crama,Joris van de Klundert,Frits C. R. Spieksma
#t2002
#cDiscrete Applied Mathematics
#index836526
#% 
#!
  
#*Satisfiability Threshold for Random XOR-CNF Formulas.
#@Nadia Creignou,Hervé Daudé
#t1999
#cDiscrete Applied Mathematics
#index836527
#% 
#!
  
#*A sharp threshold for the renameable-Horn and the q-Horn properties.
#@Nadia Creignou,Hervé Daudé,John V. Franco
#t2005
#cDiscrete Applied Mathematics
#index836528
#%209770
#%610106
#%610406
#%836835
#%878784
#%887561
#%933723
#%949955
#%951052
#%972011
#%984745
#%1051982
#%1058692
#%1090246
#%1091851
#!
  
#*On-line algorithms for the channel assignment problem in cellular networks.
#@Pilu Crescenzi,Giorgio Gambosi,Paolo Penna
#t2004
#cDiscrete Applied Mathematics
#index836529
#%155440
#%451398
#%566653
#%610930
#%614152
#%621161
#%952554
#%952552
#%953191
#%953265
#%988754
#%1013938
#%1058518
#%1089035
#%1141173
#%1141112
#%1141492
#!
  
#*Optimal covering designs: complexity results and new bounds.
#@Pilu Crescenzi,Federico Montecalvo,Gianluca Rossi
#t2004
#cDiscrete Applied Mathematics
#index836530
#%622980
#%3003185
#!
  
#*Dating to Marriage.
#@Judit Csima,László Lovász
#t1993
#cDiscrete Applied Mathematics
#index836531
#% 
#!
  
#*Two-Dimensional Rectangle Packing: On-Line Methods and Results.
#@János Csirik,J. B. G. Frenk,Martine Labbé
#t1993
#cDiscrete Applied Mathematics
#index836532
#% 
#!
  
#*A remark on evolutionary systems.
#@Erzsébet Csuhaj-Varjú,Jürgen Dassow
#t2005
#cDiscrete Applied Mathematics
#index836533
#%3004261
#%3306254
#!
  
#*Rational and Affine Expressions for Image Description.
#@Karel Culik II,Simant Dube
#t1993
#cDiscrete Applied Mathematics
#index836534
#% 
#!
  
#*Weighted Finite Transducers in Image Processing.
#@Karel Culik II,Ivan Fris
#t1995
#cDiscrete Applied Mathematics
#index836535
#% 
#!
  
#*-th order symmetric SAC boolean functions and bisecting binomial coefficients.
#@Thomas W. Cusick,Yuan Li
#t2005
#cDiscrete Applied Mathematics
#index836536
#%120020
#%192925
#%193267
#%864971
#%931429
#%986027
#%986006
#!
  
#*on Some Algorithmic Investigations of Star Partitions of Graphs.
#@Dragos Cvetkovic,Peter Rowlinson,Slobodan K. Simic
#t1995
#cDiscrete Applied Mathematics
#index836537
#% 
#!
  
#*Circumscribing Certain Polygonal Systems.
#@Sven J. Cyvin,Bjørg N. Cyvin,Jon Brunvoll,E. Keith Lloyd
#t1996
#cDiscrete Applied Mathematics
#index836538
#% 
#!
  
#*Partitioning problems in dense hypergraphs.
#@Andrzej Czygrinow
#t2002
#cDiscrete Applied Mathematics
#index836539
#% 
#!
  
#*Distributed algorithm for approximating the maximum matching.
#@Andrzej Czygrinow,Michal Hanckowiak,Edyta Szymanska
#t2004
#cDiscrete Applied Mathematics
#index836540
#%931152
#%1059943
#%1061449
#!
  
#*Guarding rectangular art galleries.
#@Jurek Czyzowicz,Eduardo Rivera-Campo,Nicola Santoro,Jorge Urrutia,Joseph Zaks
#t1994
#cDiscrete Applied Mathematics
#index836541
#% 
#!
  
#*Separation of Convex Sets.
#@Jurek Czyzowicz,Eduardo Rivera-Campo,Jorge Urrutia
#t1994
#cDiscrete Applied Mathematics
#index836542
#% 
#!
  
#*Properties and constraints of cheating-immune secret sharing schemes.
#@Paolo D'Arco,Wataru Kishimoto,Douglas R. Stinson
#t2006
#cDiscrete Applied Mathematics
#index836543
#%119629
#%192913
#%315015
#%327367
#%775946
#%841854
#%842426
#%986120
#!
  
#*Directed Steiner Problems with Connectivity Constraints.
#@Geir Dahl
#t1993
#cDiscrete Applied Mathematics
#index836544
#% 
#!
  
#*Optimization and reconstruction of -convex (0, 1)-matrices.
#@Geir Dahl,Truls Flatberg
#t2005
#cDiscrete Applied Mathematics
#index836545
#% 
#!
  
#*Minimal elimination ordering for graphs of bounded degree.
#@Elias Dahlhaus
#t2002
#cDiscrete Applied Mathematics
#index836546
#% 
#!
  
#*A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs.
#@Elias Dahlhaus
#t1994
#cDiscrete Applied Mathematics
#index836547
#% 
#!
  
#*Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs.
#@Elias Dahlhaus
#t1995
#cDiscrete Applied Mathematics
#index836548
#% 
#!
  
#*The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.
#@Elias Dahlhaus,Peter Damaschke
#t1994
#cDiscrete Applied Mathematics
#index836549
#% 
#!
  
#*MAD trees and distance-hereditary graphs.
#@Elias Dahlhaus,Peter Dankelmann,Wayne Goddard,Henda C. Swart
#t2003
#cDiscrete Applied Mathematics
#index836550
#%219539
#%836039
#%839425
#%930719
#%974454
#%1058996
#%1060654
#!
  
#*The train marshalling problem.
#@Elias Dahlhaus,Peter Horák,Mirka Miller,Joseph F. Ryan
#t2000
#cDiscrete Applied Mathematics
#index836551
#% 
#!
  
#*Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs.
#@Elias Dahlhaus,Marek Karpinski
#t1998
#cDiscrete Applied Mathematics
#index836552
#% 
#!
  
#*Transversal Partitioning in Balanced Hypergraphs.
#@Elias Dahlhaus,Jan Kratochvíl,Paul D. Manuel,Mirka Miller
#t1997
#cDiscrete Applied Mathematics
#index836553
#% 
#!
  
#*A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.
#@Yang Dai,Hiroshi Imai,Kazuo Iwano,Naoki Katoh,Keiji Ohtsuka,Nobuhiko Yoshimura
#t1996
#cDiscrete Applied Mathematics
#index836554
#% 
#!
  
#*Local symmetries in the period-doubling sequence.
#@David Damanik
#t2000
#cDiscrete Applied Mathematics
#index836555
#% 
#!
  
#*Minus domination in small-degree graphs.
#@Peter Damaschke
#t2001
#cDiscrete Applied Mathematics
#index836556
#% 
#!
  
#*Point placement on the line by distance data.
#@Peter Damaschke
#t2003
#cDiscrete Applied Mathematics
#index836557
#%621823
#%837744
#%1061695
#!
  
#*Approximate location of relevant variables under the crossover distribution.
#@Peter Damaschke
#t2004
#cDiscrete Applied Mathematics
#index836558
#% 
#!
  
#*Randomized vs. deterministic distance query strategies for point location on the line.
#@Peter Damaschke
#t2006
#cDiscrete Applied Mathematics
#index836559
#%836557
#%837744
#%953072
#!
  
#*A Tight Upper Bound for Group Testing in Graphs.
#@Peter Damaschke
#t1994
#cDiscrete Applied Mathematics
#index836560
#% 
#!
  
#*PLA Folding in Special Graph Classes.
#@Peter Damaschke
#t1994
#cDiscrete Applied Mathematics
#index836561
#% 
#!
  
#*Unique list-colourability and the fixing chromatic number of graphs.
#@Amir Daneshgar,Hossein Hajiabolhassan
#t2005
#cDiscrete Applied Mathematics
#index836562
#%836890
#%852648
#%977927
#%1061241
#!
  
#*Some Constructions of Superimposed Codes in Euclidean Spaces.
#@Danyo Danev
#t2003
#cDiscrete Applied Mathematics
#index836563
#%853502
#!
  
#*Gross substitution, discrete convexity, and submodularity.
#@Vladimir I. Danilov,Gleb A. Koshevoy,C. Lang
#t2003
#cDiscrete Applied Mathematics
#index836564
#% 
#!
  
#*Average Distance and Independence Number.
#@Peter Dankelmann
#t1994
#cDiscrete Applied Mathematics
#index836565
#% 
#!
  
#*Average Distance and Domination Number.
#@Peter Dankelmann
#t1997
#cDiscrete Applied Mathematics
#index836566
#% 
#!
  
#*Augmenting trees so that every three vertices lie on a cycle.
#@Peter Dankelmann,Wayne Goddard,Ortrud Oellermann,Henda C. Swart
#t2002
#cDiscrete Applied Mathematics
#index836567
#% 
#!
  
#*Bounds on the average connectivity of a graph.
#@Peter Dankelmann,Ortrud Oellermann
#t2003
#cDiscrete Applied Mathematics
#index836568
#% 
#!
  
#*Minimum average distance of strong orientations of graphs.
#@Peter Dankelmann,Ortrud Oellermann,Jian-Liang Wu
#t2004
#cDiscrete Applied Mathematics
#index836569
#% 
#!
  
#*On the Average Steiner Distance of Graphs with Prescribed Properties.
#@Peter Dankelmann,Henda C. Swart,Ortrud Oellermann
#t1997
#cDiscrete Applied Mathematics
#index836570
#% 
#!
  
#*On decision and optimization ()-graph sandwich problems.
#@Simone Dantas,Celina M. Herrera de Figueiredo,Luerbio Faria
#t2004
#cDiscrete Applied Mathematics
#index836571
#% 
#!
  
#*Stable skew partition problem.
#@Simone Dantas,Celina M. Herrera de Figueiredo,Sulamita Klein,Sylvain Gravier,Bruce A. Reed
#t2004
#cDiscrete Applied Mathematics
#index836572
#%481202
#%610145
#%621948
#%836174
#%952930
#%975210
#!
  
#*Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
#@Simone Dantas,Sylvain Gravier,Frédéric Maffray
#t2004
#cDiscrete Applied Mathematics
#index836573
#%837627
#%847744
#!
  
#*Derived neighborhoods and frontier orders.
#@Xavier Daragon,Michel Couprie,Gilles Bertrand
#t2005
#cDiscrete Applied Mathematics
#index836574
#%153960
#%834104
#%843597
#%854710
#%1339220
#%2864279
#!
  
#*Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems.
#@Sajal K. Das,Joydeep Ghosh,Narsingh Deo
#t1992
#cDiscrete Applied Mathematics
#index836575
#% 
#!
  
#*On the Complexity and Approximation of Syntenic Distance.
#@Bhaskar DasGupta,Tao Jiang,Sampath Kannan,Ming Li,Elizabeth Sweedyk
#t1998
#cDiscrete Applied Mathematics
#index836576
#% 
#!
  
#*Decision Problems and Regular Chain Code Picture Languages.
#@Jürgen Dassow,Friedhelm Hinz
#t1993
#cDiscrete Applied Mathematics
#index836577
#% 
#!
  
#*On the Regularity of Languages Generated by Context-free Evolutionary Grammars.
#@Jürgen Dassow,Gheorghe Paun
#t1999
#cDiscrete Applied Mathematics
#index836578
#% 
#!
  
#*Salient and reentrant points of discrete sets.
#@Alain Daurat,Maurice Nivat
#t2005
#cDiscrete Applied Mathematics
#index836579
#%154016
#%1089739
#!
  
#*Graph Domination, Tabu Search and the Football Pool Problem.
#@Rowan Davies,Gordon F. Royle
#t1997
#cDiscrete Applied Mathematics
#index836580
#% 
#!
  
#*Graph Partitioning Applied to the Logic Testing of Combinational Circuits.
#@Madlaine Davis-Moradkhan,Catherine Roucairol
#t1995
#cDiscrete Applied Mathematics
#index836581
#% 
#!
  
#*A simple expected running time analysis for randomized "divide and conquer" algorithms.
#@Brian C. Dean
#t2006
#cDiscrete Applied Mathematics
#index836582
#%2022
#%622443
#!
  
#*Rectangle-visibility Representations of Bipartite Graphs.
#@Alice M. Dean,Joan P. Hutchinson
#t1997
#cDiscrete Applied Mathematics
#index836583
#% 
#!
  
#*Detection of the discrete convexity of polyominoes.
#@Isabelle Debled-Rennesson,Jean-Luc Remy,Jocelyne Rouyer-Degli
#t2003
#cDiscrete Applied Mathematics
#index836584
#%818086
#%854154
#%854261
#%930582
#%1089139
#!
  
#*Linear segmentation of discrete curves into blurred segments.
#@Isabelle Debled-Rennesson,Jean-Luc Remy,Jocelyne Rouyer-Degli
#t2005
#cDiscrete Applied Mathematics
#index836585
#%67406
#%154223
#%834622
#%932911
#%1031451
#%1032318
#%1032841
#!
  
#*The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices.
#@Vladimir G. Deineko,Gerhard J. Woeginger
#t2000
#cDiscrete Applied Mathematics
#index836586
#% 
#!
  
#*Efficient dominating sets in Cayley graphs.
#@Italo J. Dejter,Oriol Serra
#t2003
#cDiscrete Applied Mathematics
#index836587
#%976727
#%1077859
#!
  
#*Maximum path digraphs.
#@Panayotis N. Delivorias,Reinhard J. Richter
#t1994
#cDiscrete Applied Mathematics
#index836588
#% 
#!
  
#*Efficient algorithms and codes for k-cardinality assignment problems.
#@Mauro Dell'Amico,Andrea Lodi,Silvano Martello
#t2001
#cDiscrete Applied Mathematics
#index836589
#% 
#!
  
#*on Some Multicriteria Arborescence Problems: Complexity and Algorithms.
#@Mauro Dell'Amico,Francesco Maffioli
#t1996
#cDiscrete Applied Mathematics
#index836590
#% 
#!
  
#*The k-cardinality Assignment Problem.
#@Mauro Dell'Amico,Silvano Martello
#t1997
#cDiscrete Applied Mathematics
#index836591
#% 
#!
  
#*The Base-matroid and Inverse Combinatorial Optimization Problems.
#@Mauro Dell'Amico,Francesco Maffioli,Federico Malucelli
#t2003
#cDiscrete Applied Mathematics
#index836592
#%797948
#%837210
#%1013470
#%3007117
#!
  
#*A lower bound for the non-oriented two-dimensional bin packing problem.
#@Mauro Dell'Amico,Silvano Martello,Daniele Vigo
#t2002
#cDiscrete Applied Mathematics
#index836593
#%1275185
#!
  
#*Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.
#@Mauro Dell'Amico,Silvano Martello,Daniele Vigo
#t1995
#cDiscrete Applied Mathematics
#index836594
#% 
#!
  
#*Algorithms and codes for dense assignment problems: the state of the art.
#@Mauro Dell'Amico,Paolo Toth
#t2000
#cDiscrete Applied Mathematics
#index836595
#% 
#!
  
#*On uniform -partition problems.
#@Paolo Dell'Olmo,Pierre Hansen,Stefano Pallottino,Giovanni Storchi
#t2005
#cDiscrete Applied Mathematics
#index836596
#% 
#!
  
#*Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.
#@Paolo Dell'Olmo,Maria Grazia Speranza
#t1999
#cDiscrete Applied Mathematics
#index836597
#% 
#!
  
#*Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
#@Paolo Dell'Olmo,Maria Grazia Speranza,Zsolt Tuza
#t1997
#cDiscrete Applied Mathematics
#index836598
#% 
#!
  
#*Which matrices are immune against the transportation paradox?
#@Vladimir G. Deineko,Bettina Klinz,Gerhard J. Woeginger
#t2003
#cDiscrete Applied Mathematics
#index836599
#%3005546
#!
  
#*Examples of Products Giving Large Graphs with Given Degree and Diameter.
#@Charles Delorme
#t1992
#cDiscrete Applied Mathematics
#index836600
#% 
#!
  
#*Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
#@Charles Delorme,Odile Favaron,Dieter Rautenbach
#t2003
#cDiscrete Applied Mathematics
#index836601
#%851835
#%852905
#!
  
#*Partial Dependencies in Relational Databases and their Realization.
#@János Demetrovics,Gyula O. H. Katona,Dezsö Miklós
#t1992
#cDiscrete Applied Mathematics
#index836602
#% 
#!
  
#*The Characterization of Branching Dependencies.
#@János Demetrovics,Gyula O. H. Katona,Attila Sali
#t1992
#cDiscrete Applied Mathematics
#index836603
#% 
#!
  
#*Functional Dependencies in Relational Databases: A Lattice Point of View.
#@János Demetrovics,Leonid Libkin,Ilya B. Muchnik
#t1992
#cDiscrete Applied Mathematics
#index836604
#% 
#!
  
#*Some Results About Normal Forms for Functional Dependency in the Relational Datamodel.
#@János Demetrovics,Vu Duc Thi
#t1996
#cDiscrete Applied Mathematics
#index836605
#% 
#!
  
#*On the construction of most reliable networks.
#@Hanyuan Deng,Jianer Chen,Qiaoliang Li,Rongheng Li,Qiju Gao
#t2004
#cDiscrete Applied Mathematics
#index836606
#%931027
#!
  
#*On the consistency of the minimum evolution principle of phylogenetic inference.
#@François Denis,Olivier Gascuel
#t2003
#cDiscrete Applied Mathematics
#index836607
#%1060987
#!
  
#*Bounds for probabilistic integer programming problems.
#@Darinka Dentcheva,András Prékopa,Andrzej Ruszczynski
#t2002
#cDiscrete Applied Mathematics
#index836608
#%1014354
#!
  
#*On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs.
#@Jitender S. Deogun,Ton Kloks,Dieter Kratsch,Haiko Müller
#t1999
#cDiscrete Applied Mathematics
#index836609
#% 
#!
  
#*Monotone concepts for formal concept analysis.
#@Jitender S. Deogun,Jamil Saquer
#t2004
#cDiscrete Applied Mathematics
#index836610
#%289964
#%290062
#%289976
#%982210
#%1009294
#%1091524
#!
  
#*Hamiltonian Cycle is Polynomial on Cocomparability Graphs.
#@Jitender S. Deogun,George Steiner
#t1992
#cDiscrete Applied Mathematics
#index836611
#% 
#!
  
#*Edge ranking of weighted trees.
#@Dariusz Dereniowski
#t2006
#cDiscrete Applied Mathematics
#index836612
#%415789
#%610941
#%661015
#%837473
#%839119
#%952725
#%953386
#!
  
#*The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function.
#@Madhav P. Desai,H. Narayanan,Sachin B. Patkar
#t2003
#cDiscrete Applied Mathematics
#index836613
#%133261
#%645144
#%953412
#!
  
#*A Family of Cayley Graphs on the Hexavalent Grid.
#@Dominique Désérable
#t1999
#cDiscrete Applied Mathematics
#index836614
#% 
#!
  
#*A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
#@Paolo Detti,Carlo Meloni
#t2004
#cDiscrete Applied Mathematics
#index836615
#%73
#%406787
#%837297
#%929632
#%929786
#%933437
#%934559
#%950486
#%951018
#%952941
#%1061343
#%1094718
#%1095250
#!
  
#*Expected worst-case partial match in random quadtries.
#@Luc Devroye,Carlos Zamora-Cura
#t2004
#cDiscrete Applied Mathematics
#index836616
#%70725
#%267971
#%651408
#%950303
#%1052327
#%2781182
#!
  
#*L-polytopes and Equiangular Lines.
#@Michel Deza,Viatcheslav P. Grishukhin
#t1995
#cDiscrete Applied Mathematics
#index836617
#% 
#!
  
#*Hypercube Embedding of Generalized Bipartite Metrics.
#@Michel Deza,Monique Laurent
#t1995
#cDiscrete Applied Mathematics
#index836618
#% 
#!
  
#*Cycle Structure of Edge Labelled Graphs.
#@James S. Diamond,Alberto O. Mendelzon
#t1993
#cDiscrete Applied Mathematics
#index836619
#% 
#!
  
#*Graph Theoretical Invariants and Elementary Subgraphs of Polyhex and Polypent/polyhex Systems of Chemical Relevance.
#@Jerry Ray Dias
#t1996
#cDiscrete Applied Mathematics
#index836620
#% 
#!
  
#*Description-meet compatible multiway dissimilarities.
#@Jean Diatta
#t2006
#cDiscrete Applied Mathematics
#index836621
#%851638
#%854352
#!
  
#*The restrictive -coloring problem.
#@Josep Díaz,Maria J. Serna,Dimitrios M. Thilikos
#t2005
#cDiscrete Applied Mathematics
#index836622
#% 
#!
  
#*Maximal and Stochastic Galois Lattices.
#@Edwin Diday,Richard Emilion
#t2003
#cDiscrete Applied Mathematics
#index836623
#% 
#!
  
#*Mixture decomposition of distributions by copulas in the symbolic data analysis framework.
#@Edwin Diday,Mathieu Vrac
#t2005
#cDiscrete Applied Mathematics
#index836624
#% 
#!
  
#*Graph minor hierarchies.
#@Reinhard Diestel,Daniela Kühn
#t2005
#cDiscrete Applied Mathematics
#index836625
#%975354
#%977711
#!
  
#*Efficient Reformulation for 0-1 Programs - Methods and Computational Results.
#@Brenda L. Dietrich,Laureano F. Escudero,F. Chance
#t1993
#cDiscrete Applied Mathematics
#index836626
#% 
#!
  
#*Gossiping and broadcasting versus computing functions in networks.
#@Martin Dietzfelbinger
#t2004
#cDiscrete Applied Mathematics
#index836627
#%704
#%614216
#%614238
#%620365
#%836832
#%837290
#%838132
#%971812
#%1058498
#%1058956
#%1059032
#%1059352
#%1059348
#%1059862
#%1060147
#%1091879
#%1093165
#!
  
#*Perfect Broadcasting in Unlabeled Networks.
#@Krzysztof Diks,Evangelos Kranakis,Andrzej Pelc
#t1998
#cDiscrete Applied Mathematics
#index836628
#% 
#!
  
#*Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete.
#@Michael B. Dillencourt
#t1996
#cDiscrete Applied Mathematics
#index836629
#% 
#!
  
#*SAT distributions with planted assignments and phase transitions between decision and optimization problems.
#@Tassos Dimitriou
#t2005
#cDiscrete Applied Mathematics
#index836630
#%11670
#%117953
#%745090
#%744926
#!
  
#*Generating r-regular graphs.
#@Guoli Ding,Peter P. Chen
#t2003
#cDiscrete Applied Mathematics
#index836631
#% 
#!
  
#*Matrix transpose on meshes with wormhole and XY routing.
#@Kuo-Shun Ding,Ching-Tien Ho,Jyh-Jong Tsay
#t1998
#cDiscrete Applied Mathematics
#index836632
#% 
#!
  
#*Two classes of ternary codes and their weight distributions.
#@Cunsheng Ding,Torleiv Kløve,Francesco Sica
#t2001
#cDiscrete Applied Mathematics
#index836633
#% 
#!
  
#*Several Classes of (2-1, w, 2) Optical Orthogonal Codes.
#@Cunsheng Ding,Chaoping Xing
#t2003
#cDiscrete Applied Mathematics
#index836634
#% 
#!
  
#*Compound Constructions of Broadcast Networks.
#@Michael J. Dinneen,Jose A. Ventura,Mark C. Wilson,Golbon Zakeri
#t1999
#cDiscrete Applied Mathematics
#index836635
#% 
#!
  
#*Broadcasting in m-dimensional grid graphs with a given neighborhood template.
#@Selma Djelloul
#t1994
#cDiscrete Applied Mathematics
#index836636
#% 
#!
  
#*Dynamic faults have small effect on broadcasting in hypercubes.
#@Stefan Dobrev,Imrich Vrto
#t2004
#cDiscrete Applied Mathematics
#index836637
#%836832
#%930877
#%931131
#%932876
#!
  
#*Non-independent randomized rounding and coloring.
#@Benjamin Doerr
#t2006
#cDiscrete Applied Mathematics
#index836638
#%830891
#%851165
#%972793
#%1025554
#%1051738
#%1060484
#!
  
#*Ordinal and symbolic data analysis.
#@Jean-Paul Doignon,Marc Pirlot
#t2005
#cDiscrete Applied Mathematics
#index836639
#% 
#!
  
#*A note on identities of two-dimensional languages.
#@Igor Dolinka
#t2005
#cDiscrete Applied Mathematics
#index836640
#%953809
#%1091785
#!
  
#*Determination of the star valency of a graph.
#@Jinquan Dong,Yanpei Liu,Cun-Quan Zhang
#t2003
#cDiscrete Applied Mathematics
#index836641
#%852528
#%854338
#!
  
#*A note on power domination in grid graphs.
#@Michael Dorfling,Michael A. Henning
#t2006
#cDiscrete Applied Mathematics
#index836642
#%1061459
#!
  
#*Higher Weights and Graded Rings for Binary Self-dual Codes.
#@Steven T. Dougherty,T. Aaron Gulliver,Manabu Oura
#t2003
#cDiscrete Applied Mathematics
#index836643
#%853511
#%3005856
#!
  
#*The complexity of irredundant sets parameterized by size.
#@Rodney G. Downey,Michael R. Fellows,Venkatesh Raman
#t2000
#cDiscrete Applied Mathematics
#index836644
#% 
#!
  
#*Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs.
#@Feodor F. Dragan
#t2000
#cDiscrete Applied Mathematics
#index836645
#% 
#!
  
#*Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS.
#@Feodor F. Dragan
#t1999
#cDiscrete Applied Mathematics
#index836646
#% 
#!
  
#*LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem.
#@Feodor F. Dragan,Falk Nicolai
#t2000
#cDiscrete Applied Mathematics
#index836647
#% 
#!
  
#*Incidence Graphs of Biacyclic Hypergraphs.
#@Feodor F. Dragan,Vitaly I. Voloshin
#t1996
#cDiscrete Applied Mathematics
#index836648
#% 
#!
  
#*Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform.
#@Andreas W. M. Dress,Barbara Holland,Katharina T. Huber,Jack H. Koolen,Vincent Moulton,Jan Weyer-Menkhoff
#t2005
#cDiscrete Applied Mathematics
#index836649
#% 
#!
  
#*Analyzing and Visualizing Sequence and Distance Data Using SplitsTree.
#@Andreas W. M. Dress,Daniel H. Huson,Vincent Moulton
#t1996
#cDiscrete Applied Mathematics
#index836650
#% 
#!
  
#*Tree Enterprises and Bankruptcy Ventures a Game Theoretic Similarity Due to a Graph Theoretic Proof.
#@Theo S. H. Driessen
#t1997
#cDiscrete Applied Mathematics
#index836651
#% 
#!
  
#*Scheduling Dyadic Intervals.
#@James R. Driscoll,Dennis M. Healy Jr.,Garth Isaak
#t1995
#cDiscrete Applied Mathematics
#index836652
#% 
#!
  
#*Openshop Scheduling with Machine Dependent Processing Times.
#@Moshe Dror
#t1992
#cDiscrete Applied Mathematics
#index836653
#% 
#!
  
#*Vehicle routing with split deliveries.
#@Moshe Dror,Gilbert Laporte,Pierre Trudeau
#t1994
#cDiscrete Applied Mathematics
#index836654
#% 
#!
  
#*On exclusion regions for optimal triangulations.
#@Robert L. (Scot) Drysdale III,Scott A. McElfresh,Jack Snoeyink
#t2001
#cDiscrete Applied Mathematics
#index836655
#% 
#!
  
#*A Special Case for Subset Interconnection Designs.
#@Ding-Zhu Du,Biao Gao,Weili Wu
#t1997
#cDiscrete Applied Mathematics
#index836656
#% 
#!
  
#*Connectivity of Consecutive- Digraphs.
#@Ding-Zhu Du,D. Frank Hsu,G. W. Peck
#t1992
#cDiscrete Applied Mathematics
#index836657
#% 
#!
  
#*Sparse Hypercube 3-spanners.
#@William Duckworth,Michele Zito
#t2000
#cDiscrete Applied Mathematics
#index836658
#% 
#!
  
#*Recursive error correction for general Reed-Muller codes.
#@Ilya Dumer,Kirill Shabunov
#t2006
#cDiscrete Applied Mathematics
#index836659
#% 
#!
  
#*The cost of cutting out convex -gons.
#@Adrian Dumitrescu
#t2004
#cDiscrete Applied Mathematics
#index836660
#% 
#!
  
#*Broadcasts in graphs.
#@Jean E. Dunbar,David J. Erwin,Teresa W. Haynes,Sandra Mitchell Hedetniemi,Stephen T. Hedetniemi
#t2006
#cDiscrete Applied Mathematics
#index836661
#% 
#!
  
#*The Algorithmic Complexity of Minus Domination in Graphs.
#@Jean E. Dunbar,Wayne Goddard,Stephen T. Hedetniemi,Alice A. McRae,Michael A. Henning
#t1996
#cDiscrete Applied Mathematics
#index836662
#% 
#!
  
#*Provably secure non-interactive key distribution based on pairings.
#@Régis Dupont,Andreas Enge
#t2006
#cDiscrete Applied Mathematics
#index836663
#%42711
#%51047
#%120455
#%541206
#%570347
#%841800
#%842228
#%985847
#%3256331
#!
  
#*Constructing Efficient Simulated Annealing Algorithms.
#@Manuel Duque-Antón
#t1997
#cDiscrete Applied Mathematics
#index836664
#% 
#!
  
#*Constructing Efficient Simulated Annealing Algorithms.
#@Manuel Duque-Antón
#t1997
#cDiscrete Applied Mathematics
#index836665
#% 
#!
  
#*Finding sharper distinctions for conditions of transitivity of the majority method.
#@Sylvain Durand
#t2003
#cDiscrete Applied Mathematics
#index836666
#% 
#!
  
#*Inversions in k-sorted Permutations.
#@Ronald D. Dutton
#t1998
#cDiscrete Applied Mathematics
#index836667
#% 
#!
  
#*From weight enumerators to zeta functions.
#@Iwan M. Duursma
#t2001
#cDiscrete Applied Mathematics
#index836668
#% 
#!
  
#*Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network.
#@Shane Dye,Leen Stougie,Asgeir Tomasgard
#t2003
#cDiscrete Applied Mathematics
#index836669
#%950753
#!
  
#*On a Universal Chain Problem.
#@Martin E. Dyer
#t1994
#cDiscrete Applied Mathematics
#index836670
#% 
#!
  
#*Three-dimensional orthogonal graph drawing algorithms.
#@Peter Eades,Antonios Symvonis,Sue Whitesides
#t2000
#cDiscrete Applied Mathematics
#index836671
#% 
#!
  
#*On completing latin squares.
#@T. Easton,R. Gary Parker
#t2001
#cDiscrete Applied Mathematics
#index836672
#% 
#!
  
#*On the Definition and the Construction of Pockets in Macromolecules.
#@Herbert Edelsbrunner,Michael A. Facello,Jie Liang
#t1998
#cDiscrete Applied Mathematics
#index836673
#% 
#!
  
#*On monochromatic component size for improper colourings.
#@Keith Edwards,Graham Farr
#t2005
#cDiscrete Applied Mathematics
#index836674
#%974249
#%975456
#%976185
#%978247
#!
  
#*The Complexity of Harmonious Colouring for Trees.
#@Keith Edwards,Colin McDiarmid
#t1995
#cDiscrete Applied Mathematics
#index836675
#% 
#!
  
#*132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers.
#@Eric S. Egge,Toufik Mansour
#t2004
#cDiscrete Applied Mathematics
#index836676
#%851523
#%852017
#%852432
#%951700
#%974751
#%1095213
#!
  
#*Routeing Winter Gritting Vehicles.
#@Richard W. Eglese
#t1994
#cDiscrete Applied Mathematics
#index836677
#% 
#!
  
#*Preface: International Symposium on Combinatorial Optimisation.
#@Richard W. Eglese,Martin G. Everett,Chris N. Potts,Vitaly A. Strusevich
#t2003
#cDiscrete Applied Mathematics
#index836678
#% 
#!
  
#*Geometric Methods to Solve Max-Ordering Location Problems.
#@Matthias Ehrgott,Horst W. Hamacher,Stefan Nickel
#t1999
#cDiscrete Applied Mathematics
#index836679
#% 
#!
  
#*The Disjoint Shortest Paths Problem.
#@Tali Eilam-Tzoreff
#t1998
#cDiscrete Applied Mathematics
#index836680
#% 
#!
  
#*The vehicle routing problem with pickups and deliveries on some special graphs.
#@Tali Eilam-Tzoreff,Daniel Granot,Frieda Granot,Greys Sosic
#t2002
#cDiscrete Applied Mathematics
#index836681
#% 
#!
  
#*Bidual Horn Functions and Extensions.
#@Thomas Eiter,Toshihide Ibaraki,Kazuhisa Makino
#t1999
#cDiscrete Applied Mathematics
#index836682
#% 
#!
  
#*Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete.
#@Thomas Eiter,Pekka Kilpeläinen,Heikki Mannila
#t1995
#cDiscrete Applied Mathematics
#index836683
#% 
#!
  
#*On Connected Boolean Functions.
#@Oya Ekin,Peter L. Hammer,Alexander Kogan
#t1999
#cDiscrete Applied Mathematics
#index836684
#% 
#!
  
#*Orthogonal double covers of K by small graphs.
#@Ramadan El-Shanawany,Hans-Dietrich O. F. Gronau,Martin Grüttmüller
#t2004
#cDiscrete Applied Mathematics
#index836685
#% 
#!
  
#*Independence and domination in Polygon Graphs.
#@Ehab S. Elmallah,Lorna K. Stewart
#t1993
#cDiscrete Applied Mathematics
#index836686
#% 
#!
  
#*How to Count Efficiently all Affine Roots of a Polynomial System.
#@Ioannis Z. Emiris,Jan Verschelde
#t1999
#cDiscrete Applied Mathematics
#index836687
#% 
#!
  
#*Faa` di Bruno's formula, lattices, and partitions.
#@Luis Hernández Encinas,Ángel Martín del Rey,Jaime Muñoz Masqué
#t2005
#cDiscrete Applied Mathematics
#index836688
#% 
#!
  
#*on Sparse Languages L such that LL = Sigma.
#@Per Enflo,Andrew Granville,Jeffrey Shallit,Sheng Yu
#t1994
#cDiscrete Applied Mathematics
#index836689
#% 
#!
  
#*A new algorithm for optimal multileaf collimator field segmentation.
#@Konrad Engel
#t2005
#cDiscrete Applied Mathematics
#index836690
#% 
#!
  
#*Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph.
#@Hikoe Enomoto,Miki Shimabara Miyauchi,Katsuhiro Ota
#t1999
#cDiscrete Applied Mathematics
#index836691
#% 
#!
  
#*Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem.
#@Hikoe Enomoto,Yoshiaki Oda,Katsuhiro Ota
#t1998
#cDiscrete Applied Mathematics
#index836692
#% 
#!
  
#*Complexity results on a paint shop problem.
#@Thomas Epping,Winfried Hochstättler,Peter Oertel
#t2004
#cDiscrete Applied Mathematics
#index836693
#%950456
#!
  
#*Tight bounds for bandwidth allocation on two links.
#@Leah Epstein
#t2005
#cDiscrete Applied Mathematics
#index836694
#%185950
#!
  
#*Optimal on-line flow time with resource augmentation.
#@Leah Epstein,Rob van Stee
#t2006
#cDiscrete Applied Mathematics
#index836695
#%406865
#%621327
#%622128
#%622471
#%622620
#%950817
#!
  
#*Multiplicities of Interpoint Distances in Finite Planar Sets.
#@Paul Erdös,Peter C. Fishburn
#t1995
#cDiscrete Applied Mathematics
#index836696
#% 
#!
  
#*Intervertex Distances in Convex Polygons.
#@Paul Erdös,Peter C. Fishburn
#t1995
#cDiscrete Applied Mathematics
#index836697
#% 
#!
  
#*Minimum Multiway Cuts in Trees.
#@Péter L. Erdös,András Frank,László A. Székely
#t1998
#cDiscrete Applied Mathematics
#index836698
#% 
#!
  
#*Counting Bichromatic Evolutionary Trees.
#@Péter L. Erdös,László A. Székely
#t1993
#cDiscrete Applied Mathematics
#index836699
#% 
#!
  
#*Directed Moore Hypergraphs.
#@Fahir Ö. Ergincan,David A. Gregory
#t1995
#cDiscrete Applied Mathematics
#index836700
#% 
#!
  
#*Conversion of coloring algorithms into maximum weight independent set algorithms.
#@Thomas Erlebach,Klaus Jansen
#t2005
#cDiscrete Applied Mathematics
#index836701
#%46604
#%46479
#%186536
#%211823
#%613995
#%613999
#%622215
#%651101
#%839345
#%949707
#%951041
#%971905
#%979969
#%1061291
#%1090917
#!
  
#*Path problems in generalized stars, complete graphs, and brick wall graphs.
#@Thomas Erlebach,Danica Vukadinovic
#t2006
#cDiscrete Applied Mathematics
#index836702
#%46526
#%211651
#%268059
#%611355
#%622215
#%622955
#%949590
#%1089002
#%1090917
#%1090915
#%3005125
#%3005546
#!
  
#*Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow.
#@Thomas R. Ervolina,S. Thomas McCormick
#t1993
#cDiscrete Applied Mathematics
#index836703
#% 
#!
  
#*Recognition of Some Perfectly Orderable Graph Classes.
#@Elaine M. Eschen,Julie L. Johnson,Jeremy Spinrad,R. Sritharan
#t2003
#cDiscrete Applied Mathematics
#index836704
#%70760
#%610337
#%611318
#%622286
#%622298
#%660603
#%850532
#%851185
#%851204
#%851455
#%851376
#%852663
#%853630
#%933209
#%993684
#%1091997
#!
  
#*Right Invariant Metrics and Measures of Presortedness.
#@Vladimir Estivill-Castro,Heikki Mannila,Derick Wood
#t1993
#cDiscrete Applied Mathematics
#index836705
#% 
#!
  
#*On the Chromatic Number, Colorings, and Codes of the Johnson Graph.
#@Tuvi Etzion,Sara Bitan
#t1996
#cDiscrete Applied Mathematics
#index836706
#% 
#!
  
#*On the Equivalence of Two Tree Mapping Measures.
#@Oliver Eulenstein,Martin Vingron
#t1998
#cDiscrete Applied Mathematics
#index836707
#% 
#!
  
#*Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes.
#@Reinhardt Euler,Hervé Le Verge
#t1995
#cDiscrete Applied Mathematics
#index836708
#% 
#!
  
#*Time-tables, Polyhedra and the Greedy Algorithm.
#@Reinhardt Euler,Hervé Le Verge
#t1996
#cDiscrete Applied Mathematics
#index836709
#% 
#!
  
#*Errata to "Selecting the Top Three Elements" by M. Aigner: A Result of a Computer-Assisted Proof Search.
#@Jutta Eusterbrock
#t1993
#cDiscrete Applied Mathematics
#index836710
#% 
#!
  
#*Minimal enumerations of subsets of a finite set and the middle level problem.
#@A. A. Evdokimov,A. L. Perezhogin
#t2001
#cDiscrete Applied Mathematics
#index836711
#% 
#!
  
#*Stabbing Information of a Simple Polygon.
#@Hazel Everett,Ferran Hurtado,Marc Noy
#t1999
#cDiscrete Applied Mathematics
#index836712
#% 
#!
  
#*An Algorithm for Finding Homogeneous Pairs.
#@Hazel Everett,Sulamita Klein,Bruce A. Reed
#t1997
#cDiscrete Applied Mathematics
#index836713
#% 
#!
  
#*Bipartite Graphs and Digraphs with Maximum Connectivity.
#@Josep Fàbrega,Miguel Angel Fiol
#t1996
#cDiscrete Applied Mathematics
#index836714
#% 
#!
  
#*Fault-tolerant Routings in Double Fixed-step Networks.
#@Josep Fàbrega,Marisa Zaragozá
#t1997
#cDiscrete Applied Mathematics
#index836715
#% 
#!
  
#*Recursive bounds for perfect hashing.
#@Emanuela Fachini,Alon Nilli
#t2001
#cDiscrete Applied Mathematics
#index836716
#% 
#!
  
#*On the Subword Equivalence Problem for Morphic Words.
#@Isabelle Fagnot
#t1997
#cDiscrete Applied Mathematics
#index836717
#% 
#!
  
#*Generalized balances in Sturmian words.
#@Isabelle Fagnot,Laurent Vuillon
#t2002
#cDiscrete Applied Mathematics
#index836718
#%852303
#%1093487
#!
  
#*A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
#@Ulrich Faigle,Noud Gademann,Walter Kern
#t1995
#cDiscrete Applied Mathematics
#index836719
#% 
#!
  
#*Preface.
#@Ulrich Faigle,Kees Hoede
#t1994
#cDiscrete Applied Mathematics
#index836720
#% 
#!
  
#*Preface.
#@Ulrich Faigle,Kees Hoede
#t1997
#cDiscrete Applied Mathematics
#index836721
#% 
#!
  
#*Note on Scheduling Intervals on-line.
#@Ulrich Faigle,Willem M. Nawijn
#t1995
#cDiscrete Applied Mathematics
#index836722
#% 
#!
  
#*Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
#@Ulrich Faigle,Stefan Pickl,Hajo Broersma,Johann Hurink
#t2004
#cDiscrete Applied Mathematics
#index836723
#% 
#!
  
#*The Communication Complexity of Interval Orders.
#@Ulrich Faigle,Rainer Schrader,György Turán
#t1992
#cDiscrete Applied Mathematics
#index836724
#% 
#!
  
#*Media theory.
#@Jean-Claude Falmagne,Sergei Ovchinnikov
#t2002
#cDiscrete Applied Mathematics
#index836725
#%852154
#%3005077
#!
  
#*On the computational complexity of upper total domination.
#@Qizhi Fang
#t2004
#cDiscrete Applied Mathematics
#index836726
#%839435
#%930006
#!
  
#*Total Balancedness Condition for Steiner Tree Games.
#@Qizhi Fang,Mao-cheng Cai,Xiaotie Deng
#t2003
#cDiscrete Applied Mathematics
#index836727
#%610611
#%3449689
#%3449631
#!
  
#*On the typical case complexity of graph optimization.
#@András Faragó
#t2005
#cDiscrete Applied Mathematics
#index836728
#%104612
#%117122
#%623296
#%816324
#%1051992
#%1052242
#%1052263
#%1052234
#%1052012
#%1059915
#%1122864
#%1141499
#!
  
#*Inverse Optimization in High-speed Networks.
#@András Faragó,Áron Szentesi,Balázs Szviatovszki
#t2003
#cDiscrete Applied Mathematics
#index836729
#%1013470
#%1013471
#!
  
#*SPLITTING NUMBER is NP-complete.
#@Luerbio Faria,Celina M. Herrera de Figueiredo,Candido Ferreira Xavier de Mendonça Neto
#t2001
#cDiscrete Applied Mathematics
#index836730
#% 
#!
  
#*On the complexity of the approximation of nonplanarity parameters for cubic graphs.
#@Luerbio Faria,Celina M. Herrera de Figueiredo,Candido Ferreira Xavier de Mendonça Neto
#t2004
#cDiscrete Applied Mathematics
#index836731
#%836730
#%952685
#!
  
#*Bounded-call broadcasting.
#@Arthur M. Farley,Andrzej Proskurowski
#t1994
#cDiscrete Applied Mathematics
#index836732
#% 
#!
  
#*Minimum-time multidrop broadcast.
#@Arthur M. Farley,Andrzej Pelc,Andrzej Proskurowski
#t1998
#cDiscrete Applied Mathematics
#index836733
#% 
#!
  
#*Spanners and message distribution in networks.
#@Arthur M. Farley,Andrzej Proskurowski,Daniel Zappala,Kurt J. Windisch
#t2004
#cDiscrete Applied Mathematics
#index836734
#%544376
#%588579
#%835962
#%1061140
#%3612026
#!
  
#*Goppa-like Bounds for the Generalized Feng-Rao Distances.
#@José Ignacio Farrán,Carlos Munuera
#t2003
#cDiscrete Applied Mathematics
#index836735
#%853935
#%1060956
#!
  
#*Orientable convexity, geodetic and hull numbers in graphs.
#@Alastair Farrugia
#t2005
#cDiscrete Applied Mathematics
#index836736
#%836397
#%864281
#!
  
#*Generalized Degrees and Menger Path Systems.
#@Ralph J. Faudree,Ronald J. Gould,Linda M. Lesniak
#t1992
#cDiscrete Applied Mathematics
#index836737
#% 
#!
  
#*On local and global independence numbers of a graph.
#@Ralph J. Faudree,Zdenek Ryjácek,Richard H. Schelp
#t2003
#cDiscrete Applied Mathematics
#index836738
#%977944
#!
  
#*Independence and upper irredundance in claw-free graphs.
#@Odile Favaron
#t2003
#cDiscrete Applied Mathematics
#index836739
#%850815
#%851744
#%851549
#%852084
#%852650
#!
  
#*An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem.
#@Didier Fayard,Gérard Plateau
#t1994
#cDiscrete Applied Mathematics
#index836740
#% 
#!
  
#*A polyhedral approach for a constrained quadratic 0-1 problem.
#@Alain Faye,Quoc-an Trinh
#t2005
#cDiscrete Applied Mathematics
#index836741
#%836005
#%836128
#%837646
#%1013577
#%1013909
#%1013575
#%3007117
#!
  
#*On Cutting a Few Vertices from a Graph.
#@Uriel Feige,Robert Krauthgamer,Kobbi Nissim
#t2003
#cDiscrete Applied Mathematics
#index836742
#%210578
#%621967
#%930252
#%950841
#!
  
#*The Forbidden Projections of Unate Functions.
#@Aaron Feigelson,Lisa Hellerstein
#t1997
#cDiscrete Applied Mathematics
#index836743
#% 
#!
  
#*Tree spanners in planar graphs.
#@Sándor P. Fekete,Jana Kremer
#t2001
#cDiscrete Applied Mathematics
#index836744
#% 
#!
  
#*Optimal algorithms for dissemination of information in generalized communication modes.
#@Rainer Feldmann,Juraj Hromkovic,Seshu Madhavapeddy,Burkhard Monien,Peter Mysliwietz
#t1994
#cDiscrete Applied Mathematics
#index836745
#% 
#!
  
#*Large Planar Graphs with Given Diameter and Maximum Degree.
#@Michael R. Fellows,Pavol Hell,Karen Seyffarth
#t1995
#cDiscrete Applied Mathematics
#index836746
#% 
#!
  
#*Constructing Colorings for Diagrams.
#@Stefan Felsner,Jens Gustedt,Michel Morvan,Jean-Xavier Rampon
#t1994
#cDiscrete Applied Mathematics
#index836747
#% 
#!
  
#*Trapezoid Graphs and Generalizations, Geometry and Algorithms.
#@Stefan Felsner,Rudolf Müller,Lorenz Wernisch
#t1997
#cDiscrete Applied Mathematics
#index836748
#% 
#!
  
#*Sweeps, arrangements and signotopes.
#@Stefan Felsner,Helmut Weil
#t2001
#cDiscrete Applied Mathematics
#index836749
#% 
#!
  
#*Unextendible product bases and 1-factorization of complete graphs.
#@Keqin Feng
#t2006
#cDiscrete Applied Mathematics
#index836750
#%974270
#!
  
#*Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2.
#@Feng Tian,Bing Wei,Zhang Lei
#t1999
#cDiscrete Applied Mathematics
#index836751
#% 
#!
  
#*On the Approximability of the Steiner Tree Problem in Phylogeny.
#@David Fernández-Baca,Jens Lagergren
#t1998
#cDiscrete Applied Mathematics
#index836752
#% 
#!
  
#*Bounds for parametric sequence comparison.
#@David Fernández-Baca,Timo Seppäläinen,Giora Slutzki
#t2002
#cDiscrete Applied Mathematics
#index836753
#% 
#!
  
#*Rearrangement of DNA fragments: a branch-and-cut algorithm.
#@Carlos Eduardo Ferreira,C. Carvalho de Souza,Yoshiko Wakabayashi
#t2002
#cDiscrete Applied Mathematics
#index836754
#% 
#!
  
#*Connectivity and fault-tolerance of hyperdigraphs.
#@Daniela Ferrero,Carles Padró
#t2002
#cDiscrete Applied Mathematics
#index836755
#% 
#!
  
#*A classification result on weighted {, ;, }-minihypers.
#@Sandy Ferret,Leo Storme
#t2006
#cDiscrete Applied Mathematics
#index836756
#% 
#!
  
#*A survey on Knödel graphs.
#@Guillaume Fertin,André Raspaud
#t2004
#cDiscrete Applied Mathematics
#index836757
#% 
#!
  
#*An approach for the estimation of the precision of a real object from its digitization.
#@Fabien Feschet,Laure Tougne
#t2004
#cDiscrete Applied Mathematics
#index836758
#%154223
#%496697
#%774795
#%833678
#!
  
#*On the min DSS problem of closed discrete curves.
#@Fabien Feschet,Laure Tougne
#t2005
#cDiscrete Applied Mathematics
#index836759
#%1032318
#!
  
#*Minimum convex partition of a constrained point set.
#@Thomas Fevens,Henk Meijer,David Rappaport
#t2001
#cDiscrete Applied Mathematics
#index836760
#% 
#!
  
#*Fixed-parameter complexity of lambda-labelings.
#@Jirí Fiala,Ton Kloks,Jan Kratochvíl
#t2001
#cDiscrete Applied Mathematics
#index836761
#% 
#!
  
#*Systems of distant representatives.
#@Jirí Fiala,Jan Kratochvíl,Andrzej Proskurowski
#t2005
#cDiscrete Applied Mathematics
#index836762
#%211796
#%224831
#%368303
#%610390
#%837424
#%1061170
#%1061419
#%1141066
#!
  
#*Generalized list T-colorings of cycles.
#@Jirí Fiala,Riste Skrekovski
#t2005
#cDiscrete Applied Mathematics
#index836763
#%1061419
#%1061777
#!
  
#*A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems.
#@Claude-Nicolas Fiechter
#t1994
#cDiscrete Applied Mathematics
#index836764
#% 
#!
  
#*On the classification of extremal even formally self-dual codes of lengths 20 and 22.
#@J. E. Fields,Philippe Gaborit,W. Cary Huffman,Vera Pless
#t2001
#cDiscrete Applied Mathematics
#index836765
#% 
#!
  
#*A note on transitive orientations with maximum sets of sources and sinks.
#@Celina M. Herrera de Figueiredo,John G. Gimbel,Célia Picinin de Mello,Jayme Luiz Szwarcfiter
#t2002
#cDiscrete Applied Mathematics
#index836766
#%70760
#%610337
#%611113
#%611111
#!
  
#*Even and Odd Pairs in Comparability and in P4-comparability Graphs.
#@Celina M. Herrera de Figueiredo,John G. Gimbel,Célia Picinin de Mello,Jayme Luiz Szwarcfiter
#t1999
#cDiscrete Applied Mathematics
#index836767
#% 
#!
  
#*The graph sandwich problem for 1-join composition is NP-complete.
#@Celina M. Herrera de Figueiredo,Sulamita Klein,Kristina Vuskovic
#t2002
#cDiscrete Applied Mathematics
#index836768
#%611111
#%930352
#%950477
#%951220
#%953010
#%1059709
#!
  
#*Recognition of quasi-Meyniel graphs.
#@Celina M. Herrera de Figueiredo,Kristina Vuskovic
#t2001
#cDiscrete Applied Mathematics
#index836769
#% 
#!
  
#*On well-covered triangulations: Part I.
#@Art S. Finbow,Bert Hartnell,Richard J. Nowakowski,Michael D. Plummer
#t2003
#cDiscrete Applied Mathematics
#index836770
#%851733
#%854536
#%978147
#%978148
#!
  
#*Whist Tournaments - Three Person Property.
#@Norman J. Finizio
#t1993
#cDiscrete Applied Mathematics
#index836771
#% 
#!
  
#*Z-cyclic Whist Tournaments with a Patterned Starter Initial Round.
#@Norman J. Finizio
#t1994
#cDiscrete Applied Mathematics
#index836772
#% 
#!
  
#*An Infinite Class of Z-cyclic Whist Tournaments on v Players, v 1 (mod 4).
#@Norman J. Finizio
#t1996
#cDiscrete Applied Mathematics
#index836773
#% 
#!
  
#*More ZCPS-Wh(v) and Several New Infinite Classes of Z-cyclic Whist Tournaments.
#@Norman J. Finizio,Philip A. Leonard
#t1998
#cDiscrete Applied Mathematics
#index836774
#% 
#!
  
#*Some new Z-cyclic whist tournaments.
#@Norman J. Finizio,Adele J. Merritt
#t2000
#cDiscrete Applied Mathematics
#index836775
#% 
#!
  
#*A Variant of the Permutation Flow Shop Model with Variable Processing Times.
#@Gerd Finke,H. Jiang
#t1997
#cDiscrete Applied Mathematics
#index836776
#% 
#!
  
#*Divider-based algorithms for hierarchical tree partitioning.
#@Irene Finocchi,Rossella Petreschi
#t2004
#cDiscrete Applied Mathematics
#index836777
#%610126
#%642427
#%835863
#%836068
#%837595
#%951301
#%1059884
#!
  
#*Single Machine Scheduling Subject To Precedence Delays.
#@Lucian Finta,Zhen Liu
#t1996
#cDiscrete Applied Mathematics
#index836778
#% 
#!
  
#*The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs.
#@Miguel Angel Fiol,Ernest Garriga
#t1998
#cDiscrete Applied Mathematics
#index836779
#% 
#!
  
#*The -step, same-step, and any-step competition graphs.
#@Wei Ho
#t2005
#cDiscrete Applied Mathematics
#index836780
#% 
#!
  
#*Determining the automorphism group of the linear ordering polytope.
#@Samuel Fiorini
#t2001
#cDiscrete Applied Mathematics
#index836781
#% 
#!
  
#*Facets of linear signed order polytopes.
#@Samuel Fiorini,Peter C. Fishburn
#t2003
#cDiscrete Applied Mathematics
#index836782
#%837516
#%1061074
#!
  
#*How to fake an RSA signature by encoding modular root finding as a SAT problem.
#@Claudia Fiorini,Enrico Martinelli,Fabio Massacci
#t2003
#cDiscrete Applied Mathematics
#index836783
#%11931
#%487829
#%744626
#%745867
#%751848
#%771155
#%771694
#%775450
#%950130
#%954880
#%954767
#%1059474
#%1077906
#%1078074
#%1078407
#%1079636
#%1082552
#%3003407
#%3005937
#!
  
#*Independence and Average Distance in Graphs.
#@Peter Firby,Julie Haviland
#t1997
#cDiscrete Applied Mathematics
#index836784
#% 
#!
  
#*On the Cut-off Point for Combinatorial Group Testing.
#@Paul Fischer,Norbert Klasner,Ingo Wegener
#t1999
#cDiscrete Applied Mathematics
#index836785
#% 
#!
  
#*Optimal Layout of Edge-weighted Forests.
#@Michael J. Fischer,Mike Paterson
#t1999
#cDiscrete Applied Mathematics
#index836786
#% 
#!
  
#*Wiener index versus maximum degree in trees.
#@Miranca Fischermann,Arne Hoffmann,Dieter Rautenbach,László A. Székely,Lutz Volkmann
#t2002
#cDiscrete Applied Mathematics
#index836787
#%836039
#!
  
#*A Linear-programming Approach to the Generalized Randic Index.
#@Miranca Fischermann,Arne Hoffmann,Dieter Rautenbach,Lutz Volkmann
#t2003
#cDiscrete Applied Mathematics
#index836788
#% 
#!
  
#*Graphs having distance-n domination number half their order.
#@Miranca Fischermann,Lutz Volkmann
#t2002
#cDiscrete Applied Mathematics
#index836789
#% 
#!
  
#*A note on the number of matchings and independent sets in trees.
#@Miranca Fischermann,Lutz Volkmann,Dieter Rautenbach
#t2005
#cDiscrete Applied Mathematics
#index836790
#% 
#!
  
#*Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope.
#@Matteo Fischetti
#t1995
#cDiscrete Applied Mathematics
#index836791
#% 
#!
  
#*Correlation in Partially Ordered Sets.
#@Peter C. Fishburn
#t1992
#cDiscrete Applied Mathematics
#index836792
#% 
#!
  
#*Decision Theory and Discrete Mathematics.
#@Peter C. Fishburn
#t1996
#cDiscrete Applied Mathematics
#index836793
#% 
#!
  
#*On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
#@Peter C. Fishburn,Frank K. Hwang,Ding-Zhu Du,Biao Gao
#t1997
#cDiscrete Applied Mathematics
#index836794
#% 
#!
  
#*No-hole L(2, 1)-colorings.
#@Peter C. Fishburn,Fred S. Roberts
#t2003
#cDiscrete Applied Mathematics
#index836795
#% 
#!
  
#*Elemantary Sequences, Sub-Fibonacci Sequences.
#@Peter C. Fishburn,Fred S. Roberts
#t1993
#cDiscrete Applied Mathematics
#index836796
#% 
#!
  
#*The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming.
#@Peter C. Fishburn,Peter Schwander,Larry A. Shepp,Robert J. Vanderbei
#t1997
#cDiscrete Applied Mathematics
#index836797
#% 
#!
  
#*Interference patterns in bijective colorings of 2-regular graphs.
#@Peter C. Fishburn,Paul E. Wright
#t2000
#cDiscrete Applied Mathematics
#index836798
#% 
#!
  
#*Fractional dominations and fractional total dominations of graph complements.
#@David C. Fisher
#t2002
#cDiscrete Applied Mathematics
#index836799
#%836802
#%836800
#!
  
#*Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs.
#@David C. Fisher,Patricia A. McKenna,Elizabeth D. Boyer
#t1998
#cDiscrete Applied Mathematics
#index836800
#% 
#!
  
#*Probabilities Within optimal Strategies for Tournament Games.
#@David C. Fisher,Jennifer Ryan
#t1995
#cDiscrete Applied Mathematics
#index836801
#% 
#!
  
#*Fractional domination of strong direct products.
#@David C. Fisher,Jennifer Ryan,Gayla S. Domke,Aniket Majumdar
#t1994
#cDiscrete Applied Mathematics
#index836802
#% 
#!
  
#*Distributive online channel assignment for hexagonal cellular networks with constraints.
#@Shannon L. Fitzpatrick,Jeannette Janssen,Richard J. Nowakowski
#t2004
#cDiscrete Applied Mathematics
#index836803
#%847964
#%953191
#!
  
#*Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.
#@Philippe Flajolet,Danièle Gardy,Loÿs Thimonier
#t1992
#cDiscrete Applied Mathematics
#index836804
#% 
#!
  
#*Hamiltonicity of Bipartite Biclaw-free Graphs.
#@Evelyne Flandrin,Jean-Luc Fouquet,Hao Li
#t1994
#cDiscrete Applied Mathematics
#index836805
#% 
#!
  
#*A push-relabel framework for submodular function minimization and applications to parametric optimization.
#@Lisa Fleischer,Satoru Iwata
#t2003
#cDiscrete Applied Mathematics
#index836806
#%797948
#%950463
#%950771
#%977868
#%1059273
#!
  
#*Optimal irreversible dynamos in chordal rings.
#@Paola Flocchini,Frédéric Geurts,Nicola Santoro
#t2001
#cDiscrete Applied Mathematics
#index836807
#% 
#!
  
#*Dynamic monopolies in tori.
#@Paola Flocchini,Elena Lodi,Fabrizio Luccio,Linda Pagli,Nicola Santoro
#t2004
#cDiscrete Applied Mathematics
#index836808
#%196441
#%415920
#%836807
#%850835
#%853081
#%979559
#%988337
#%1094103
#!
  
#*Symmetries and Sense of Direction in Labeled Graphs.
#@Paola Flocchini,Alessandro Roncato,Nicola Santoro
#t1998
#cDiscrete Applied Mathematics
#index836809
#% 
#!
  
#*on Powers of M-trapezoid Graphs.
#@Carsten Flotow
#t1995
#cDiscrete Applied Mathematics
#index836810
#% 
#!
  
#*On Powers of Circular Arc Graphs and Proper Circular Arc Graphs.
#@Carsten Flotow
#t1996
#cDiscrete Applied Mathematics
#index836811
#% 
#!
  
#*A modular approach to Sprouts.
#@Riccardo Focardi,Flaminia L. Luccio
#t2004
#cDiscrete Applied Mathematics
#index836812
#% 
#!
  
#*Disjunctive and conjunctive normal forms of pseudo-Boolean functions.
#@Stephan Foldes,Peter L. Hammer
#t2000
#cDiscrete Applied Mathematics
#index836813
#% 
#!
  
#*Disjunctive analogues of submodular and supermodular pseudo-Boolean functions.
#@Stephan Foldes,Peter L. Hammer
#t2004
#cDiscrete Applied Mathematics
#index836814
#% 
#!
  
#*Post classes characterized by functional terms.
#@Stephan Foldes,Grant R. Pogosyan
#t2004
#cDiscrete Applied Mathematics
#index836815
#% 
#!
  
#*Searching expenditure and interval graphs.
#@Fedor V. Fomin
#t2004
#cDiscrete Applied Mathematics
#index836816
#%839341
#%887765
#%950329
#%950952
#%951151
#%952688
#%1061827
#%1092604
#!
  
#*Helicopter Search Problems, Bandwidth and Pathwidth.
#@Fedor V. Fomin
#t1998
#cDiscrete Applied Mathematics
#index836817
#% 
#!
  
#*Note on a Helicopter Search Problem on Graphs.
#@Fedor V. Fomin
#t1999
#cDiscrete Applied Mathematics
#index836818
#% 
#!
  
#*Interval degree and bandwidth of a graph.
#@Fedor V. Fomin,Petr A. Golovach
#t2003
#cDiscrete Applied Mathematics
#index836819
#%211907
#%837719
#%847975
#%887765
#%932186
#%971902
#%975111
#%1089475
#!
  
#*On the Domination Search Number.
#@Fedor V. Fomin,Dieter Kratsch,Haiko Müller
#t2003
#cDiscrete Applied Mathematics
#index836820
#%111260
#%621446
#%622980
#%836817
#%837785
#%839341
#%887765
#%950329
#%950952
#%951041
#%952688
#%1058966
#%1060513
#%1061343
#%1061230
#%1061827
#%1092604
#!
  
#*Algorithms for graphs with small octopus.
#@Fedor V. Fomin,Dieter Kratsch,Haiko Müller
#t2004
#cDiscrete Applied Mathematics
#index836821
#%211907
#%493212
#%622980
#%660638
#%660644
#%837427
#%930859
#%952720
#%971902
#%975111
#%1058966
#%1061125
#%1061170
#%1061419
#%1061765
#!
  
#*AT-free graphs: linear bounds for the oriented diameter.
#@Fedor V. Fomin,Martín Matamala,Erich Prisner,Ivan Rapaport
#t2004
#cDiscrete Applied Mathematics
#index836822
#%836832
#%837346
#%838031
#%848207
#%1061230
#%1061765
#!
  
#*On the monotonicity of games generated by symmetric submodular functions.
#@Fedor V. Fomin,Dimitrios M. Thilikos
#t2003
#cDiscrete Applied Mathematics
#index836823
#%838193
#%839341
#%887765
#%932186
#%950346
#%950952
#%951151
#%952688
#%974671
#%977717
#%977921
#%1059782
#%1061343
#%1092604
#%1094849
#!
  
#*Cycle regular graphs need not be transitive.
#@Jean-Luc Fouquet,Gena Hahn
#t2001
#cDiscrete Applied Mathematics
#index836824
#% 
#!
  
#*Preface.
#@Sébastien Fourey,Gabor T. Herman,T. Yung Kong,Azriel Rosenfeld
#t2004
#cDiscrete Applied Mathematics
#index836825
#% 
#!
  
#*Generic axiomatized digital surface-structures.
#@Sébastien Fourey,T. Yung Kong,Gabor T. Herman
#t2004
#cDiscrete Applied Mathematics
#index836826
#%951477
#%1091191
#!
  
#*A concise characterization of 3D simple points.
#@Sébastien Fourey,Rémy Malgouyres
#t2003
#cDiscrete Applied Mathematics
#index836827
#%834104
#%1043910
#%1043907
#!
  
#*Robust Universal Complete Codes for Transmission and Compression.
#@Aviezri S. Fraenkel,Shmuel T. Klein
#t1996
#cDiscrete Applied Mathematics
#index836828
#% 
#!
  
#*An extension of the periodicity lemma to longer periods.
#@Aviezri S. Fraenkel,Jamie Simpson
#t2005
#cDiscrete Applied Mathematics
#index836829
#%929754
#%930201
#%953743
#%1092219
#!
  
#*Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks.
#@Paraskevi Fragopoulou,Selim G. Akl
#t1998
#cDiscrete Applied Mathematics
#index836830
#% 
#!
  
#*A note on line broadcast in digraphs under the edge-disjoint paths mode.
#@Pierre Fraigniaud
#t2004
#cDiscrete Applied Mathematics
#index836831
#%408612
#%610433
#%610552
#%614025
#%621376
#%621918
#%660405
#%836832
#%952793
#%952966
#%1061587
#!
  
#*Methods and problems of communication in usual networks.
#@Pierre Fraigniaud,Emmanuel Lazard
#t1994
#cDiscrete Applied Mathematics
#index836832
#% 
#!
  
#*Typical case complexity of Satisfiability Algorithms and the threshold phenomenon.
#@John V. Franco
#t2005
#cDiscrete Applied Mathematics
#index836833
#%186296
#%209770
#%209772
#%210067
#%209777
#%387927
#%610106
#%610406
#%621129
#%621778
#%622555
#%771155
#%797844
#%836835
#%837445
#%839276
#%887561
#%931123
#%933723
#%940035
#%949955
#%950043
#%951052
#%951454
#%951756
#%952961
#%972011
#%1051749
#%1052137
#%1052105
#%1058692
#%1058843
#%1059207
#%1060298
#%1088728
#%1088609
#%1090246
#%1090732
#%1091246
#!
  
#*On the Occurrence of Null Clauses in Random Instances of Satisfiability.
#@John V. Franco
#t1993
#cDiscrete Applied Mathematics
#index836834
#% 
#!
  
#*A perspective on certain polynomial-time solvable classes of satisfiability.
#@John V. Franco,Allen Van Gelder
#t2003
#cDiscrete Applied Mathematics
#index836835
#%610106
#%623072
#%837445
#%888773
#%930686
#%931286
#%933723
#%940035
#%949955
#%950043
#%950925
#%951052
#%952961
#%972011
#%974301
#%984745
#%1058692
#!
  
#*An Algorithm for the Class of Pure Implicational Formulas.
#@John V. Franco,Judy Goldsmith,John S. Schlipf,Ewald Speckenmeyer,Ramjee P. Swaminathan
#t1999
#cDiscrete Applied Mathematics
#index836836
#% 
#!
  
#*On good algorithms for determining unsatisfiability of propositional formulas.
#@John V. Franco,Ramjee P. Swaminathan
#t2003
#cDiscrete Applied Mathematics
#index836837
#%481400
#%610406
#%621129
#%940035
#%950043
#%951041
#%952961
#%1052088
#%1052137
#%1052105
#%1058843
#!
  
#*Restricted t-matchings in bipartite graphs.
#@András Frank
#t2003
#cDiscrete Applied Mathematics
#index836838
#% 
#!
  
#*Combinatorial problems related to origin-destination matrices.
#@András Frank,Tibor Jordán,Zoltán Szigeti
#t2001
#cDiscrete Applied Mathematics
#index836839
#% 
#!
  
#*Combined connectivity augmentation and orientation problems.
#@András Frank,Tamás Király
#t2003
#cDiscrete Applied Mathematics
#index836840
#%973099
#!
  
#*On decomposing a hypergraph into k connected sub-hypergraphs.
#@András Frank,Tamás Király,Matthias Kriesell
#t2003
#cDiscrete Applied Mathematics
#index836841
#% 
#!
  
#*On the orientation of graphs and hypergraphs.
#@András Frank,Tamás Király,Zoltán Király
#t2003
#cDiscrete Applied Mathematics
#index836842
#%610884
#%836884
#!
  
#*Algorithms for Routing around a Rectangle.
#@András Frank,Takao Nishizeki,Nobuji Saito,Hitoshi Suzuki
#t1992
#cDiscrete Applied Mathematics
#index836843
#% 
#!
  
#*Constructive characterizations for packing and covering with trees.
#@András Frank,László Szegö
#t2003
#cDiscrete Applied Mathematics
#index836844
#% 
#!
  
#*Generic rigidity of molecular graphs via ear decomposition.
#@Deborah S. Franzblau
#t2000
#cDiscrete Applied Mathematics
#index836845
#% 
#!
  
#*Bipolar orientations Revisited.
#@Hubert de Fraysseix,Patrice Ossona de Mendez,Pierre Rosenstiehl
#t1995
#cDiscrete Applied Mathematics
#index836846
#% 
#!
  
#*A New Look at the de Bruijn Graph.
#@Harold Fredricksen
#t1992
#cDiscrete Applied Mathematics
#index836847
#% 
#!
  
#*A note about games-composition dimension.
#@J. Freixas,M. A. Puente
#t2001
#cDiscrete Applied Mathematics
#index836848
#% 
#!
  
#*On the complexity of suboptimal decoding for list and decision feedback schemes.
#@Jürgen Freudenberger,Victor V. Zyablov
#t2006
#cDiscrete Applied Mathematics
#index836849
#% 
#!
  
#*An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem.
#@Arnaud Fréville,Gérard Plateau
#t1994
#cDiscrete Applied Mathematics
#index836850
#% 
#!
  
#*Maximal Irredundant Functions.
#@Gerd Fricke,Stephen T. Hedetniemi,David Pokrass Jacobs
#t1996
#cDiscrete Applied Mathematics
#index836851
#% 
#!
  
#*An Algorithm to Find Two Distance Domination Parameters in a Graph.
#@Gerd Fricke,Michael A. Henning,Ortrud Oellermann,Henda C. Swart
#t1996
#cDiscrete Applied Mathematics
#index836852
#% 
#!
  
#*On the subword complexity of iteratively generated infinite words.
#@Anna E. Frid
#t2001
#cDiscrete Applied Mathematics
#index836853
#% 
#!
  
#*On factor graphs of DOL words.
#@Anna E. Frid
#t2001
#cDiscrete Applied Mathematics
#index836854
#% 
#!
  
#*Two Results on the Bit Extraction Problem.
#@Katalin Friedl,Shi-Chun Tsai
#t2000
#cDiscrete Applied Mathematics
#index836855
#% 
#!
  
#*Broadcasting in Random Graphs.
#@Alan M. Frieze,Michael Molloy
#t1994
#cDiscrete Applied Mathematics
#index836856
#% 
#!
  
#*The reconstruction of a subclass of domino tilings from two projections.
#@Andrea Frosini,Giulia Simi
#t2005
#cDiscrete Applied Mathematics
#index836857
#%493360
#%818085
#%1090174
#%1090707
#!
  
#*On Equidistant Constant Weight Codes.
#@Fang-Wei Fu,Torleiv Kløve,Luo Yuan,Victor K. Wei
#t2003
#cDiscrete Applied Mathematics
#index836858
#% 
#!
  
#*On the variance of average distance of subsets in the Hamming space.
#@Fang-Wei Fu,San Ling,Chaoping Xing
#t2005
#cDiscrete Applied Mathematics
#index836859
#%838306
#%838304
#%848264
#!
  
#*On the minimum average distance of binary codes: linear programming approach.
#@Fang-Wei Fu,Victor K. Wei,Raymond W. Yeung
#t2001
#cDiscrete Applied Mathematics
#index836860
#% 
#!
  
#*On Acyclic Conjugated Molecules with Minimal Energies.
#@Fuji Zhang,Li Huaien
#t1999
#cDiscrete Applied Mathematics
#index836861
#% 
#!
  
#*A laminarity property of the polyhedron described by a weakly posi-modular set function.
#@Satoru Fujishige
#t2000
#cDiscrete Applied Mathematics
#index836862
#% 
#!
  
#*Minimizing a Submodular Function Arising From a Concave Function.
#@Satoru Fujishige,Satoru Iwata
#t1999
#cDiscrete Applied Mathematics
#index836863
#% 
#!
  
#*A general two-sided matching market with discrete concave utility functions.
#@Satoru Fujishige,Akihisa Tamura
#t2006
#cDiscrete Applied Mathematics
#index836864
#%836564
#%837749
#%837747
#%847552
#%1013107
#%1013105
#%1013205
#%1013215
#%1014020
#%3003855
#!
  
#*Sparse Hypercube - Minimal k-line Broadcast Graph.
#@Satoshi Fujita,Arthur M. Farley
#t2003
#cDiscrete Applied Mathematics
#index836865
#% 
#!
  
#*Minimum-cost Line Broadcast in Paths.
#@Satoshi Fujita,Arthur M. Farley
#t1997
#cDiscrete Applied Mathematics
#index836866
#% 
#!
  
#*A Unified Approximation Algorithm for Node-deletion Problems.
#@Toshihiro Fujito
#t1998
#cDiscrete Applied Mathematics
#index836867
#% 
#!
  
#*A 2-approximation algorithm for the minimum weight edge dominating set problem.
#@Toshihiro Fujito,Hiroshi Nagamochi
#t2002
#cDiscrete Applied Mathematics
#index836868
#% 
#!
  
#*Preface.
#@Komei Fukuda,Toshihide Ibaraki
#t1995
#cDiscrete Applied Mathematics
#index836869
#% 
#!
  
#*Finding All Common Bases in Two Matroids.
#@Komei Fukuda,Makoto Namiki
#t1995
#cDiscrete Applied Mathematics
#index836870
#% 
#!
  
#*EP Theorems and Linear Complementarity Problems.
#@Komei Fukuda,Makoto Namiki,Akihisa Tamura
#t1998
#cDiscrete Applied Mathematics
#index836871
#% 
#!
  
#*On the Double Competition Number.
#@Zoltán Füredi
#t1998
#cDiscrete Applied Mathematics
#index836872
#% 
#!
  
#*Symmetric matrices and codes correcting rank errors beyond the [(-1)/2] bound.
#@Ernst M. Gabidulin,Nina I. Pilipchuk
#t2006
#cDiscrete Applied Mathematics
#index836873
#% 
#!
  
#*Bipartition constrained edge-splitting in directed graphs.
#@Harold N. Gabow,Tibor Jordán
#t2001
#cDiscrete Applied Mathematics
#index836874
#% 
#!
  
#*Switchdec Polyhedra.
#@Alain Gaillard
#t1997
#cDiscrete Applied Mathematics
#index836875
#% 
#!
  
#*Complexity of Langton's ant.
#@Anahí Gajardo,Andrés Moreira,Eric Goles Ch.
#t2002
#cDiscrete Applied Mathematics
#index836876
#% 
#!
  
#*A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case.
#@Gábor Galambos,J. B. G. Frenk
#t1993
#cDiscrete Applied Mathematics
#index836877
#% 
#!
  
#*On the approximation of the Minimum Disturbance p-Facility Location Problem.
#@Giulia Galbiati
#t2002
#cDiscrete Applied Mathematics
#index836878
#% 
#!
  
#*Preface.
#@Giulia Galbiati,Francesco Maffioli
#t1993
#cDiscrete Applied Mathematics
#index836879
#% 
#!
  
#*on the Computation of Pfaffians.
#@Giulia Galbiati,Francesco Maffioli
#t1994
#cDiscrete Applied Mathematics
#index836880
#% 
#!
  
#*Weil Descent of Jacobians.
#@Steven D. Galbraith
#t2003
#cDiscrete Applied Mathematics
#index836881
#%42577
#%50877
#%985997
#!
  
#*Tetris-Hashing or optimal table compression.
#@Nicola Galli,Bernhard Seybold,Klaus Simon
#t2001
#cDiscrete Applied Mathematics
#index836882
#% 
#!
  
#*A Guide to the Graph Labeling Zoo.
#@Joseph A. Gallian
#t1994
#cDiscrete Applied Mathematics
#index836883
#% 
#!
  
#*Directed Hypergraphs and Applications.
#@Giorgio Gallo,Giustino Longo,Stefano Pallottino
#t1993
#cDiscrete Applied Mathematics
#index836884
#% 
#!
  
#*A New Algorithm for the Propositional Satisfiability Problem.
#@Giorgio Gallo,Daniele Pretolani
#t1995
#cDiscrete Applied Mathematics
#index836885
#% 
#!
  
#*b9000A 1/4 Approximate Algorithm for P2/tree/Cmax.
#@Giorgio Gallo,Fulvio Piccinonno
#t1997
#cDiscrete Applied Mathematics
#index836886
#% 
#!
  
#*Hamiltonian completions of sparse random graphs.
#@David Gamarnik,Maxim Sviridenko
#t2005
#cDiscrete Applied Mathematics
#index836887
#%929632
#%933437
#%950486
#!
  
#*A Method for Cutting Squares into Distinct Squares.
#@Ian Gambini
#t1999
#cDiscrete Applied Mathematics
#index836888
#% 
#!
  
#*Preserving Approximation in the Min-Weighted Set Cover Problem.
#@Giorgio Gambosi,Marco Protasi,Maurizio Talamo
#t1997
#cDiscrete Applied Mathematics
#index836889
#% 
#!
  
#*Uniquely 2-list colorable graphs.
#@Yashar Ganjali,Mohammad Ghebleh,Hossein Hajiabolhassan,M. Mirzazadeh,Sayyed Bashir Sadjad
#t2002
#cDiscrete Applied Mathematics
#index836890
#% 
#!
  
#*Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation.
#@Joseph L. Ganley
#t1999
#cDiscrete Applied Mathematics
#index836891
#% 
#!
  
#*The pagenumber of k-trees is O(k).
#@Joseph L. Ganley,Lenwood S. Heath
#t2001
#cDiscrete Applied Mathematics
#index836892
#% 
#!
  
#*Pseudo-models and propositional Horn inference.
#@Bernhard Ganter,Rüdiger Krauße
#t2005
#cDiscrete Applied Mathematics
#index836893
#%745030
#%1091373
#!
  
#*Resolution complexity of random constraint satisfaction problems: Another half of the story.
#@Yong Gao,Joseph C. Culberson
#t2005
#cDiscrete Applied Mathematics
#index836894
#%117654
#%211474
#%622760
#%811894
#%836835
#%972011
#%1052137
#%1088728
#%1088609
#%1090732
#!
  
#*Exact enumeration of rooted 3-connected triangular maps on the projective plane.
#@Zhicheng Gao,Jianyu Wang
#t2004
#cDiscrete Applied Mathematics
#index836895
#%974571
#%974586
#%974573
#%975752
#%975760
#!
  
#*Large Cayley Graphs on an Abelian Group.
#@Christine Garcia,Claudine Peyrat
#t1997
#cDiscrete Applied Mathematics
#index836896
#% 
#!
  
#*Optimization of basis functions for both reconstruction and visualization.
#@Edgar Garduño,Gabor T. Herman
#t2004
#cDiscrete Applied Mathematics
#index836897
#%639428
#%1119006
#%1133704
#!
  
#*Reliable broadcasting.
#@Luisa Gargano,Arthur L. Liestman,Joseph G. Peters,Dana S. Richards
#t1994
#cDiscrete Applied Mathematics
#index836898
#% 
#!
  
#*Minimum time broadcast in faulty star networks.
#@Luisa Gargano,Adele A. Rescigno,Ugo Vaccaro
#t1998
#cDiscrete Applied Mathematics
#index836899
#% 
#!
  
#*Single bend wiring on surfaces.
#@Maria Angeles Garrido,Alberto Márquez,A. Morgana,José Ramón Portillo
#t2002
#cDiscrete Applied Mathematics
#index836900
#% 
#!
  
#*Broadcasting with linearly bounded transmission faults.
#@Leszek Gasieniec,Andrzej Pelc
#t1998
#cDiscrete Applied Mathematics
#index836901
#% 
#!
  
#*on the Equivalence of Constrained and Unconstrained Flows.
#@Antoine Gautier,Frieda Granot
#t1994
#cDiscrete Applied Mathematics
#index836902
#% 
#!
  
#*On Quasi-Cayley Graphs.
#@Ginette Gauyacq
#t1997
#cDiscrete Applied Mathematics
#index836903
#% 
#!
  
#*Edge-forwarding Index of Star Graphs and Other Cayley Graphs.
#@Ginette Gauyacq
#t1997
#cDiscrete Applied Mathematics
#index836904
#% 
#!
  
#*Computing orbit period in max-min algebra.
#@Martin Gavalec
#t2000
#cDiscrete Applied Mathematics
#index836905
#% 
#!
  
#*Computing Matrix Period in Max-min Algebra.
#@Martin Gavalec
#t1997
#cDiscrete Applied Mathematics
#index836906
#% 
#!
  
#*An O(n) Algorithm for Maximum Cycle Mean of Monge Matrices in Max-algebra.
#@Martin Gavalec,Ján Plávka
#t2003
#cDiscrete Applied Mathematics
#index836907
#% 
#!
  
#*Intersection Graphs of Helly Families of Subtrees.
#@Fanica Gavril
#t1996
#cDiscrete Applied Mathematics
#index836908
#% 
#!
  
#*Intersection Graphs of Concatenable Subtrees of Graphs.
#@Fanica Gavril,Jorge Urrutia
#t1994
#cDiscrete Applied Mathematics
#index836909
#% 
#!
  
#*An algorithm to analyze stability of gene-expression patterns.
#@Jutta Gebert,Martin Lätsch,Stefan Wolfgang Pickl,Gerhard-Wilhelm Weber,R. Wünschiers
#t2006
#cDiscrete Applied Mathematics
#index836910
#%156684
#%1014291
#!
  
#*Graph coloring on coarse grained multicomputers.
#@Assefaw Hadish Gebremedhin,Isabelle Guérin Lassous,Jens Gustedt,Jan Arne Telle
#t2003
#cDiscrete Applied Mathematics
#index836911
#%704
#%493354
#%528566
#%548303
#%614295
#%622032
#%776642
#%933075
#%1059994
#%1061438
#%1082519
#%1092497
#!
  
#*Complexity Analysis of Propositional Resolution with Autarky Pruning.
#@Allen Van Gelder
#t1999
#cDiscrete Applied Mathematics
#index836912
#% 
#!
  
#*Preface.
#@Michel Gendreau,Alain Hertz,Frédéric Semet,Marino Widmer
#t2004
#cDiscrete Applied Mathematics
#index836913
#% 
#!
  
#*On the relations between SAT and CSP enumerative algorithms.
#@Richard Génisson,Philippe Jégou
#t2000
#cDiscrete Applied Mathematics
#index836914
#% 
#!
  
#*A note on collections of graphs with non-surjective lambda labelings.
#@John P. Georges,David W. Mauro
#t2005
#cDiscrete Applied Mathematics
#index836915
#%847716
#%854494
#%1061170
#%1061385
#%1061419
#%1061777
#!
  
#*An elementary digital plane recognition algorithm.
#@Y. Gerard,Isabelle Debled-Rennesson,P. Zimmermann
#t2005
#cDiscrete Applied Mathematics
#index836916
#%154042
#%154041
#%154167
#%891820
#%1033241
#%1044848
#!
  
#*Stable sets in two subclasses of banner-free graphs.
#@Michael U. Gerber,Alain Hertz,Vadim V. Lozin
#t2003
#cDiscrete Applied Mathematics
#index836917
#%835924
#%838161
#%839218
#%933023
#!
  
#*P-free augmenting graphs and the maximum stable set problem.
#@Michael U. Gerber,Alain Hertz,David Schindl
#t2003
#cDiscrete Applied Mathematics
#index836918
#% 
#!
  
#*On the stable set problem in special P-free graphs.
#@Michael U. Gerber,Vadim V. Lozin
#t2003
#cDiscrete Applied Mathematics
#index836919
#% 
#!
  
#*Broadcasting in random graphs.
#@Alexandros V. Gerbessiotis
#t1994
#cDiscrete Applied Mathematics
#index836920
#% 
#!
  
#*Close-to-optimal and Near-optimal Broadcasting in Random Graphs.
#@Alexandros V. Gerbessiotis
#t1995
#cDiscrete Applied Mathematics
#index836921
#% 
#!
  
#*A Graph-theoretic Result for a Model of Neural Computation.
#@Alexandros V. Gerbessiotis
#t1998
#cDiscrete Applied Mathematics
#index836922
#% 
#!
  
#*Cycles in the cube-connected cycles graph.
#@Anne Germa,Marie-Claude Heydemann,Dominique Sotteau
#t1998
#cDiscrete Applied Mathematics
#index836923
#% 
#!
  
#*Optimal layouts on a chain ATM network.
#@Ornan Ori Gerstel,Avishai Wool,Shmuel Zaks
#t1998
#cDiscrete Applied Mathematics
#index836924
#% 
#!
  
#*Coordination without communication: the case of the flocking problem.
#@Vincenzo Gervasi,Giuseppe Prencipe
#t2004
#cDiscrete Applied Mathematics
#index836925
#%351796
#%434717
#%544037
#%771309
#%1060514
#!
  
#*Dedication.
#@Vito Di Gesù,Attila Kuba
#t2005
#cDiscrete Applied Mathematics
#index836926
#% 
#!
  
#*Preface.
#@Vito Di Gesù,Attila Kuba
#t2005
#cDiscrete Applied Mathematics
#index836927
#% 
#!
  
#*Connectivity, Persistence and Fault Diagnosis of Interconnection Networks Based on and 2 Graphs.
#@Arif Ghafoor
#t1992
#cDiscrete Applied Mathematics
#index836928
#% 
#!
  
#*Optimal parallel machines scheduling with availability constraints.
#@Anis Gharbi,Mohamed Haouari
#t2005
#cDiscrete Applied Mathematics
#index836929
#%839126
#%972366
#!
  
#*Weighted Parameters in Graphs.
#@Vassilis Giakoumakis,Irena Rusu
#t1997
#cDiscrete Applied Mathematics
#index836930
#% 
#!
  
#*A characterization of Thompson digraphs.
#@Dora Giammarresi,Jean-Luc Ponty,Derick Wood,Djelloul Ziadi
#t2004
#cDiscrete Applied Mathematics
#index836931
#%776541
#%1089904
#!
  
#*The complexity of the T-coloring problem for graphs with small degree.
#@Krzysztof Giaro,Robert Janczewski,Michal Malafiejski
#t2003
#cDiscrete Applied Mathematics
#index836932
#% 
#!
  
#*A polynomial algorithm for finding T-span of generalized cacti.
#@Krzysztof Giaro,Robert Janczewski,Michal Malafiejski
#t2003
#cDiscrete Applied Mathematics
#index836933
#% 
#!
  
#*Compact scheduling of zero-one time operations in multi-stage systems.
#@Krzysztof Giaro,Marek Kubale
#t2004
#cDiscrete Applied Mathematics
#index836934
#%415657
#%836935
#%847735
#%974447
#%1061870
#!
  
#*On the Deficiency of Bipartite Graphs.
#@Krzysztof Giaro,Marek Kubale,Michal Malafiejski
#t1999
#cDiscrete Applied Mathematics
#index836935
#% 
#!
  
#*On finding a cyclic tour and a vehicle loading plan yielding maximum profit.
#@E. Kh. Gimadi,N. I. Glebov,A. I. Serdyukov
#t2004
#cDiscrete Applied Mathematics
#index836936
#% 
#!
  
#*On Cocolourings and Cochromatic Numbers of Graphs.
#@John G. Gimbel,Dieter Kratsch,Lorna Stewart
#t1994
#cDiscrete Applied Mathematics
#index836937
#% 
#!
  
#*The underlying line digraph structure of some (0, 1)-matrix equations.
#@Joan Gimbert,Yaokun Wu
#t2002
#cDiscrete Applied Mathematics
#index836938
#% 
#!
  
#*On Complexity of Minimizing Weighted Number of Late Jobs in Unit Time Open Shops.
#@Andrei A. Gladky
#t1997
#cDiscrete Applied Mathematics
#index836939
#% 
#!
  
#*The complexity of base station positioning in cellular networks.
#@Christian Glaßer,Steffen Reith,Heribert Vollmer
#t2005
#cDiscrete Applied Mathematics
#index836940
#%155405
#%949569
#%950675
#%1141361
#!
  
#*Stochastic Scheduling and Forwards Induction.
#@Kevin D. Glazebrook
#t1995
#cDiscrete Applied Mathematics
#index836941
#% 
#!
  
#*Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms).
#@Fred Glover
#t1994
#cDiscrete Applied Mathematics
#index836942
#% 
#!
  
#*Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems.
#@Fred Glover
#t1996
#cDiscrete Applied Mathematics
#index836943
#% 
#!
  
#*Tabu search and finite convergence.
#@Fred Glover,Saïd Hanafi
#t2002
#cDiscrete Applied Mathematics
#index836944
#% 
#!
  
#*Cyclic Graphs.
#@F. Göbel,E. A. Neutel
#t2000
#cDiscrete Applied Mathematics
#index836945
#% 
#!
  
#*Arborescence Polytopes for Series-parallel Graphs.
#@Michel X. Goemans
#t1994
#cDiscrete Applied Mathematics
#index836946
#% 
#!
  
#*An Approximation Algorithm for Scheduling on Three Dedicated Machines.
#@Michel X. Goemans
#t1995
#cDiscrete Applied Mathematics
#index836947
#% 
#!
  
#*A Remark on Random 2-SAT.
#@Andreas Goerdt
#t1999
#cDiscrete Applied Mathematics
#index836948
#% 
#!
  
#*Minimizing Phylogenetic Number To Find Good Evolutionary Trees.
#@Leslie Ann Goldberg,Paul W. Goldberg,Cynthia A. Phillips,Elizabeth Sweedyk,Tandy Warnow
#t1996
#cDiscrete Applied Mathematics
#index836949
#% 
#!
  
#*Designing algorithms by sampling.
#@Mark K. Goldberg,D. L. Hollinger
#t2001
#cDiscrete Applied Mathematics
#index836950
#% 
#!
  
#*On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.
#@Donald Goldfarb,Jianxiu Hao
#t1993
#cDiscrete Applied Mathematics
#index836951
#% 
#!
  
#*k-edge Subgraph Problems.
#@Olivier Goldschmidt,Dorit S. Hochbaum
#t1997
#cDiscrete Applied Mathematics
#index836952
#% 
#!
  
#*SONET/SDH Ring Assignment with Capacity Constraints.
#@Olivier Goldschmidt,Alexandre Laugier,Eli V. Olinick
#t2003
#cDiscrete Applied Mathematics
#index836953
#%494730
#%1061795
#%1122042
#!
  
#*Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees.
#@Mordecai J. Golin,Assaf Schuster
#t1999
#cDiscrete Applied Mathematics
#index836954
#% 
#!
  
#*New upper and lower bounds on the channel capacity of read/write isolated memory.
#@Mordecai J. Golin,Xuerong Yong,Yuanping Zhang,Li Sheng
#t2004
#cDiscrete Applied Mathematics
#index836955
#%836485
#%853667
#%1061144
#!
  
#*New results on induced matchings.
#@Martin Charles Golumbic,Moshe Lewenstein
#t2000
#cDiscrete Applied Mathematics
#index836956
#% 
#!
  
#*Chordal probe graphs.
#@Martin Charles Golumbic,Marina Lipshteyn
#t2004
#cDiscrete Applied Mathematics
#index836957
#%1025584
#%610729
#%610809
#%611109
#%837644
#!
  
#*Irredundancy in Circular Arc Graphs.
#@Martin Charles Golumbic,Renu Laskar
#t1993
#cDiscrete Applied Mathematics
#index836958
#% 
#!
  
#*Introduction.
#@Martin Charles Golumbic,Renu Laskar
#t1993
#cDiscrete Applied Mathematics
#index836959
#% 
#!
  
#*Block duplicate graphs and a hierarchy of chordal graphs.
#@Martin Charles Golumbic,Uri N. Peled
#t2002
#cDiscrete Applied Mathematics
#index836960
#%850548
#%974454
#!
  
#*Graphs on Alphabets as Models for Large Interconnection Networks.
#@José Gómez,Miguel Angel Fiol,J. Luis A. Yebra
#t1992
#cDiscrete Applied Mathematics
#index836961
#% 
#!
  
#*Large (d, D, D', s) - bipartite Digraphs.
#@José Gómez,Paz Morillo,Carles Padró
#t1995
#cDiscrete Applied Mathematics
#index836962
#% 
#!
  
#*Diameter vulnerability of GC graphs.
#@J. Gómez,Ignacio M. Pelayo,Camino Balbuena
#t2003
#cDiscrete Applied Mathematics
#index836963
#%807032
#%836961
#!
  
#*Large Generalized Cycles.
#@José Gómez,Carles Padró,Stephane Perennes
#t1998
#cDiscrete Applied Mathematics
#index836964
#% 
#!
  
#*On the cohomology of 3D digital images.
#@Rocío González-Díaz,Pedro Real
#t2005
#cDiscrete Applied Mathematics
#index836965
#%576570
#%640417
#%780156
#!
  
#*Analysis of Minimal Path Routing Schemes in the Presence of Faults.
#@Jesse M. Gordon
#t1992
#cDiscrete Applied Mathematics
#index836966
#% 
#!
  
#*Orbits of Boolean Functions.
#@Jan Gorodkin
#t1997
#cDiscrete Applied Mathematics
#index836967
#% 
#!
  
#*A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem.
#@Maud Göthe-Lundgren,Torbjörn Larsson
#t1994
#cDiscrete Applied Mathematics
#index836968
#% 
#!
  
#*Selective Inheritance of Attribute Values in Relational Databases.
#@Georg Gottlob,Michael Schrefl,Markus Stumptner
#t1992
#cDiscrete Applied Mathematics
#index836969
#% 
#!
  
#*The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints.
#@Luis Gouveia,Jose Manuel Pires
#t2001
#cDiscrete Applied Mathematics
#index836970
#% 
#!
  
#*Changing and Unchanging the Diameter of a Hypercube.
#@Niall Graham,Frank Harary
#t1992
#cDiscrete Applied Mathematics
#index836971
#% 
#!
  
#*Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
#@Jens Gramm,Edward A. Hirsch,Rolf Niedermeier,Peter Rossmanith
#t2003
#cDiscrete Applied Mathematics
#index836972
#%211095
#%211756
#%609901
#%610003
#%620394
#%771155
#%933484
#%950130
#%950618
#%953414
#%953372
#%953667
#%954787
#%971639
#%1092793
#!
  
#*Naturally submodular digraphs and forbidden digraph configurations.
#@Daniel Granot,Frieda Granot,W. R. Zhu
#t2000
#cDiscrete Applied Mathematics
#index836973
#% 
#!
  
#*On the equivalence between some local and global Chinese postman and traveling salesman graphs.
#@Daniel Granot,Herbert Hamers
#t2004
#cDiscrete Applied Mathematics
#index836974
#%836973
#%1014087
#!
  
#*Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs.
#@Frieda Granot,Michal Penn
#t1996
#cDiscrete Applied Mathematics
#index836975
#% 
#!
  
#*On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem.
#@Frieda Granot,Jadranka Skorin-Kapov
#t1993
#cDiscrete Applied Mathematics
#index836976
#% 
#!
  
#*On Some Optimization Problems on -Trees and Partial -Trees.
#@Daniel Granot,Darko Skorin-Kapov
#t1994
#cDiscrete Applied Mathematics
#index836977
#% 
#!
  
#*Total domination number of grid graphs.
#@Sylvain Gravier
#t2002
#cDiscrete Applied Mathematics
#index836978
#%836980
#%837303
#%837301
#!
  
#*Complexity of list coloring problems with a fixed total number of colors.
#@Sylvain Gravier,Daniel Kobler,Wieslaw Kubiak
#t2002
#cDiscrete Applied Mathematics
#index836979
#% 
#!
  
#*On Domination Numbers of Cartesian Product of Paths.
#@Sylvain Gravier,Michel Mollard
#t1997
#cDiscrete Applied Mathematics
#index836980
#% 
#!
  
#*Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping.
#@Vladimir Grebinski,Gregory Kucherov
#t1998
#cDiscrete Applied Mathematics
#index836981
#% 
#!
  
#*Computing Prüfer codes efficiently in parallel.
#@Raymond Greenlaw,Rossella Petreschi
#t2000
#cDiscrete Applied Mathematics
#index836982
#% 
#!
  
#*The insulation sequence of a graph.
#@Elena Grigorescu
#t2004
#cDiscrete Applied Mathematics
#index836983
#%837256
#!
  
#*On the search of optimal order of variables in the synthesis of switching circuits by cascade technique.
#@M. I. Grinchuk,V. V. Kochergin
#t2004
#cDiscrete Applied Mathematics
#index836984
#% 
#!
  
#*A Recurrence Template for Several Parameters in Series-parallel Graphs.
#@Dana L. Grinstead,Peter J. Slater
#t1994
#cDiscrete Applied Mathematics
#index836985
#% 
#!
  
#*Super-simple (v, 5, 2)-designs.
#@Hans-Dietrich O. F. Gronau,Donald L. Kreher,Alan C. H. Ling
#t2004
#cDiscrete Applied Mathematics
#index836986
#%842017
#!
  
#*Resolution and binary decision diagrams cannot simulate each other polynomially.
#@Jan Friso Groote,Hans Zantema
#t2003
#cDiscrete Applied Mathematics
#index836987
#%83711
#%185527
#%621781
#%621778
#%771155
#%951756
#%1078408
#%1078407
#!
  
#*Ordered binary decision diagrams and the Shannon effect.
#@Clemens Gröpl,Hans Jürgen Prömel,Anand Srivastav
#t2004
#cDiscrete Applied Mathematics
#index836988
#% 
#!
  
#*On some Infinite Series of (r, 1)-Designs.
#@Harald Gropp
#t2000
#cDiscrete Applied Mathematics
#index836989
#% 
#!
  
#*Configurations between geometry and combinatorics.
#@Harald Gropp
#t2004
#cDiscrete Applied Mathematics
#index836990
#%224936
#%852175
#%854740
#!
  
#*A Transfinite Form of Sibson's Interpolant.
#@Lee Gross,Gerald E. Farin
#t1999
#cDiscrete Applied Mathematics
#index836991
#% 
#!
  
#*Simple Planar Graph Partition into Three Forests.
#@Roberto Grossi,Elena Lodi
#t1998
#cDiscrete Applied Mathematics
#index836992
#% 
#!
  
#*Construction of Discrete Structures, Especially Isomers.
#@Roland Grund,Adalbert Kerber,Reinhard Laue
#t1996
#cDiscrete Applied Mathematics
#index836993
#% 
#!
  
#*Completing partial latin squares with prescribed diagonals.
#@Martin Grüttmüller
#t2004
#cDiscrete Applied Mathematics
#index836994
#% 
#!
  
#*On the PBD-closure of Sets Containing 3.
#@Martin Grüttmüller
#t1999
#cDiscrete Applied Mathematics
#index836995
#% 
#!
  
#*Intertwined Infinite Binary Words.
#@Jaroslaw Grytczuk
#t1996
#cDiscrete Applied Mathematics
#index836996
#% 
#!
  
#*Routing a Vehicle of Capacity Greater than one.
#@Dih Jiun Guan
#t1998
#cDiscrete Applied Mathematics
#index836997
#% 
#!
  
#*About the design of oligo-chips.
#@A. Guénoche
#t2005
#cDiscrete Applied Mathematics
#index836998
#%118715
#%438442
#%951082
#!
  
#*No-hole K-tuple (r+1)-distant Colorings of odd Cycles.
#@David R. Guichard
#t1996
#cDiscrete Applied Mathematics
#index836999
#% 
#!
  
#*Solving Makespan Minimization Problems with Lagrangean Decomposition.
#@Monique Guignard
#t1993
#cDiscrete Applied Mathematics
#index837000
#% 
#!
  
#*Extracting pure network submatrices in linear programs using signed graphs.
#@Nalan Gülpinar,Gregory Gutin,G. Mitra,A. Zverovitch
#t2004
#cDiscrete Applied Mathematics
#index837001
#%2022
#%933590
#!
  
#*Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion.
#@Georg Gunther,Bert Hartnell,Douglas F. Rall
#t1993
#cDiscrete Applied Mathematics
#index837002
#% 
#!
  
#*Boundary uniqueness of fusenes.
#@Xiaofeng Guo,Pierre Hansen,Maolin Zheng
#t2002
#cDiscrete Applied Mathematics
#index837003
#% 
#!
  
#*The cycle structure of regular multipartite tournaments.
#@Yubao Guo,Jin Ho Kwak
#t2002
#cDiscrete Applied Mathematics
#index837004
#%975904
#%976047
#%976063
#!
  
#*Bypaths in Tournaments.
#@Yubao Guo,Lutz Volkmann
#t1997
#cDiscrete Applied Mathematics
#index837005
#% 
#!
  
#*Planar k-cycle resonant graphs with k=1, 2.
#@Xiaofeng Guo,Fuji Zhang
#t2003
#cDiscrete Applied Mathematics
#index837006
#% 
#!
  
#*The number of convex polyominoes and the generating function of Jacobi polynomials.
#@Victor J. W. Guo,Jiang Zeng
#t2006
#cDiscrete Applied Mathematics
#index837007
#%850822
#!
  
#*Embeddings of -connected graphs of pathwidth .
#@Arvind Gupta,Naomi Nishimura,Andrzej Proskurowski,Prabhakar Ragde
#t2005
#cDiscrete Applied Mathematics
#index837008
#% 
#!
  
#*The degree of functions and weights in linear codes.
#@Sugi Guritman,Femke Hoogweg,Juriaan Simonis
#t2001
#cDiscrete Applied Mathematics
#index837009
#% 
#!
  
#*Maximum Cut on Line and Total Graphs.
#@Venkatesan Guruswami
#t1999
#cDiscrete Applied Mathematics
#index837010
#% 
#!
  
#*Algorithmic aspects of clique-transversal and clique-independent sets.
#@Venkatesan Guruswami,C. Pandu Rangan
#t2000
#cDiscrete Applied Mathematics
#index837011
#% 
#!
  
#*On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions.
#@Vladimir Gurvich,Leonid Khachiyan
#t1999
#cDiscrete Applied Mathematics
#index837012
#% 
#!
  
#*Camel sequences and quadratic residues.
#@V. A. Gurvich,Li Sheng
#t2002
#cDiscrete Applied Mathematics
#index837013
#% 
#!
  
#*Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem.
#@Dan Gusfield,Richard M. Karp,Lusheng Wang,Paul Stelling
#t1998
#cDiscrete Applied Mathematics
#index837014
#% 
#!
  
#*On the Pathwidth of Chordal Graphs.
#@Jens Gustedt
#t1993
#cDiscrete Applied Mathematics
#index837015
#% 
#!
  
#*Recognizing clique graphs of directed edge path graphs.
#@Marisa Gutierrez,João Meidanis
#t2003
#cDiscrete Applied Mathematics
#index837016
#%837909
#%974461
#%977271
#%1061832
#!
  
#*Mediated digraphs and quantum nonlocality.
#@Gregory Gutin,N. Jones,Arash Rafiey,Simone Severini,Anders Yeo
#t2005
#cDiscrete Applied Mathematics
#index837017
#%930662
#%976367
#!
  
#*Minimum cost and list homomorphisms to semicomplete digraphs.
#@Gregory Gutin,Arash Rafiey,Anders Yeo
#t2006
#cDiscrete Applied Mathematics
#index837018
#%835924
#%1061081
#%836106
#%1059157
#%931497
#%839231
#!
  
#*Level of repair analysis and minimum cost homomorphisms of graphs.
#@Gregory Gutin,Arash Rafiey,Anders Yeo,Michael Tso
#t2006
#cDiscrete Applied Mathematics
#index837019
#%2022
#%838490
#%1060961
#%1061893
#%1058417
#!
  
#*Domination analysis of combinatorial optimization problems.
#@Gregory Gutin,Alek Vainshtein,Anders Yeo
#t2003
#cDiscrete Applied Mathematics
#index837020
#%268601
#%837022
#%837915
#!
  
#*Orientations of digraphs almost preserving diameter.
#@Gregory Gutin,Anders Yeo
#t2002
#cDiscrete Applied Mathematics
#index837021
#%836832
#%852606
#!
  
#*Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.
#@Gregory Gutin,Anders Yeo
#t2002
#cDiscrete Applied Mathematics
#index837022
#% 
#!
  
#*Upper bounds on ATSP neighborhood size.
#@Gregory Gutin,Anders Yeo
#t2003
#cDiscrete Applied Mathematics
#index837023
#%622445
#%812926
#%837022
#%837915
#%924066
#!
  
#*Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph.
#@Gregory Gutin,Anders Yeo
#t1996
#cDiscrete Applied Mathematics
#index837024
#% 
#!
  
#*Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.
#@Gregory Gutin,Anders Yeo,Alexey Zverovich
#t2002
#cDiscrete Applied Mathematics
#index837025
#% 
#!
  
#*Approximation Algorithms for Minimum Tree Partition.
#@Nili Guttmann-Beck,Refael Hassin
#t1998
#cDiscrete Applied Mathematics
#index837026
#% 
#!
  
#*Approximation Algorithms for Min-sum p-clustering.
#@Nili Guttmann-Beck,Refael Hassin
#t1998
#cDiscrete Applied Mathematics
#index837027
#% 
#!
  
#*On the Strong Chromatic Index of Cyclic Multigraphs.
#@Pavol Gvozdjak,Peter Horák,Mariusz Meszka,Zdzislaw Skupien
#t2000
#cDiscrete Applied Mathematics
#index837028
#% 
#!
  
#*A Communication Problem and Directed Triple Systems.
#@András Gyárfás,Richard H. Schelp
#t1998
#cDiscrete Applied Mathematics
#index837029
#% 
#!
  
#*Sets in Z with distinct sums of pairs.
#@Harri Haanpää,Antti Huima,Patric R. J. Östergård
#t2004
#cDiscrete Applied Mathematics
#index837030
#% 
#!
  
#*Classification of whist tournaments with up to 12 players.
#@Harri Haanpää,Patric R. J. Östergård
#t2003
#cDiscrete Applied Mathematics
#index837031
#% 
#!
  
#*Efficient algorithms on distributive lattices.
#@Michel Habib,Raoul Medina,Lhouari Nourine,George Steiner
#t2001
#cDiscrete Applied Mathematics
#index837032
#% 
#!
  
#*A simple linear time algorithm for cograph recognition.
#@Michel Habib,Christophe Paul
#t2005
#cDiscrete Applied Mathematics
#index837033
#%70760
#%611111
#%611242
#%836548
#%952833
#%1060205
#%1090430
#%1091696
#!
  
#*A multi-scale algorithm for drawing graphs nicely.
#@Ronny Hadany,David Harel
#t2001
#cDiscrete Applied Mathematics
#index837034
#% 
#!
  
#*Approximation Techniques for Hypergraph Partitioning Problems.
#@Scott W. Hadley
#t1995
#cDiscrete Applied Mathematics
#index837035
#% 
#!
  
#*On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials.
#@Fritz von Haeseler,Heinz-Otto Peitgen,Guentcho Skordev
#t2000
#cDiscrete Applied Mathematics
#index837036
#% 
#!
  
#*Complexity of the generalized conjugacy problem.
#@Sang Geun Hahn,Eonkyung Lee,Je Hong Park
#t2003
#cDiscrete Applied Mathematics
#index837037
#% 
#!
  
#*Positivity of second order linear recurrent sequences.
#@Vesa Halava,Tero Harju,Mika Hirvensalo
#t2006
#cDiscrete Applied Mathematics
#index837038
#%3000906
#!
  
#*Decidability of the binary infinite Post Correspondence Problem.
#@Vesa Halava,Tero Harju,Juhani Karhumäki
#t2003
#cDiscrete Applied Mathematics
#index837039
#%485001
#%1091737
#%1091738
#!
  
#*A Note on Generalizing the Maximum Lateness Criterion for Scheduling.
#@Leslie A. Hall
#t1993
#cDiscrete Applied Mathematics
#index837040
#% 
#!
  
#*Parallel machine scheduling with a common server.
#@Nicholas G. Hall,Chris N. Potts,Chelliah Sriskandarajah
#t2000
#cDiscrete Applied Mathematics
#index837041
#% 
#!
  
#*Independent Sets with Domination Constraints.
#@Magnús M. Halldórsson,Jan Kratochvíl,Jan Arne Telle
#t2000
#cDiscrete Applied Mathematics
#index837042
#% 
#!
  
#*Continuous bottleneck tree partitioning problems.
#@Nir Halman,Arie Tamir
#t2004
#cDiscrete Applied Mathematics
#index837043
#%610534
#%837595
#%949788
#%950099
#%951301
#%951147
#%1089228
#!
  
#*Cellular telephone networks and random maps in hypergraphs.
#@Ariel Halpert,Flórián Lengyel,János Pach
#t2000
#cDiscrete Applied Mathematics
#index837044
#% 
#!
  
#*Special section: Using discrete mathematics to model multileaf collimators in radiation therapy.
#@Horst W. Hamacher,Matthias Ehrgott
#t2005
#cDiscrete Applied Mathematics
#index837045
#% 
#!
  
#*Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems.
#@Anja Hamacher,Winfried Hochstättler,Christoph Moll
#t2000
#cDiscrete Applied Mathematics
#index837046
#% 
#!
  
#*Inverse radiation therapy planning - a multiple objective optimization approach.
#@Horst W. Hamacher,Karl-Heinz Küfer
#t2002
#cDiscrete Applied Mathematics
#index837047
#%960269
#!
  
#*Adapting polyhedral properties from facility to hub location problems.
#@Horst W. Hamacher,Martine Labbé,Stefan Nickel,Tim Sonneborn
#t2004
#cDiscrete Applied Mathematics
#index837048
#%836333
#%3007117
#!
  
#*A New Class of Nonbinary Codes Meeting the Griesmer Bound.
#@Noboru Hamada,Tor Helleseth,Øyvind Ytrehus
#t1993
#cDiscrete Applied Mathematics
#index837049
#% 
#!
  
#*Minimizing Broadcast Costs Under Edge Reductions in Tree Networks.
#@Susanne E. Hambrusch,Hyeong-Seok Lim
#t1999
#cDiscrete Applied Mathematics
#index837050
#% 
#!
  
#*The Connectivity of Hierarchical Cayley Digraphs.
#@Yahya Ould Hamidoune,Anna S. Lladó,Oriol Serra
#t1992
#cDiscrete Applied Mathematics
#index837051
#% 
#!
  
#*A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib).
#@Jean-Philippe Hamiez,Jin-Kao Hao
#t2004
#cDiscrete Applied Mathematics
#index837052
#%11862
#%12979
#%166635
#%548069
#%811922
#!
  
#*Editorial.
#@Peter L. Hammer
#t1998
#cDiscrete Applied Mathematics
#index837053
#% 
#!
  
#*Laplacian Spectra and Spanning Trees of Threshold Graphs.
#@Peter L. Hammer,Alexander K. Kelmans
#t1996
#cDiscrete Applied Mathematics
#index837054
#% 
#!
  
#*Pareto-optimal patterns in logical analysis of data.
#@Peter L. Hammer,Alexander Kogan,Bruno Simeone,Sándor Szedmák
#t2004
#cDiscrete Applied Mathematics
#index837055
#%2360
#%15358
#%172117
#%621914
#%817943
#%836265
#%887270
#%887285
#%930086
#%952955
#%1009447
#%1009330
#%1009980
#%1013425
#%1059106
#%1090922
#%1112474
#!
  
#*Saturated systems of homogeneous boxes and the logical analysis of numerical data.
#@Peter L. Hammer,Yanpei Liu,Bruno Simeone,Sándor Szedmák
#t2004
#cDiscrete Applied Mathematics
#index837056
#%1112474
#!
  
#*Very fast parallel algorithms for approximate edge coloring.
#@Yijie Han,Weifa Liang,Xiaojun Shen
#t2001
#cDiscrete Applied Mathematics
#index837057
#% 
#!
  
#*Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy.
#@K. Han,Chandra N. Sekharan,Sridhar Radhakrishnan
#t1997
#cDiscrete Applied Mathematics
#index837058
#% 
#!
  
#*Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method.
#@Masazumi Hanazawa,Hiroshi Narushima,Nobuhiro Minaka
#t1995
#cDiscrete Applied Mathematics
#index837059
#% 
#!
  
#*Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees.
#@Dagmar Handke
#t2001
#cDiscrete Applied Mathematics
#index837060
#% 
#!
  
#*Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays.
#@Claire Hanen,Alix Munier Kordon
#t1998
#cDiscrete Applied Mathematics
#index837061
#% 
#!
  
#*An approximation algorithm for scheduling dependent tasks on m processors with small communication delays.
#@Claire Hanen,Alix Munier
#t2001
#cDiscrete Applied Mathematics
#index837062
#% 
#!
  
#*A Study of the Cyclic Scheduling Problem on Parallel Processors.
#@Claire Hanen,Alix Munier
#t1995
#cDiscrete Applied Mathematics
#index837063
#% 
#!
  
#*Polynomial-time Algorithm for Computing Translocation Distance Between Genomes.
#@Sridhar Hannenhalli
#t1996
#cDiscrete Applied Mathematics
#index837064
#% 
#!
  
#*Boole's Conditions of Possible Experience and Reasoning under Uncertainty.
#@Pierre Hansen,Brigitte Jaumard,Marcus Poggi de Aragão
#t1995
#cDiscrete Applied Mathematics
#index837065
#% 
#!
  
#*On Lower Bounds for Numbered Complete Graphs.
#@Pierre Hansen,Brigitte Jaumard,Christophe Meyer
#t1999
#cDiscrete Applied Mathematics
#index837066
#% 
#!
  
#*Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures.
#@Pierre Hansen,Brigitte Jaumard,Guy-Blaise Douanya Nguetsé
#t1999
#cDiscrete Applied Mathematics
#index837067
#% 
#!
  
#*First vs. best improvement: An empirical study.
#@Pierre Hansen,Nenad Mladenovic
#t2006
#cDiscrete Applied Mathematics
#index837068
#%813608
#%952954
#!
  
#*Variable neighborhood search for the maximum clique.
#@Pierre Hansen,Nenad Mladenovic,Dragan Urosevic
#t2004
#cDiscrete Applied Mathematics
#index837069
#%812738
#%813608
#%885382
#%1058511
#%3545706
#!
  
#*Paths with Minimum Range and Ratio of Arc Lengths.
#@Pierre Hansen,Giovanni Storchi,Tsevi Vovor
#t1997
#cDiscrete Applied Mathematics
#index837070
#% 
#!
  
#*Shortest Shortest Path Trees of a Network.
#@Pierre Hansen,Maolin Zheng
#t1996
#cDiscrete Applied Mathematics
#index837071
#% 
#!
  
#*Searching with mobile agents in networks with liars.
#@Nicolas Hanusse,Evangelos Kranakis,Danny Krizanc
#t2004
#cDiscrete Applied Mathematics
#index837072
#% 
#!
  
#*A Lower Bound for the Shortness Coefficient of a Class of Graphs.
#@Jochen Harant,Hansjoachim Walther
#t1994
#cDiscrete Applied Mathematics
#index837073
#% 
#!
  
#*A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns.
#@Frank Harary,William Randolph,Paul G. Mezey
#t1996
#cDiscrete Applied Mathematics
#index837074
#% 
#!
  
#*Weakened Ramsey Numbers.
#@Heiko Harborth,Meinhard Möller
#t1999
#cDiscrete Applied Mathematics
#index837075
#% 
#!
  
#*Physical Network Design to Facilitate Capacity Reallocation.
#@Janelle J. Harms,Chenjiang Hu
#t2003
#cDiscrete Applied Mathematics
#index837076
#%481840
#%1122534
#%1122498
#!
  
#*An inductive definition of cubic toroidal maps.
#@Thomas Harmuth
#t2002
#cDiscrete Applied Mathematics
#index837077
#%953319
#%953602
#!
  
#*On an Isoperimetric Problem for Hamming Graphs.
#@L. H. Harper
#t1999
#cDiscrete Applied Mathematics
#index837078
#% 
#!
  
#*Covering the Complete Graph with Plane Cycles.
#@Alan Hartman,Yoav Medan
#t1993
#cDiscrete Applied Mathematics
#index837080
#% 
#!
  
#*Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs.
#@Sven Hartmann
#t1999
#cDiscrete Applied Mathematics
#index837081
#% 
#!
  
#*Facets of the p-cycle polytope.
#@Mark E. Hartmann,Özgür Özlük
#t2001
#cDiscrete Applied Mathematics
#index837082
#% 
#!
  
#*Orthogonal double covers of general graphs.
#@Sven Hartmann,Ulrike Schumacher
#t2004
#cDiscrete Applied Mathematics
#index837083
#%204076
#%841822
#%853130
#!
  
#*On 4-connected Claw-free Well-covered Graphs.
#@Bert Hartnell,Michael D. Plummer
#t1996
#cDiscrete Applied Mathematics
#index837084
#% 
#!
  
#*A strongly polynomial time algorithm for a constrained submodular optimization problem.
#@David Hartvigsen
#t2001
#cDiscrete Applied Mathematics
#index837085
#% 
#!
  
#*Characterizing the Flow Equivalent Trees of a Network.
#@David Hartvigsen
#t2003
#cDiscrete Applied Mathematics
#index837086
#%406787
#%952941
#!
  
#*The Planar Multiterminal Cut Problem.
#@David Hartvigsen
#t1998
#cDiscrete Applied Mathematics
#index837087
#% 
#!
  
#*The Complexity of Lifted Inequalities for the Knapsack Problem.
#@David Hartvigsen,Eitan Zemel
#t1992
#cDiscrete Applied Mathematics
#index837088
#% 
#!
  
#*More Broadcast Graphs.
#@Hovhannes A. Harutyunyan,Arthur L. Liestman
#t1999
#cDiscrete Applied Mathematics
#index837089
#% 
#!
  
#*A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits.
#@M. Hasler,C. Marthy,A. Oberlin,Dominique de Werra
#t1994
#cDiscrete Applied Mathematics
#index837090
#% 
#!
  
#*Monotonicity and Efficient Computation of Optimal Dichotomous Search.
#@Refael Hassin,Mordechai I. Henig
#t1993
#cDiscrete Applied Mathematics
#index837091
#% 
#!
  
#*Subgraphs decomposable into two trees and k-edge-connected subgraphs.
#@Refael Hassin,Asaf Levin
#t2003
#cDiscrete Applied Mathematics
#index837092
#% 
#!
  
#*Minimum restricted diameter spanning trees.
#@Refael Hassin,Asaf Levin
#t2004
#cDiscrete Applied Mathematics
#index837093
#%610679
#%621393
#%621671
#%931627
#%932138
#%1058311
#!
  
#*An approximation algorithm for maximum triangle packing.
#@Refael Hassin,Shlomi Rubinstein
#t2006
#cDiscrete Applied Mathematics
#index837094
#%610703
#%835994
#%931620
#%931625
#%952721
#!
  
#*Independent spanning trees with small depths in iterated line digraphs.
#@Toru Hasunuma,Hiroshi Nagamochi
#t2001
#cDiscrete Applied Mathematics
#index837095
#% 
#!
  
#*Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books.
#@Toru Hasunuma,Yukio Shibata
#t1997
#cDiscrete Applied Mathematics
#index837096
#% 
#!
  
#*On the computational complexity of defining sets.
#@Hamed Hatami,Hossein Maserrat
#t2005
#cDiscrete Applied Mathematics
#index837097
#%852648
#!
  
#*Euler is standing in line dial-a-ride problems with precedence-constraints.
#@Dietrich Hauptmeier,Sven Oliver Krumke,Jörg Rambau,Hans-Christoph Wirth
#t2001
#cDiscrete Applied Mathematics
#index837098
#% 
#!
  
#*Extremal Graphs Domination Insensitive to the Removal of Edges.
#@Teresa W. Haynes,Robert C. Brigham,Ronald D. Dutton
#t1993
#cDiscrete Applied Mathematics
#index837099
#% 
#!
  
#*Locating and total dominating sets in trees.
#@Teresa W. Haynes,Michael A. Henning,Jamie Howard
#t2006
#cDiscrete Applied Mathematics
#index837100
#%836396
#%3612438
#!
  
#*Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability.
#@Ryan B. Hayward
#t1997
#cDiscrete Applied Mathematics
#index837101
#% 
#!
  
#*Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac.
#@Ryan B. Hayward
#t1997
#cDiscrete Applied Mathematics
#index837102
#% 
#!
  
#*NeST graphs.
#@Ryan B. Hayward,Paul E. Kearney,Andrew J. Malton
#t2002
#cDiscrete Applied Mathematics
#index837103
#%836129
#%836205
#!
  
#*Bichromatic P-composition schemes for perfect orderability.
#@Ryan B. Hayward,William J. Lenhart
#t2004
#cDiscrete Applied Mathematics
#index837104
#% 
#!
  
#*A note on tolerance graph recognition.
#@Ryan B. Hayward,Ron Shamir
#t2004
#cDiscrete Applied Mathematics
#index837105
#%836205
#%854425
#%1342032
#%3005167
#!
  
#*A Prospect for a General Method of Constructing -Designs.
#@A. Sadam Hedayat,Gholamreza B. Khosrovshahi,Dibyen Majumdar
#t1993
#cDiscrete Applied Mathematics
#index837106
#% 
#!
  
#*Edge-packing Planar Graphs by Cyclic Graphs.
#@Lenwood S. Heath,John Paul C. Vergara
#t1998
#cDiscrete Applied Mathematics
#index837107
#% 
#!
  
#*on the Geometric Separability of Boolean Functions.
#@Tibor Hegedüs,Nimrod Megiddo
#t1996
#cDiscrete Applied Mathematics
#index837108
#% 
#!
  
#*Sorting by Bounded Block-moves.
#@Lenwood S. Heath,John Paul C. Vergara
#t1998
#cDiscrete Applied Mathematics
#index837109
#% 
#!
  
#*Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials.
#@Qing-Hu Hou,Toufik Mansour
#t2006
#cDiscrete Applied Mathematics
#index837110
#%848176
#%851523
#%854267
#%864826
#!
  
#*On acyclic systems with minimal Hosoya index.
#@Yaoping Hou
#t2002
#cDiscrete Applied Mathematics
#index837111
#%836861
#!
  
#*On the Complexity of Comparing Evolutionary Trees.
#@Jotun Hein,Tao Jiang,Lusheng Wang,Kaizhong Zhang
#t1996
#cDiscrete Applied Mathematics
#index837112
#% 
#!
  
#*Perfect Latin Squares.
#@Katherine Heinrich,Kichul Kim,Viktor K. Prasanna
#t1992
#cDiscrete Applied Mathematics
#index837113
#% 
#!
  
#*Biography of Martin Farber, 1951-1989.
#@Pavol Hell
#t1993
#cDiscrete Applied Mathematics
#index837114
#% 
#!
  
#*Rounding in Symmetric Matrices and Undirected Graphs.
#@Pavol Hell,David G. Kirkpatrick,Brenda Li
#t1996
#cDiscrete Applied Mathematics
#index837115
#% 
#!
  
#*Partitioning chordal graphs into independent sets and cliques.
#@Pavol Hell,Sulamita Klein,Loana Tito Nogueira,Fábio Protti
#t2004
#cDiscrete Applied Mathematics
#index837116
#%621948
#%836195
#%854118
#%974348
#!
  
#*Packing Problems in Edge-colored Graphs.
#@Pavol Hell,Yannis Manoussakis,Zsolt Tuza
#t1994
#cDiscrete Applied Mathematics
#index837117
#% 
#!
  
#*Complexity of Tree Homomorphisms.
#@Pavol Hell,Jaroslav Nesetril,Xuding Zhu
#t1996
#cDiscrete Applied Mathematics
#index837118
#% 
#!
  
#*Antidirected hamiltonian paths between specified vertices of a tournament.
#@Pavol Hell,Moshe Rosenfeld
#t2002
#cDiscrete Applied Mathematics
#index837119
#% 
#!
  
#*Connected triangle-free m-step competition graphs.
#@Geir T. Helleloid
#t2005
#cDiscrete Applied Mathematics
#index837120
#% 
#!
  
#*Functions that are Read-Once on a Subset of their Inputs.
#@Lisa Hellerstein
#t1993
#cDiscrete Applied Mathematics
#index837121
#% 
#!
  
#*On claw-free asteroidal triple-free graphs.
#@Harald Hempel,Dieter Kratsch
#t2002
#cDiscrete Applied Mathematics
#index837122
#%186031
#%186325
#%660555
#%660769
#%837427
#%837785
#%993684
#%1058966
#%1061125
#%1061230
#!
  
#*Some General Aspects of the Framing Number of a Digraph.
#@Michael A. Henning,Hiren Maharaj
#t1998
#cDiscrete Applied Mathematics
#index837123
#% 
#!
  
#*The average connectivity of a digraph.
#@Michael A. Henning,Ortrud Oellermann
#t2004
#cDiscrete Applied Mathematics
#index837124
#%836071
#%836568
#!
  
#*The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs.
#@Heping Zhang,Fuji Zhang
#t1997
#cDiscrete Applied Mathematics
#index837125
#% 
#!
  
#*A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery.
#@Hipólito Hernández-Pérez,Juan José Salazar González
#t2004
#cDiscrete Applied Mathematics
#index837126
#%812826
#!
  
#*Geometric Tree Graphs of Points in Convex Position.
#@M. Carmen Hernando,Ferran Hurtado,Alberto Márquez,Mercè Mora,Marc Noy
#t1999
#cDiscrete Applied Mathematics
#index837127
#% 
#!
  
#*Polynomially Solvable Cases for the Maximum Stable Set Problem.
#@Alain Hertz
#t1995
#cDiscrete Applied Mathematics
#index837128
#% 
#!
  
#*On the Use of Boolean Methods for the Computation of the Stability Number.
#@Alain Hertz
#t1997
#cDiscrete Applied Mathematics
#index837129
#% 
#!
  
#*On Perfect Switching Classes.
#@Alain Hertz
#t1998
#cDiscrete Applied Mathematics
#index837130
#% 
#!
  
#*On Perfect Switching Classes.
#@Alain Hertz
#t1999
#cDiscrete Applied Mathematics
#index837131
#% 
#!
  
#*Local Optima Topology for the -Coloring Problem.
#@Alain Hertz,Brigitte Jaumard,Marcus Poggi de Aragão
#t1994
#cDiscrete Applied Mathematics
#index837132
#% 
#!
  
#*A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
#@Alain Hertz,Brigitte Jaumard,Celso C. Ribeiro
#t1994
#cDiscrete Applied Mathematics
#index837133
#% 
#!
  
#*on a Scheduling Problem in a Robotized Analytical System.
#@Alain Hertz,Yves Mottet,Yves Rochat
#t1996
#cDiscrete Applied Mathematics
#index837134
#% 
#!
  
#*Preface.
#@Alain Hertz,Maurice Queyranne,Marino Widmer
#t1996
#cDiscrete Applied Mathematics
#index837135
#% 
#!
  
#*An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints.
#@Alain Hertz,Marino Widmer
#t1996
#cDiscrete Applied Mathematics
#index837136
#% 
#!
  
#*Approximate protein folding in the HP side chain model on extended cubic lattices.
#@Volker Heun
#t2003
#cDiscrete Applied Mathematics
#index837137
#%558808
#%558827
#%558690
#%609812
#%621802
#%622257
#%961800
#%961878
#%961992
#%962133
#!
  
#*The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
#@Peter Heusch
#t1999
#cDiscrete Applied Mathematics
#index837138
#% 
#!
  
#*Forwarding Indices of -Connected Graphs.
#@Marie-Claude Heydemann,J. C. Meyer,Jaroslav Opatrny,Dominique Sotteau
#t1992
#cDiscrete Applied Mathematics
#index837139
#% 
#!
  
#*Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.
#@Marie-Claude Heydemann,Jaroslav Opatrny,Dominique Sotteau
#t1992
#cDiscrete Applied Mathematics
#index837140
#% 
#!
  
#*The Hall Number, the Hall Index, and the Total Hall Number of a Graph.
#@Anthony J. W. Hilton,Peter D. Johnson Jr.
#t1999
#cDiscrete Applied Mathematics
#index837141
#% 
#!
  
#*Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle.
#@Anthony J. W. Hilton,J. P. Liu,C. Zhao
#t1996
#cDiscrete Applied Mathematics
#index837142
#% 
#!
  
#*Vertex-splitting and Chromatic Index Critical Graphs.
#@Anthony J. W. Hilton,C. Zhao
#t1997
#cDiscrete Applied Mathematics
#index837143
#% 
#!
  
#*How to Find a Point on a Line Within a Fixed Distance.
#@Christoph A. Hipke,Christian Icking,Rolf Klein,Elmar Langetepe
#t1999
#cDiscrete Applied Mathematics
#index837144
#% 
#!
  
#*Lengths of tours and permutations on a vertex set of a convex polygon.
#@Hiro Ito,Hideyuki Uehara,Mitsuo Yokoyama
#t2001
#cDiscrete Applied Mathematics
#index837145
#% 
#!
  
#*Worst-case study of local search for MAX-k-SAT.
#@Edward A. Hirsch
#t2003
#cDiscrete Applied Mathematics
#index837146
#% 
#!
  
#*Transitive closure algorithm MEMTC and its performance analysis.
#@Vesa Hirvisalo,Esko Nuutila,Eljas Soisalon-Soininen
#t2001
#cDiscrete Applied Mathematics
#index837147
#% 
#!
  
#*The Maximal Clique and Colourability of Curve Contact Graphs.
#@Petr Hlinený
#t1998
#cDiscrete Applied Mathematics
#index837148
#% 
#!
  
#*Equivalence-free exhaustive generation of matroid representations.
#@Petr Hlinený
#t2006
#cDiscrete Applied Mathematics
#index837149
#%953319
#%978603
#!
  
#*Scheduling Imprecise Computation Tasks with 0/1-constraint.
#@Kevin I.-J. Ho,Joseph Y.-T. Leung,W.-D. Wei
#t1997
#cDiscrete Applied Mathematics
#index837150
#% 
#!
  
#*Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs.
#@Chính T. Hoàng
#t1994
#cDiscrete Applied Mathematics
#index837151
#% 
#!
  
#*A Note on Perfectly orderable Graphs.
#@Chính T. Hoàng
#t1996
#cDiscrete Applied Mathematics
#index837152
#% 
#!
  
#*on the Complexity of Recognizing a Class of Perfectly orderable Graphs.
#@Chính T. Hoàng
#t1996
#cDiscrete Applied Mathematics
#index837153
#% 
#!
  
#*On the Disc-structure of Perfect Graphs I the Co-paw-structure.
#@Chính T. Hoàng
#t1999
#cDiscrete Applied Mathematics
#index837154
#% 
#!
  
#*On simplicial and co-simplicial vertices in graphs.
#@Chính T. Hoàng,Stefan Hougardy,Frédéric Maffray,Nadimpalli V. R. Mahadev
#t2004
#cDiscrete Applied Mathematics
#index837155
#%851185
#!
  
#*On the -dominating coloring of graphs.
#@Chính T. Hoàng,Mekkia Kouider
#t2005
#cDiscrete Applied Mathematics
#index837156
#% 
#!
  
#*Why Should Biconnected Components be Identified First.
#@Dorit S. Hochbaum
#t1993
#cDiscrete Applied Mathematics
#index837157
#% 
#!
  
#*Scheduling with Batching: Two Job Types.
#@Dorit S. Hochbaum,Dan Landy
#t1997
#cDiscrete Applied Mathematics
#index837158
#% 
#!
  
#*Approximating a generalization of MAX 2SAT and MIN 2SAT.
#@Dorit S. Hochbaum,Anu Pathria
#t2000
#cDiscrete Applied Mathematics
#index837159
#% 
#!
  
#*Bidirected and unidirected capacity installation in telecommunication networks.
#@Stan P. M. van Hoesel,Arie M. C. A. Koster,Robert L. M. J. van de Leensel,Martin W. P. Savelsbergh
#t2003
#cDiscrete Applied Mathematics
#index837160
#%1013380
#%1013994
#!
  
#*The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming.
#@Stan P. M. van Hoesel,Roelof Kuik,Marc Salomon,Luk Van Wassenhove
#t1994
#cDiscrete Applied Mathematics
#index837161
#% 
#!
  
#*Sensitivity Analysis of the Economic Lot-Sizing Problem.
#@Stan P. M. van Hoesel,Albert P. M. Wagelmans
#t1993
#cDiscrete Applied Mathematics
#index837162
#% 
#!
  
#*On the Complexity of Postoptimality Analysis of 0/1 Programs.
#@Stan P. M. van Hoesel,Albert P. M. Wagelmans
#t1999
#cDiscrete Applied Mathematics
#index837163
#% 
#!
  
#*Combinatorics of RNA Secondary Structures.
#@Ivo L. Hofacker,Peter Schuster,Peter F. Stadler
#t1998
#cDiscrete Applied Mathematics
#index837164
#% 
#!
  
#*The edge versus path incidence matrix of series-parallel graphs and greedy packing.
#@Alan J. Hoffman,Baruch Schieber
#t2001
#cDiscrete Applied Mathematics
#index837165
#% 
#!
  
#*An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots.
#@Frank Hoffmann,Klaus Kriegel,Carola Wenk
#t1999
#cDiscrete Applied Mathematics
#index837166
#% 
#!
  
#*Random small Hamming weight products with applications to cryptography.
#@Jeffrey Hoffstein,Joseph H. Silverman
#t2003
#cDiscrete Applied Mathematics
#index837167
#%484
#%42702
#%120442
#%842408
#%953015
#%1012365
#%3005937
#!
  
#*Extending Shelling orders and a Hierarchy of Functions of Unimodal Simple Polytopes.
#@Kathy Williamson Hoke
#t1995
#cDiscrete Applied Mathematics
#index837168
#% 
#!
  
#*Nonblocking Self-Routing Switching Networks.
#@Henk D. L. Hollmann,Jacobus H. van Lint
#t1992
#cDiscrete Applied Mathematics
#index837169
#% 
#!
  
#*Length-bounded disjoint paths in planar graphs.
#@Hein van der Holst,José Coelho de Pina
#t2002
#cDiscrete Applied Mathematics
#index837170
#%73
#%2022
#%2616
#%621778
#%839410
#%951383
#%951299
#!
  
#*Tantrix rotation puzzles are intractable.
#@Markus Holzer,Waltraud Holzer
#t2004
#cDiscrete Applied Mathematics
#index837171
#% 
#!
  
#*On the orthogonal designs of order 24.
#@Wolf H. Holzmann,Hadi Kharaghani
#t2000
#cDiscrete Applied Mathematics
#index837172
#% 
#!
  
#*Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs.
#@Pengyu Hong,Thomas S. Huang
#t2004
#cDiscrete Applied Mathematics
#index837173
#%127930
#%293093
#%516276
#%1023717
#%1031021
#%1031372
#%1033373
#%1033221
#!
  
#*Easy cases of the D0L sequence equivalence problem.
#@Juha Honkala
#t2001
#cDiscrete Applied Mathematics
#index837174
#% 
#!
  
#*On infinite words generated by polynomial D0L systems. Juha Honkala.
#@Juha Honkala
#t2002
#cDiscrete Applied Mathematics
#index837175
#% 
#!
  
#*On (q, 1)-subnormal q-ary Covering Codes.
#@Iiro S. Honkala
#t1994
#cDiscrete Applied Mathematics
#index837176
#% 
#!
  
#*A Decision Method for Parikh Slenderness of Context-free Languages.
#@Juha Honkala
#t1997
#cDiscrete Applied Mathematics
#index837177
#% 
#!
  
#*On the Equivalence Problem of Context-free and DT0L Languages.
#@Juha Honkala
#t1999
#cDiscrete Applied Mathematics
#index837178
#% 
#!
  
#*Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
#@Iiro S. Honkala,Mark G. Karpovsky,Simon Litsyn
#t2003
#cDiscrete Applied Mathematics
#index837179
#%837468
#%842072
#%846967
#%1061214
#%1078780
#!
  
#*Expanding selfsimilar solutions of a crystalline flow with applications to contour figure analysis.
#@Hidekata Hontani,Mi-Ho Giga,Yoshikazu Giga,Koichiro Deguchi
#t2005
#cDiscrete Applied Mathematics
#index837180
#%908384
#%1032456
#%1032794
#!
  
#*Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations.
#@J. A. Hoogeveen,Steef L. van de Velde,Bart Veltman
#t1994
#cDiscrete Applied Mathematics
#index837181
#% 
#!
  
#*Mixed Logical-linear Programming.
#@John N. Hooker,María Auxilio Osorio Lama
#t1999
#cDiscrete Applied Mathematics
#index837182
#% 
#!
  
#*An introduction to cocyclic generalised Hadamard matrices.
#@Kathy J. Horadam
#t2000
#cDiscrete Applied Mathematics
#index837183
#% 
#!
  
#*A Combinatorial Problem in Database Security.
#@Peter Horák,Ljiljana Brankovic,Mirka Miller
#t1999
#cDiscrete Applied Mathematics
#index837184
#% 
#!
  
#*Reasoning with ordered binary decision diagrams.
#@Takashi Horiyama,Toshihide Ibaraki
#t2004
#cDiscrete Applied Mathematics
#index837185
#% 
#!
  
#*on Halin Subgraphs and Supergraphs.
#@Steven B. Horton,R. Gary Parker
#t1995
#cDiscrete Applied Mathematics
#index837186
#% 
#!
  
#*On minimum cuts and the linear arrangement problem.
#@Steven B. Horton,R. Gary Parker,Richard B. Borie
#t2000
#cDiscrete Applied Mathematics
#index837187
#% 
#!
  
#*Scale-sensitive Dimensions and Skeleton Estimates for Classification.
#@Márta Horváth,Gábor Lugosi
#t1998
#cDiscrete Applied Mathematics
#index837188
#% 
#!
  
#*On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane.
#@Kiyoshi Hosono
#t2001
#cDiscrete Applied Mathematics
#index837189
#% 
#!
  
#*On the perfect matching of disjoint compact sets by noncrossing line segments in R.
#@Kiyoshi Hosono,Katsumi Matsuda
#t2002
#cDiscrete Applied Mathematics
#index837190
#% 
#!
  
#*On the visibility graph of convex translates.
#@Kiyoshi Hosono,Henk Meijer,David Rappaport
#t2001
#cDiscrete Applied Mathematics
#index837191
#% 
#!
  
#*Affinity of permutations of P.
#@Xiang-dong Hou
#t2006
#cDiscrete Applied Mathematics
#index837192
#% 
#!
  
#*Group testing and fault detection for replicated files.
#@Frank K. Hwang,Wenan Zang
#t2002
#cDiscrete Applied Mathematics
#index837193
#% 
#!
  
#*Forwarding indices of folded -cubes.
#@Xinmin Hou,Min Xu,Jun-Ming Xu
#t2005
#cDiscrete Applied Mathematics
#index837194
#% 
#!
  
#*On bisectors for different distance functions.
#@Christian Icking,Rolf Klein,Lihong Ma,Stefan Nickel,Ansgar Weißler
#t2001
#cDiscrete Applied Mathematics
#index837195
#% 
#!
  
#*Algorithms for Weak and Wide Separation of Sets.
#@Michael E. Houle
#t1993
#cDiscrete Applied Mathematics
#index837196
#% 
#!
  
#*Class Steiner Trees and VLSI-design.
#@Edmund Ihler,Gabriele Reich,Peter Widmayer
#t1999
#cDiscrete Applied Mathematics
#index837197
#% 
#!
  
#*Orthogonal Weighted Linear and Approximation and Applications.
#@Michael E. Houle,Hiroshi Imai,Keiko Imai,Jean-Marc Robert,Peter Yamamoto
#t1993
#cDiscrete Applied Mathematics
#index837198
#% 
#!
  
#*Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.
#@Yoshiko Ikebe,Tomomi Matsui,Akihisa Tamura
#t1993
#cDiscrete Applied Mathematics
#index837199
#% 
#!
  
#*Preface.
#@Juraj Hromkovic,Ondrej Sýkora
#t2001
#cDiscrete Applied Mathematics
#index837200
#% 
#!
  
#*An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function.
#@Victor P. Il'ev
#t2001
#cDiscrete Applied Mathematics
#index837201
#% 
#!
  
#*The Hamiltonian problem on distance-hereditary graphs.
#@Sun-Yuan Hsieh,Chin-Wen Ho,Tsan-sheng Hsu,Ming-Tat Ko
#t2006
#cDiscrete Applied Mathematics
#index837202
#%147
#%704
#%415309
#%624118
#%836548
#%838343
#%839425
#%933043
#%952490
#%953111
#%974454
#%989389
#%1058996
#%1061510
#%1093680
#%1095297
#!
  
#*Hereditary systems and greedy-type algorithms.
#@Victor P. Il'ev
#t2003
#cDiscrete Applied Mathematics
#index837203
#% 
#!
  
#*On shortest three-edge-connected Steiner networks with Euclidean distance.
#@D. Frank Hsu,Xiao-Dong Hu
#t2000
#cDiscrete Applied Mathematics
#index837204
#% 
#!
  
#*Scheduling of Conditional Executed Jobs on Unrelated Processors.
#@Klaus Jansen
#t1995
#cDiscrete Applied Mathematics
#index837205
#% 
#!
  
#*An Improved Upper Bound for the Subarray Partial Concentrators.
#@Xiao-Dong Hu,Frank K. Hwang
#t1992
#cDiscrete Applied Mathematics
#index837206
#% 
#!
  
#*Generalized Coloring for Tree-like Graphs.
#@Klaus Jansen,Petra Scheffler
#t1997
#cDiscrete Applied Mathematics
#index837207
#% 
#!
  
#*Cutting Numbers for the Forward Loop Backward Hop Network.
#@Xiao-Dong Hu,Frank K. Hwang
#t1994
#cDiscrete Applied Mathematics
#index837208
#% 
#!
  
#*Real royal road functions--where crossover provably is essential.
#@Thomas Jansen,Ingo Wegener
#t2005
#cDiscrete Applied Mathematics
#index837209
#%140
#%186285
#%550509
#%3004479
#!
  
#*A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem.
#@Zhiquan Hu,Zhenhong Liu
#t1998
#cDiscrete Applied Mathematics
#index837210
#% 
#!
  
#*on Subwords of Infinite Words.
#@Lucian Ilie
#t1995
#cDiscrete Applied Mathematics
#index837211
#% 
#!
  
#*On the Complexity of two Circle Connecting Problems.
#@Nen-Fu Huang
#t1993
#cDiscrete Applied Mathematics
#index837212
#% 
#!
  
#*On strongly context-free languages.
#@Lucian Ilie,Gheorghe Paun,Grzegorz Rozenberg,Arto Salomaa
#t2000
#cDiscrete Applied Mathematics
#index837213
#% 
#!
  
#*A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs.
#@Jing Huang
#t1998
#cDiscrete Applied Mathematics
#index837214
#% 
#!
  
#*Recognizing Graphs of Acyclic Cubical Complexes.
#@Wilfried Imrich,Sandi Klavzar
#t1999
#cDiscrete Applied Mathematics
#index837215
#% 
#!
  
#*Using transforming matrices to generate DNA clone grids.
#@Hua-Min Huang,Frank K. Hwang,Jian-Feng Ma
#t2003
#cDiscrete Applied Mathematics
#index837216
#% 
#!
  
#*On-line construction of compact directed acyclic word graphs.
#@Shunsuke Inenaga,Hiromasa Hoshino,Ayumi Shinohara,Masayuki Takeda,Setsuo Arikawa,Giancarlo Mauri,Giulio Pavesi
#t2005
#cDiscrete Applied Mathematics
#index837217
#%522
#%2487
#%2526
#%65745
#%118707
#%118840
#%146168
#%615911
#%622189
#%882065
#%929760
#%949805
#%951134
#%1025631
#%1059931
#%1074534
#%1090276
#%1090274
#%1092047
#%1094855
#!
  
#*Pushing vertices in digraphs without long induced cycles.
#@Jing Huang,Gary MacGillivray,Anders Yeo
#t2002
#cDiscrete Applied Mathematics
#index837218
#%623072
#%848024
#%848192
#!
  
#*Stable Marriage and Indifference.
#@Robert W. Irving
#t1994
#cDiscrete Applied Mathematics
#index837219
#% 
#!
  
#*From Ternary Strings to Wiener Indices of Benzenoid Chains.
#@Wen-Chung Huang,Bo-Yin Yang,Yeong-Nan Yeh
#t1997
#cDiscrete Applied Mathematics
#index837220
#% 
#!
  
#*The b-chromatic Number of a Graph.
#@Robert W. Irving,David Manlove
#t1999
#cDiscrete Applied Mathematics
#index837221
#% 
#!
  
#*Replacing cliques by stars in quasi-median graphs.
#@Katharina T. Huber,Vincent Moulton,Charles Semple
#t2004
#cDiscrete Applied Mathematics
#index837222
#%836018
#%848038
#%851273
#!
  
#*Bounded Discrete Representations of Interval Orders.
#@Garth Isaak
#t1993
#cDiscrete Applied Mathematics
#index837223
#% 
#!
  
#*Reducible Configurations for the Cycle Double Cover Conjecture.
#@Andreas Huck
#t2000
#cDiscrete Applied Mathematics
#index837224
#% 
#!
  
#*VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States.
#@Yoshiyasu Ishigami,Sei'ichi Tani
#t1997
#cDiscrete Applied Mathematics
#index837225
#% 
#!
  
#*Solving the path cover problem on circular-arc graphs by using an approximation algorithm.
#@Ruo-Wei Hung,Maw-Shang Chang
#t2006
#cDiscrete Applied Mathematics
#index837226
#%105281
#%651211
#%853614
#%929786
#%930010
#%930130
#%931791
#%934559
#%949814
#%953009
#%1059012
#%1059959
#%1092146
#%1093571
#%1094718
#%1095250
#%3307386
#!
  
#*VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States.
#@Yoshiyasu Ishigami,Sei'ichi Tani
#t1997
#cDiscrete Applied Mathematics
#index837227
#% 
#!
  
#*Polygon Scheduling.
#@Johann Hurink
#t1996
#cDiscrete Applied Mathematics
#index837228
#% 
#!
  
#*Measure Theoretic Approach to the Classification of Cellular Automata.
#@Shin'ichirou Ishii
#t1992
#cDiscrete Applied Mathematics
#index837229
#% 
#!
  
#*Local search algorithms for a single-machine scheduling problem with positive and negative time-lags.
#@Johann Hurink,Jens Keuchel
#t2001
#cDiscrete Applied Mathematics
#index837230
#% 
#!
  
#*Foreword.
#@Sorin Istrail,Pavel A. Pevzner,Ron Shamir
#t2000
#cDiscrete Applied Mathematics
#index837231
#% 
#!
  
#*Makespan minimization for flow-shop problems with transportation times and a single robot.
#@Johann Hurink,Sigrid Knust
#t2001
#cDiscrete Applied Mathematics
#index837232
#% 
#!
  
#*Foreword.
#@Sorin Istrail,Pavel A. Pevzner,Ron Shamir
#t1998
#cDiscrete Applied Mathematics
#index837233
#% 
#!
  
#*A tabu search algorithm for scheduling a single robot in a job-shop environment.
#@Johann Hurink,Sigrid Knust
#t2002
#cDiscrete Applied Mathematics
#index837234
#% 
#!
  
#*Threshold properties of random boolean constraint satisfaction problems.
#@Gabriel Istrate
#t2005
#cDiscrete Applied Mathematics
#index837235
#%104612
#%622760
#%816324
#%887561
#%1051697
#%1052066
#%1090246
#!
  
#*Foreword.
#@Ferran Hurtado,Joseph S. B. Mitchell,Marc Noy
#t2001
#cDiscrete Applied Mathematics
#index837236
#% 
#!
  
#*Self-reading sequences.
#@Gabriel Istrate
#t1994
#cDiscrete Applied Mathematics
#index837237
#% 
#!
  
#*Separability by two lines and by nearly straight polygonal chains.
#@Ferran Hurtado,Mercè Mora,Pedro A. Ramos,Carlos Seara
#t2004
#cDiscrete Applied Mathematics
#index837238
#%3482
#%81887
#%803977
#%837196
#%837240
#%887713
#%930886
#%1058479
#!
  
#*Some Combinatorial Properties of Self-reading Sequences.
#@Gabriel Istrate,Gheorghe Paun
#t1994
#cDiscrete Applied Mathematics
#index837239
#% 
#!
  
#*Separating objects in the plane by wedges and strips.
#@Ferran Hurtado,Marc Noy,Pedro A. Ramos,Carlos Seara
#t2001
#cDiscrete Applied Mathematics
#index837240
#% 
#!
  
#*Better Approximations of Non-Hamiltonian Graphs.
#@Kazuo Iwama,Eiji Miyano
#t1998
#cDiscrete Applied Mathematics
#index837241
#% 
#!
  
#*A note on rectilinear and polar visibility graphs.
#@Joan P. Hutchinson
#t2005
#cDiscrete Applied Mathematics
#index837242
#%850639
#%953361
#%2781186
#!
  
#*Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree.
#@Pranava K. Jha,Naveen Agnihotri,Rajesh Kumar Arora
#t1997
#cDiscrete Applied Mathematics
#index837243
#% 
#!
  
#*Smallest independent dominating sets in Kronecker products of cycles.
#@Pranava K. Jha
#t2001
#cDiscrete Applied Mathematics
#index837244
#% 
#!
  
#*An external memory data structure for shortest path queries.
#@David A. Hutchinson,Anil Maheshwari,Norbert Zeh
#t2003
#cDiscrete Applied Mathematics
#index837245
#%3482
#%111266
#%111265
#%186538
#%545517
#%610235
#%611069
#%614206
#%622169
#%622526
#%651154
#%660526
#%807918
#%950336
#%950342
#%952848
#%1059210
#%1060989
#!
  
#*A Theorem on the Principal Structure for Independent Matchings.
#@Satoru Iwata,Kazuo Murota
#t1995
#cDiscrete Applied Mathematics
#index837246
#% 
#!
  
#*Searching for a minimal solution subgraph in explicit AND/OR graphs.
#@Dusan Hvalica
#t2001
#cDiscrete Applied Mathematics
#index837247
#% 
#!
  
#*Learning with Queries Corrupted by Classification Noise.
#@Jeffrey C. Jackson,Eli Shamir,Clara Shwartzman
#t1999
#cDiscrete Applied Mathematics
#index837248
#% 
#!
  
#*Adaptive memory search for Boolean optimization problems.
#@Lars Magnus Hvattum,Arne Løkketangen,Fred Glover
#t2004
#cDiscrete Applied Mathematics
#index837249
#% 
#!
  
#*Ø-Threshold and Ø-Tolerance Chain Graphs.
#@Michael S. Jacobson,Jenö Lehel,Linda M. Lesniak
#t1993
#cDiscrete Applied Mathematics
#index837250
#% 
#!
  
#*A competitive algorithm to find all defective edges in a graph.
#@Frank K. Hwang
#t2005
#cDiscrete Applied Mathematics
#index837251
#%836560
#%838207
#!
  
#*A Note on Graphs Which Have Upper Irredundance Equal to Independence.
#@Michael S. Jacobson,Kenneth Peters
#t1993
#cDiscrete Applied Mathematics
#index837252
#% 
#!
  
#*The Time Complexity of Deterministic Broadcast Radio Networks.
#@Frank K. Hwang
#t1995
#cDiscrete Applied Mathematics
#index837253
#% 
#!
  
#*On polynomial complexity of a stochastic algorithm for mixed zero-one programs.
#@Raj Jagannathan
#t2004
#cDiscrete Applied Mathematics
#index837254
#%622442
#%798317
#%798622
#%3007117
#!
  
#*Comparison of Permanental Bounds of (0, 1)-matrices.
#@Suk-Geun Hwang,Arnold R. Kräuter
#t1998
#cDiscrete Applied Mathematics
#index837255
#% 
#!
  
#*A Generalization of maximal independent sets.
#@Arun K. Jagota,Giri Narasimhan,Lubomír Soltés
#t2001
#cDiscrete Applied Mathematics
#index837256
#% 
#!
  
#*Optimal quantitative group testing on cycles and paths.
#@Frank K. Hwang,J. S. Lee
#t2001
#cDiscrete Applied Mathematics
#index837257
#% 
#!
  
#*The complexity of broadcasting in planar and decomposable graphs.
#@Andreas Jakoby,Rüdiger Reischuk,Christian Schindelhauer
#t1998
#cDiscrete Applied Mathematics
#index837258
#% 
#!
  
#*The effect of machine availability on the worst-case performance of LPT.
#@Hark-Chin Hwang,Kangbok Lee,Soo Y. Chang
#t2005
#cDiscrete Applied Mathematics
#index837259
#%836384
#%839126
#%950677
#%3417716
#!
  
#*Linear Time optimization Algorithms for P4-sparse Graphs.
#@Beverly Jamison,Stephan Olariu
#t1995
#cDiscrete Applied Mathematics
#index837260
#% 
#!
  
#*Permutation polytopes corresponding to strongly supermodular functions.
#@Frank K. Hwang,J. S. Lee,Uriel G. Rothblum
#t2004
#cDiscrete Applied Mathematics
#index837261
#% 
#!
  
#*Closure spaces that are not uniquely generated.
#@Robert E. Jamison,John L. Pfaltz
#t2005
#cDiscrete Applied Mathematics
#index837262
#%854173
#%950883
#%951478
#!
  
#*Erratum: Binary Vectors with Exactly Nonoverlapping -Tuples of Consecutive ones.
#@Frank K. Hwang,Stavros G. Papastavridis
#t1993
#cDiscrete Applied Mathematics
#index837263
#% 
#!
  
#*Preface.
#@Melvin F. Janowitz
#t2003
#cDiscrete Applied Mathematics
#index837264
#% 
#!
  
#*The Capacity of the Subarray Partial Concentrators.
#@Frank K. Hwang,G. W. Richards
#t1992
#cDiscrete Applied Mathematics
#index837265
#% 
#!
  
#*The Allocation Problem in Hardware Design.
#@Klaus Jansen
#t1993
#cDiscrete Applied Mathematics
#index837266
#% 
#!
  
#*Constrained partitioning problems.
#@Frank K. Hwang,Uriel G. Rothblum
#t1994
#cDiscrete Applied Mathematics
#index837267
#% 
#!
  
#*Analysis of Scheduling Problems with Typed Task Systems.
#@Klaus Jansen
#t1994
#cDiscrete Applied Mathematics
#index837268
#% 
#!
  
#*A d-move Local Permutation Routing for the d-cube.
#@Frank K. Hwang,Y. C. Yao,Miltos D. Grammatikakis
#t1997
#cDiscrete Applied Mathematics
#index837269
#% 
#!
  
#*Comparison of column generation models for channel assignment in cellular networks.
#@Brigitte Jaumard,Odile Marcotte,Christophe Meyer,Tsevi Vovor
#t2001
#cDiscrete Applied Mathematics
#index837270
#% 
#!
  
#*Measures on Boolean polynomials and their applications in data mining.
#@Szymon Jaroszewicz,Dan A. Simovici,Ivo G. Rosenberg
#t2004
#cDiscrete Applied Mathematics
#index837271
#%2067
#%207483
#%527074
#%622647
#%798427
#!
  
#*Erratum to "Comparison of column generation models for channel assignment in cellular networks".
#@Brigitte Jaumard,Odile Marcotte,Christophe Meyer,Tsevi Vovor
#t2002
#cDiscrete Applied Mathematics
#index837272
#% 
#!
  
#*Counting Representable Sets on Simple Graphs.
#@Peter Jeavons
#t1993
#cDiscrete Applied Mathematics
#index837273
#% 
#!
  
#*Superdominance order and distance of trees with bounded maximum degree.
#@F. Jelen,Eberhard Triesch
#t2003
#cDiscrete Applied Mathematics
#index837274
#%836787
#!
  
#*The Metropolis Algorithm for Graph Bisection.
#@Mark Jerrum,Gregory B. Sorkin
#t1998
#cDiscrete Applied Mathematics
#index837275
#% 
#!
  
#*Partial and Perfect Path Covers of Cographs.
#@David G. Kirkpatrick,Madhukar K. Reddy,C. Pandu Rangan,Anand Srinivasan
#t1998
#cDiscrete Applied Mathematics
#index837276
#% 
#!
  
#*(2, 1)-labeling of direct product of paths and cycles.
#@Pranava K. Jha,Sandi Klavzar,Aleksander Vesel
#t2005
#cDiscrete Applied Mathematics
#index837277
#%837244
#%837309
#%837303
#%837310
#%851186
#%854494
#%1061170
#%1061385
#%1061419
#%1061777
#%1082258
#!
  
#*Special Issue on Typical Case Complexity and Phase Transitions.
#@Lefteris M. Kirousis,Evangelos Kranakis
#t2005
#cDiscrete Applied Mathematics
#index837278
#% 
#!
  
#*Optimal (, 1)-labelings of certain direct products of cycles and Cartesian products of cycles.
#@Pranava K. Jha,Sandi Klavzar,Aleksander Vesel
#t2005
#cDiscrete Applied Mathematics
#index837279
#% 
#!
  
#*A Lower Bound for the Job Insertion Problem.
#@Tamás Kis,Alain Hertz
#t2003
#cDiscrete Applied Mathematics
#index837280
#%838337
#%3545675
#!
  
#*A group testing problem for graphs with several defective edges.
#@Petra Johann
#t2002
#cDiscrete Applied Mathematics
#index837281
#% 
#!
  
#*On the bound for anonymous secret sharing schemes.
#@Wataru Kishimoto,Koji Okada,Kaoru Kurosawa,Wakaha Ogata
#t2002
#cDiscrete Applied Mathematics
#index837282
#%775946
#%836183
#%932348
#%986052
#%1061824
#!
  
#*On the convergence of generalized hill climbing algorithms.
#@Alan W. Johnson,Sheldon H. Jacobson
#t2002
#cDiscrete Applied Mathematics
#index837283
#% 
#!
  
#*An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra.
#@Wei Z. Kitto,Andrew Vince,David Clifford Wilson
#t1994
#cDiscrete Applied Mathematics
#index837284
#% 
#!
  
#*Deterministic inverse zero-patterns.
#@Charles R. Johnson,Michael Lundquist,Thomas J. Lundy,John S. Maybee
#t2001
#cDiscrete Applied Mathematics
#index837285
#% 
#!
  
#*Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences.
#@Andrew Klapper,Agnes Hui Chan,Mark Goresky
#t1993
#cDiscrete Applied Mathematics
#index837286
#% 
#!
  
#*Optimal communication channel utilization for matrix transposition and related permutations on binary cubes.
#@S. Lennart Johnsson,Ching-Tien Ho
#t1994
#cDiscrete Applied Mathematics
#index837287
#% 
#!
  
#*The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width.
#@Ralf Klasing
#t1998
#cDiscrete Applied Mathematics
#index837288
#% 
#!
  
#*On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks.
#@Tibor Jordán
#t2003
#cDiscrete Applied Mathematics
#index837289
#% 
#!
  
#*Broadcasting in Butterfly and deBruijn Networks.
#@Ralf Klasing,Burkhard Monien,Regine Peine,Elena Stöhr
#t1994
#cDiscrete Applied Mathematics
#index837290
#% 
#!
  
#*Diameters of Cubic Graphs.
#@Leif K. Jørgensen
#t1992
#cDiscrete Applied Mathematics
#index837291
#% 
#!
  
#*General lower bounds on the query complexity within the exact learning model.
#@Norbert Klasner,Hans-Ulrich Simon
#t2000
#cDiscrete Applied Mathematics
#index837292
#% 
#!
  
#*Maximal Independent Sets in Graphs with at Most One Cycle.
#@Min-Jen Jou,Gerard J. Chang
#t1997
#cDiscrete Applied Mathematics
#index837293
#% 
#!
  
#*A coloring problem on the n-cube.
#@Dongsoo S. Kim,Ding-Zhu Du,Panos M. Pardalos
#t2000
#cDiscrete Applied Mathematics
#index837294
#% 
#!
  
#*Large Survivable Nets and the Generalized Prisms.
#@Hong-Jian Lai
#t1995
#cDiscrete Applied Mathematics
#index837295
#% 
#!
  
#*Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs.
#@Joanna Józefowska,Marek Mika,Rafal Rózycki,Grzegorz Waligóra,Jan Weglarz
#t1999
#cDiscrete Applied Mathematics
#index837296
#% 
#!
  
#*Wiener Number of Vertex-weighted Graphs and a Chemical Application.
#@Sandi Klavzar,Ivan Gutman
#t1997
#cDiscrete Applied Mathematics
#index837297
#% 
#!
  
#*Neither Reading Few Bits Twice Nor Reading Illegally Helps Much.
#@Stasys Jukna,Alexander A. Razborov
#t1998
#cDiscrete Applied Mathematics
#index837298
#% 
#!
  
#*On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem.
#@Sandi Klavzar,Uros Milutinovic,Ciril Petr
#t2002
#cDiscrete Applied Mathematics
#index837299
#%940576
#!
  
#*The QAP-polytope and the star transformation.
#@Michael Jünger,Volker Kaibel
#t2001
#cDiscrete Applied Mathematics
#index837300
#% 
#!
  
#*Dominating Cartesian Products of Cycles.
#@Sandi Klavzar,Norbert Seifter
#t1995
#cDiscrete Applied Mathematics
#index837301
#% 
#!
  
#*Trace-Orthogonal Normal Bases.
#@Dieter Jungnickel
#t1993
#cDiscrete Applied Mathematics
#index837302
#% 
#!
  
#*Algebraic Approach to Fasciagraphs and Rotagraphs.
#@Sandi Klavzar,Janez Zerovnik
#t1996
#cDiscrete Applied Mathematics
#index837303
#% 
#!
  
#*Perfect and Almost Perfect Sequences.
#@Dieter Jungnickel,Alexander Pott
#t1999
#cDiscrete Applied Mathematics
#index837304
#% 
#!
  
#*Extremal problems for ordered hypergraphs: small patterns and some enumeration.
#@Martin Klazar
#t2004
#cDiscrete Applied Mathematics
#index837305
#%848731
#%848935
#%849161
#%851526
#%864692
#%977111
#!
  
#*Lower Bounds for the Job-shop Scheduling Problem on Multi-purpose Machines.
#@Bernd Jurisch
#t1995
#cDiscrete Applied Mathematics
#index837306
#% 
#!
  
#*On Trees and Noncrossing Partitions.
#@Martin Klazar
#t1998
#cDiscrete Applied Mathematics
#index837307
#% 
#!
  
#*Algorithms for Minclique Scheduling Problems.
#@Bernd Jurisch,Wieslaw Kubiak,Joanna Józefowska
#t1997
#cDiscrete Applied Mathematics
#index837308
#% 
#!
  
#*Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers.
#@Sandi Klavzar,Aleksander Vesel
#t2003
#cDiscrete Applied Mathematics
#index837309
#%837303
#%837310
#%854494
#%1061170
#%1061385
#%1061419
#%1061777
#%1124672
#!
  
#*Distance-related Invariants on Polygraphs.
#@Martin Juvan,Bojan Mohar,Janez Zerovnik
#t1997
#cDiscrete Applied Mathematics
#index837310
#% 
#!
  
#*Parallel Lempel Ziv coding.
#@Shmuel Tomi Klein,Yair Wiseman
#t2005
#cDiscrete Applied Mathematics
#index837311
#%808455
#%951638
#%1059837
#!
  
#*New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization.
#@Santosh N. Kabadi
#t2002
#cDiscrete Applied Mathematics
#index837312
#% 
#!
  
#*Resonance in Elemental Benzenoids.
#@Douglas J. Klein,H.-Y. Zhu
#t1996
#cDiscrete Applied Mathematics
#index837313
#% 
#!
  
#*Computational analysis of counter-based schemes for VLSI test pattern generation.
#@Dimitrios Kagaris,Spyros Tragoudas
#t2001
#cDiscrete Applied Mathematics
#index837314
#% 
#!
  
#*On combinatorial properties of the Arshon sequence.
#@A. V. Klepinin,E. V. Sukhanov
#t2001
#cDiscrete Applied Mathematics
#index837315
#% 
#!
  
#*Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs.
#@Hermann G. Kahlbacher,T. C. Edwin Cheng
#t1993
#cDiscrete Applied Mathematics
#index837316
#% 
#!
  
#*Digital straightness - a review.
#@Reinhard Klette,Azriel Rosenfeld
#t2004
#cDiscrete Applied Mathematics
#index837317
#%154042
#%622503
#%833639
#%835182
#%951164
#%1031106
#%1032320
#%1032318
#%1044125
#%1093487
#!
  
#*A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint.
#@Thomas Kalinowski
#t2005
#cDiscrete Applied Mathematics
#index837318
#% 
#!
  
#*On the Minimal Covering of Infinite Sets.
#@Jonathan Klimó
#t1993
#cDiscrete Applied Mathematics
#index837319
#% 
#!
  
#*Lower Probabilities and Function Representation.
#@Thomas Kämpke
#t1996
#cDiscrete Applied Mathematics
#index837320
#% 
#!
  
#*Permuting Matrices to Avoid Forbidden Submatrices.
#@Bettina Klinz,Rüdiger Rudolf,Gerhard J. Woeginger
#t1995
#cDiscrete Applied Mathematics
#index837321
#% 
#!
  
#*A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem.
#@A. H. G. Rinnooy Kan,Leen Stougie,Carlo Vercellis
#t1993
#cDiscrete Applied Mathematics
#index837322
#% 
#!
  
#*on the Recognition of Permuted Bottleneck Monge Matrices.
#@Bettina Klinz,Rüdiger Rudolf,Gerhard J. Woeginger
#t1995
#cDiscrete Applied Mathematics
#index837323
#% 
#!
  
#*Shuffling Biological Sequences.
#@Denise B. Kandel,Yossi Matias,Ron Unger,Peter Winkler
#t1996
#cDiscrete Applied Mathematics
#index837324
#% 
#!
  
#*Computing the branchwidth of interval graphs.
#@Ton Kloks,Jan Kratochvíl,Haiko Müller
#t2005
#cDiscrete Applied Mathematics
#index837325
#%707
#%267430
#%952733
#%976811
#%977717
#%1058651
#%1058697
#!
  
#*Line broadcasting in cycles.
#@Jave O. Kane,Joseph G. Peters
#t1998
#cDiscrete Applied Mathematics
#index837326
#% 
#!
  
#*Bandwidth and topological bandwidth of graphs with few P4's.
#@Ton Kloks,Richard B. Tan
#t2001
#cDiscrete Applied Mathematics
#index837327
#% 
#!
  
#*Spanning trees with constraints on the leaf degree.
#@Atsushi Kaneko
#t2001
#cDiscrete Applied Mathematics
#index837328
#% 
#!
  
#*Non-adaptive Group Testing in the Presence of Errors.
#@Emanuel Knill,William J. Bruno,David C. Torney
#t1998
#cDiscrete Applied Mathematics
#index837329
#% 
#!
  
#*Straight line embeddings of rooted star forests in the plane.
#@Atsushi Kaneko,Mikio Kano
#t2000
#cDiscrete Applied Mathematics
#index837330
#% 
#!
  
#*Connectivity of iterated line graphs.
#@Martin Knor,Ludovít Niepel
#t2003
#cDiscrete Applied Mathematics
#index837331
#%849262
#!
  
#*Some Large Trivalent Graphs Having Small Diameters.
#@William M. Kantor
#t1992
#cDiscrete Applied Mathematics
#index837332
#% 
#!
  
#*Analysis of 3gpp-MAC and Two-key 3gpp-MAC.
#@Lars R. Knudsen,Chris J. Mitchell
#t2003
#cDiscrete Applied Mathematics
#index837333
#%986042
#!
  
#*Relocalization - Theory and Practice.
#@Oliver Karch,Thomas Wahl
#t1999
#cDiscrete Applied Mathematics
#index837334
#% 
#!
  
#*On the structure of Skipjack.
#@Lars R. Knudsen,David Wagner
#t2001
#cDiscrete Applied Mathematics
#index837335
#% 
#!
  
#*The complexity of compressing subsegments of images described by finite automata.
#@Juhani Karhumäki,Wojciech Plandowski,Wojciech Rytter
#t2003
#cDiscrete Applied Mathematics
#index837336
#%118580
#%621943
#%624180
#%1025662
#%1058982
#!
  
#*Linear Time Algorithms for the Weighted Tailored 2-Partition Problem and the Weighted 2-Center Problem under -Distance.
#@Ming-Tat Ko,Y. T. Ching
#t1992
#cDiscrete Applied Mathematics
#index837337
#% 
#!
  
#*Bipartite-perfect Graphs.
#@Van Bang Le
#t2003
#cDiscrete Applied Mathematics
#index837338
#%70760
#%851455
#%977680
#%1061114
#%1061563
#!
  
#*Matrices Generated By Semilattices.
#@Johan Karlander
#t1995
#cDiscrete Applied Mathematics
#index837339
#% 
#!
  
#*Edge dominating set and colorings on graphs with fixed clique-width.
#@Daniel Kobler,Udi Rotics
#t2003
#cDiscrete Applied Mathematics
#index837340
#%124630
#%481148
#%610940
#%660703
#%836521
#%836522
#%838254
#%839124
#%839238
#%849144
#%971764
#%1091459
#%1196712
#!
  
#*Ramsey-remainder for convex sets and the Erdös-Szekeres theorem.
#@Gyula Károlyi
#t2001
#cDiscrete Applied Mathematics
#index837341
#% 
#!
  
#*on the Essential Test Sets of Discrete Matrices.
#@Alexander Kogan
#t1995
#cDiscrete Applied Mathematics
#index837342
#% 
#!
  
#*Crossing-free segments and triangles in point configurations.
#@Gyula Károlyi,Emo Welzl
#t2001
#cDiscrete Applied Mathematics
#index837343
#% 
#!
  
#*Optimal Orientations of Products of Paths and Cycles.
#@Khee Meng Koh,Eng Guan Tay
#t1997
#cDiscrete Applied Mathematics
#index837344
#% 
#!
  
#*2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
#@Yoshiyuki Karuno,Hiroshi Nagamochi
#t2003
#cDiscrete Applied Mathematics
#index837345
#%835964
#!
  
#*On Optimal Orientations of Cartesian Products with a Bipartite Graph.
#@Khee Meng Koh,Eng Guan Tay
#t1999
#cDiscrete Applied Mathematics
#index837346
#% 
#!
  
#*Hard cases of the multifacility location problem.
#@Alexander V. Karzanov
#t2004
#cDiscrete Applied Mathematics
#index837347
#%836430
#%837347
#%864116
#%864643
#%1058998
#!
  
#*Connected Domination and Dominating Clique in Trapezoid Graphs.
#@Ekkehard Köhler
#t2000
#cDiscrete Applied Mathematics
#index837348
#% 
#!
  
#*Half-integral Flows in a Planar Graph with Four Holes.
#@Alexander V. Karzanov
#t1995
#cDiscrete Applied Mathematics
#index837349
#% 
#!
  
#*Joint Performance of Greedy Heuristics for the Integer Knapsack Problem.
#@Rajeev Kohli,Ramesh Krishnamurti
#t1995
#cDiscrete Applied Mathematics
#index837350
#% 
#!
  
#*Subdivisions of integral base polytopes.
#@Kenji Kashiwabara
#t2001
#cDiscrete Applied Mathematics
#index837351
#% 
#!
  
#*Order-preserving, upward drawing of binary trees using fewer bends.
#@Sung Kwon Kim
#t2004
#cDiscrete Applied Mathematics
#index837352
#%803624
#%803880
#!
  
#*Labeled Versus Unlabeled Distributed Cayley Networks.
#@Evangelos Kranakis,Danny Krizanc
#t1995
#cDiscrete Applied Mathematics
#index837353
#% 
#!
  
#*Envelopes and clutters.
#@Kenji Kashiwabara,Bunpei Nakano
#t2000
#cDiscrete Applied Mathematics
#index837354
#% 
#!
  
#*-Competition Numbers.
#@Suh-Ryung Kim,Terry A. McKee,Fred R. McMorris,Fred S. Roberts
#t1993
#cDiscrete Applied Mathematics
#index837355
#% 
#!
  
#*Equivalent literal propagation in the DLL procedure.
#@Chu Min Li
#t2003
#cDiscrete Applied Mathematics
#index837356
#%2022
#%11931
#%71348
#%72072
#%133214
#%133250
#%142486
#%367566
#%621778
#%771155
#%950130
#%951756
#%954767
#!
  
#*A greedy algorithm for convex geometries.
#@Kenji Kashiwabara,Yoshio Okamoto
#t2003
#cDiscrete Applied Mathematics
#index837357
#%837432
#%839457
#%1013625
#!
  
#*Competition Numbers of Graphs with a Small Number of Triangles.
#@Suh-Ryung Kim,Fred S. Roberts
#t1997
#cDiscrete Applied Mathematics
#index837358
#% 
#!
  
#*Hexagonal Systems with Forcing Single Edges.
#@Xueliang Li
#t1997
#cDiscrete Applied Mathematics
#index837359
#% 
#!
  
#*Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability.
#@Kenji Kashiwabara,Takashi Takabatake
#t2003
#cDiscrete Applied Mathematics
#index837360
#%851077
#%1013369
#%1014020
#!
  
#*obstruction Set Isolation for the Gate Matrix Layout Problem.
#@Nancy G. Kinnersley,Michael A. Langston
#t1994
#cDiscrete Applied Mathematics
#index837361
#% 
#!
  
#*Two-segmented Channel Routing Is Strong NP-complete.
#@Wing Ning Li
#t1997
#cDiscrete Applied Mathematics
#index837362
#% 
#!
  
#*A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
#@K. N. Kashyrskikh,Chris N. Potts,Sergey V. Sevastianov
#t2001
#cDiscrete Applied Mathematics
#index837363
#% 
#!
  
#*Subset-conjunctive rules for breast cancer diagnosis.
#@Rajeev Kohli,Ramesh Krishnamurti,Kamel Jedidi
#t2006
#cDiscrete Applied Mathematics
#index837364
#%836271
#%1013425
#%1061104
#%1061571
#%1090922
#%1112474
#!
  
#*On minimal coverings of the Boolean cube by centered antichains.
#@O. M. Kasim-Zade
#t2001
#cDiscrete Applied Mathematics
#index837365
#% 
#!
  
#*Topological optimization with a network reliability constraint.
#@Tetsushi Koide,S. Shinmori,H. Ishii
#t2001
#cDiscrete Applied Mathematics
#index837366
#% 
#!
  
#*Enumeration of balanced ternary designs.
#@Petteri Kaski,Patric R. J. Östergård
#t2004
#cDiscrete Applied Mathematics
#index837367
#% 
#!
  
#*Vapnik-Chervonenkis Dimension of Recurrent Neural Networks.
#@Pascal Koiran,Eduardo D. Sontag
#t1998
#cDiscrete Applied Mathematics
#index837368
#% 
#!
  
#*A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control.
#@Naoki Katoh,Toshihide Ibaraki,Tiko Kameda
#t1992
#cDiscrete Applied Mathematics
#index837369
#% 
#!
  
#*Sensitivity Analysis of List Scheduling Heuristics.
#@Antoon W. J. Kolen,A. H. G. Rinnooy Kan,C. P. M. van Hoesel,Albert P. M. Wagelmans
#t1994
#cDiscrete Applied Mathematics
#index837370
#% 
#!
  
#*A large set of non-Hamiltonian graphs.
#@Gyula Y. Katona
#t2001
#cDiscrete Applied Mathematics
#index837371
#% 
#!
  
#*Genetic Local Search in Combinatorial Optimization.
#@Antoon W. J. Kolen,Erwin Pesch
#t1994
#cDiscrete Applied Mathematics
#index837372
#% 
#!
  
#*Strong qualitative independence.
#@Gyula O. H. Katona
#t2004
#cDiscrete Applied Mathematics
#index837373
#% 
#!
  
#*Criterion of generativeness of sets of rational probabilities by a class of Boolean functions.
#@Roman M. Kolpakov
#t2004
#cDiscrete Applied Mathematics
#index837374
#% 
#!
  
#*Edge Disjoint Polyp Packing.
#@Gyula Y. Katona
#t1997
#cDiscrete Applied Mathematics
#index837375
#% 
#!
  
#*Minimum k-broadcast graphs.
#@Jean-Claude König,Emmanuel Lazard
#t1994
#cDiscrete Applied Mathematics
#index837376
#% 
#!
  
#*New type of coding problem motivated by database theory.
#@Gyula O. H. Katona,Attila Sali
#t2004
#cDiscrete Applied Mathematics
#index837377
#%204076
#%770718
#%836603
#%842017
#!
  
#*Recurrence relations for the spectrum polynomial of a matroid.
#@W. Kook
#t2004
#cDiscrete Applied Mathematics
#index837378
#%622060
#!
  
#*Explicit Expressions for the Central Characters of the Symmetric Group.
#@Jacob Katriel
#t1996
#cDiscrete Applied Mathematics
#index837379
#% 
#!
  
#*On storage of topological information.
#@Ralph Kopperman
#t2005
#cDiscrete Applied Mathematics
#index837380
#%833925
#%834104
#%1092687
#!
  
#*Distance labeling schemes for well-separated graph classes.
#@Michal Katz,Nir A. Katz,David Peleg
#t2005
#cDiscrete Applied Mathematics
#index837381
#%610585
#%614640
#%620253
#%622407
#%841397
#!
  
#*Equistable series-parallel graphs.
#@Ephraim Korach,Uri N. Peled
#t2003
#cDiscrete Applied Mathematics
#index837382
#%837818
#!
  
#*Locating Service Centers with Precedence Constraints.
#@Y. Kaufman,Arie Tamir
#t1993
#cDiscrete Applied Mathematics
#index837383
#% 
#!
  
#*A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs.
#@Ephraim Korach,Michal Penn
#t1993
#cDiscrete Applied Mathematics
#index837384
#% 
#!
  
#*Reconstructing a History of Recombinations From a Set of Sequences.
#@John D. Kececioglu,Dan Gusfield
#t1998
#cDiscrete Applied Mathematics
#index837385
#% 
#!
  
#*Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.
#@Gerard A. P. Kindervater,Jan Karel Lenstra,Martin W. P. Savelsbergh
#t1993
#cDiscrete Applied Mathematics
#index837386
#% 
#!
  
#*A polyhedral approach to sequence alignment problems.
#@John D. Kececioglu,Hans-Peter Lenhof,Kurt Mehlhorn,Petra Mutzel,Knut Reinert,Martin Vingron
#t2000
#cDiscrete Applied Mathematics
#index837387
#% 
#!
  
#*Tree-Width, Path-Widt, and Cutwidth.
#@Ephraim Korach,Nir Solel
#t1993
#cDiscrete Applied Mathematics
#index837388
#% 
#!
  
#*Short Encodings of Planar Graphs and Maps.
#@Kenneth Keeler,Jeffery Westbrook
#t1995
#cDiscrete Applied Mathematics
#index837389
#% 
#!
  
#*General Vertex Disjoint Paths in Series-Parallel Graphs.
#@Ephraim Korach,Ady Tal
#t1993
#cDiscrete Applied Mathematics
#index837390
#% 
#!
  
#*On spaced seeds for similarity search.
#@Uri Keich,Ming Li,Bin Ma,John Tromp
#t2004
#cDiscrete Applied Mathematics
#index837391
#%118518
#%559048
#%559049
#%962158
#!
  
#*Combinatorial Algorithms on a Class of Graphs.
#@N. M. Korneyenko
#t1994
#cDiscrete Applied Mathematics
#index837392
#% 
#!
  
#*The Complexity of Domination Problems in Circle Graphs.
#@J. Mark Keil
#t1993
#cDiscrete Applied Mathematics
#index837393
#% 
#!
  
#*On the asymptotics of the number of binary words with a given length of a maximal series.
#@A. D. Korshunov
#t2001
#cDiscrete Applied Mathematics
#index837394
#% 
#!
  
#*Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs.
#@J. Mark Keil,Patrice Belleville
#t2004
#cDiscrete Applied Mathematics
#index837395
#%3482
#%621540
#%836748
#%839333
#%852826
#%852831
#%950945
#%953149
#%1059012
#%1060640
#!
  
#*Periodic Assignment and Graph Colouring.
#@Jan H. M. Korst,Emile H. L. Aarts,Jan Karel Lenstra,Jaap Wessels
#t1994
#cDiscrete Applied Mathematics
#index837396
#% 
#!
  
#*Scheduling problems for parallel dedicated machines under multiple resource constraints.
#@Hans Kellerer,Vitaly A. Strusevich
#t2003
#cDiscrete Applied Mathematics
#index837397
#%814031
#%950482
#%950987
#%1060450
#!
  
#*Discrete Infinite Transportation Problems.
#@Kenneth O. Kortanek,Maretsugu Yamasaki
#t1995
#cDiscrete Applied Mathematics
#index837398
#% 
#!
  
#*On the Euclidean two Paths Problem.
#@Hans Kellerer,Gerhard J. Woeginger
#t1993
#cDiscrete Applied Mathematics
#index837399
#% 
#!
  
#*Traffic-light scheduling on the grid.
#@Guy Kortsarz,David Peleg
#t1994
#cDiscrete Applied Mathematics
#index837400
#% 
#!
  
#*A Tight Bound for 3-Partitioning.
#@Hans Kellerer,Gerhard J. Woeginger
#t1993
#cDiscrete Applied Mathematics
#index837401
#% 
#!
  
#*Approximating the Weight of Shallow Steiner Trees.
#@Guy Kortsarz,David Peleg
#t1999
#cDiscrete Applied Mathematics
#index837402
#% 
#!
  
#*On the Depth of Combinatorial Optimization Problems.
#@Walter Kern
#t1993
#cDiscrete Applied Mathematics
#index837403
#% 
#!
  
#*Path-independence and closure operators with the anti-exchange property.
#@Gleb A. Koshevoy
#t2005
#cDiscrete Applied Mathematics
#index837404
#% 
#!
  
#*The new FIFA rules are hard: complexity aspects of sports competitions.
#@Walter Kern,Daniël Paulusma
#t2001
#cDiscrete Applied Mathematics
#index837405
#% 
#!
  
#*Maximum packing for biconnected outerplanar graphs.
#@Tomas Kovacs,Andrzej Lingas
#t2000
#cDiscrete Applied Mathematics
#index837406
#% 
#!
  
#*Digital pseudomanifolds, digital weakmanifolds and Jordan-Brouwer separation theorem.
#@Mohammed Khachan,Patrick Chenin,Hafsa Deddi
#t2003
#cDiscrete Applied Mathematics
#index837407
#%153958
#%834104
#%834456
#%1093254
#%1339295
#!
  
#*Eulerian subgraphs and Hamilton-connected line graphs.
#@Dengxin Li,Hong-Jian Lai,Mingquan Zhan
#t2005
#cDiscrete Applied Mathematics
#index837408
#%836248
#%854349
#!
  
#*On the limit of branching rules for hard random unsatisfiable 3-SAT.
#@Chu Min Li,Sylvain Gérard
#t2003
#cDiscrete Applied Mathematics
#index837409
#%11931
#%12979
#%14938
#%493091
#%744626
#%745389
#%771155
#%932500
#!
  
#*On Trades: An Update.
#@Gholamreza B. Khosrovshahi,Hamid Reza Maimani,Rouzbeh Torabi
#t1999
#cDiscrete Applied Mathematics
#index837410
#% 
#!
  
#*Multidimensional cell lists for investigating 3-manifolds.
#@Vladimir Kovalevsky
#t2003
#cDiscrete Applied Mathematics
#index837411
#%154013
#%154058
#%154102
#%834111
#%951710
#!
  
#*Landmarks in Graphs.
#@Samir Khuller,Balaji Raghavachari,Azriel Rosenfeld
#t1996
#cDiscrete Applied Mathematics
#index837412
#% 
#!
  
#*Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case.
#@Mikhail Y. Kovalyov
#t1997
#cDiscrete Applied Mathematics
#index837413
#% 
#!
  
#*Centers of sets of pixels.
#@Samir Khuller,Azriel Rosenfeld,Angela Y. Wu
#t2000
#cDiscrete Applied Mathematics
#index837414
#% 
#!
  
#*Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints.
#@Mikhail Y. Kovalyov,Yakov M. Shafransky
#t1998
#cDiscrete Applied Mathematics
#index837415
#% 
#!
  
#*On Strongly Connected Digraphs with Bounded Cycle Length.
#@Samir Khuller,Balaji Raghavachari,Neal E. Young
#t1996
#cDiscrete Applied Mathematics
#index837416
#% 
#!
  
#*An exact algorithm for the channel assignment problem.
#@Daniel Král
#t2005
#cDiscrete Applied Mathematics
#index837417
#%610441
#%660923
#%817916
#%848520
#%1061419
#%1061591
#!
  
#*Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem.
#@Eike Kiltz,Arne Winterhof
#t2006
#cDiscrete Applied Mathematics
#index837418
#%484
#%105319
#%399336
#%842521
#%932902
#!
  
#*Coloring mixed hypertrees.
#@Daniel Král,Jan Kratochvíl,Andrzej Proskurowski,Heinz-Jürgen Voss
#t2006
#cDiscrete Applied Mathematics
#index837419
#%836293
#%838216
#%847434
#%849042
#%852170
#%1061295
#%1092735
#!
  
#*Stage-graph Representations.
#@Evangelos Kranakis,Danny Krizanc,Anil Maheshwari,Marc Noy,Jörg-Rüdiger Sack,Jorge Urrutia
#t1997
#cDiscrete Applied Mathematics
#index837420
#% 
#!
  
#*Ray shooting from convex ranges.
#@Evangelos Kranakis,Danny Krizanc,Anil Maheshwari,Jörg-Rüdiger Sack,Jorge Urrutia
#t2001
#cDiscrete Applied Mathematics
#index837421
#% 
#!
  
#*The VC-dimension of Set Systems Defined by Graphs.
#@Evangelos Kranakis,Danny Krizanc,Berthold Ruf,Jorge Urrutia,Gerhard J. Woeginger
#t1997
#cDiscrete Applied Mathematics
#index837422
#% 
#!
  
#*Discrete location problems with push-pull objectives.
#@Jakob Krarup,David Pisinger,Frank Plastria
#t2002
#cDiscrete Applied Mathematics
#index837423
#%3462
#%46606
#%406854
#%809531
#%836302
#%1275173
#!
  
#*A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness.
#@Jan Kratochvíl
#t1994
#cDiscrete Applied Mathematics
#index837424
#% 
#!
  
#*Structural decompositions, width parameters, and graph labelings.
#@Jan Kratochvíl,Andrzej Proskurowski,Oriol Serra
#t2005
#cDiscrete Applied Mathematics
#index837425
#% 
#!
  
#*Algorithmic complexity of list colorings.
#@Jan Kratochvíl,Zsolt Tuza
#t1994
#cDiscrete Applied Mathematics
#index837426
#% 
#!
  
#*Domination and Total Domination on Asteroidal Triple-free Graphs.
#@Dieter Kratsch
#t2000
#cDiscrete Applied Mathematics
#index837427
#% 
#!
  
#*Measuring the Vulnerability for Classes of Intersection Graphs.
#@Dieter Kratsch,Ton Kloks,Haiko Müller
#t1997
#cDiscrete Applied Mathematics
#index837428
#% 
#!
  
#*On the complexity of minimizing the number of late jobs in unit time open shop.
#@Svetlana A. Kravchenko
#t2000
#cDiscrete Applied Mathematics
#index837429
#% 
#!
  
#*Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem.
#@Svetlana A. Kravchenko
#t2000
#cDiscrete Applied Mathematics
#index837430
#% 
#!
  
#*Performance evaluation of demodulation with diversity--a combinatorial approach II: bijective methods.
#@Daniel Krob,Ekaterina A. Vassilieva
#t2005
#cDiscrete Applied Mathematics
#index837431
#% 
#!
  
#*Structural Aspects of Ordered Polymatroids.
#@Ulrich Krüger
#t2000
#cDiscrete Applied Mathematics
#index837432
#% 
#!
  
#*Upgrading bottleneck constrained forests.
#@Sven Oliver Krumke,Madhav V. Marathe,Hartmut Noltemeier,S. S. Ravi,Hans-Christoph Wirth
#t2001
#cDiscrete Applied Mathematics
#index837433
#% 
#!
  
#*Cost-Performance Tradeoffs for Interconnection Networks.
#@Clyde P. Kruskal,Marc Snir
#t1992
#cDiscrete Applied Mathematics
#index837434
#% 
#!
  
#*Graphs in Which All Hamiltonian Cycles Have the Same Length.
#@Stanislaw Krynski
#t1994
#cDiscrete Applied Mathematics
#index837435
#% 
#!
  
#*Approximating minimum size {1, 2}-connected network.
#@Piotr Krysta
#t2003
#cDiscrete Applied Mathematics
#index837436
#% 
#!
  
#*Reconstruction of hv-convex binary matrices from their absorbed projections.
#@Attila Kuba,Antal Nagy,Emese Balogh
#t2004
#cDiscrete Applied Mathematics
#index837437
#% 
#!
  
#*Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals.
#@Marek Kubale
#t1997
#cDiscrete Applied Mathematics
#index837438
#% 
#!
  
#*Minimization of ordered, symmetric half-products.
#@Wieslaw Kubiak
#t2005
#cDiscrete Applied Mathematics
#index837439
#%3670
#%209945
#%211265
#%770378
#%837440
#%837308
#%924266
#%950753
#%951514
#%1275161
#%3007117
#!
  
#*New Results on the Completion Time Variance Minimization.
#@Wieslaw Kubiak
#t1995
#cDiscrete Applied Mathematics
#index837440
#% 
#!
  
#*Steiner Intervals in Graphs.
#@Ewa Kubicka,Grzegorz Kubicki,Ortrud Oellermann
#t1998
#cDiscrete Applied Mathematics
#index837441
#% 
#!
  
#*On the size of maximum renamable Horn sub-CNF.
#@Petr Kucera
#t2005
#cDiscrete Applied Mathematics
#index837442
#%836261
#!
  
#*Expected Complexity of Graph Partitioning Problems.
#@Ludek Kucera
#t1995
#cDiscrete Applied Mathematics
#index837443
#% 
#!
  
#*A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions.
#@Ulrich Kühn
#t2001
#cDiscrete Applied Mathematics
#index837444
#% 
#!
  
#*Investigations on autark assignments.
#@Oliver Kullmann
#t2000
#cDiscrete Applied Mathematics
#index837445
#% 
#!
  
#*Lean clause-sets: generalizations of minimally unsatisfiable clause-sets.
#@Oliver Kullmann
#t2003
#cDiscrete Applied Mathematics
#index837446
#%71934
#%104660
#%124250
#%751439
#%751599
#%751854
#%836295
#%836835
#%837445
#%837447
#%838325
#%861073
#%888773
#%930686
#%931286
#%954787
#%954748
#%972760
#%974301
#%1058692
#%1091114
#%1092793
#!
  
#*On a Generalization of Extended Resolution.
#@Oliver Kullmann
#t1999
#cDiscrete Applied Mathematics
#index837447
#% 
#!
  
#*Clique tree generalization and new subclasses of chordal graphs.
#@P. Sreenivasa Kumar,C. E. Veni Madhavan
#t2002
#cDiscrete Applied Mathematics
#index837448
#% 
#!
  
#*Minimal Vertex Separators of Chordal Graphs.
#@P. Sreenivasa Kumar,C. E. Veni Madhavan
#t1998
#cDiscrete Applied Mathematics
#index837449
#% 
#!
  
#*A generalization of the binary Preparata code.
#@Alexey S. Kuzmin,Viktor T. Markov,Alexander A. Nechaev,A. S. Neljubin
#t2006
#cDiscrete Applied Mathematics
#index837450
#%16847
#!
  
#*Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring.
#@Aleksey S. Kuzmin,Aleksandr A. Nechaev
#t2001
#cDiscrete Applied Mathematics
#index837451
#% 
#!
  
#*Complexity of learning in concept lattices from positive and negative examples.
#@Sergei O. Kuznetsov
#t2004
#cDiscrete Applied Mathematics
#index837452
#% 
#!
  
#*Bounds on the Number of Knight's Tours.
#@Olaf Kyek,Ian Parberry,Ingo Wegener
#t1997
#cDiscrete Applied Mathematics
#index837453
#% 
#!
  
#*Open Shop Scheduling with Maximal Machines.
#@George J. Kyparisis,Christos Koulamas
#t1997
#cDiscrete Applied Mathematics
#index837454
#% 
#!
  
#*A minimum broadcast graph on 63 vertices.
#@Roger Labahn
#t1994
#cDiscrete Applied Mathematics
#index837455
#% 
#!
  
#*Periodic gossiping on trees.
#@Roger Labahn,Stephen T. Hedetniemi,Renu Laskar
#t1994
#cDiscrete Applied Mathematics
#index837456
#% 
#!
  
#*Preface.
#@Roger Labahn,Arthur L. Liestman,Erich Prisner
#t2004
#cDiscrete Applied Mathematics
#index837457
#% 
#!
  
#*Periodic Gossiping in Back-to-back Trees.
#@Roger Labahn,André Raspaud
#t1997
#cDiscrete Applied Mathematics
#index837458
#% 
#!
  
#*Preface.
#@Martine Labbé,Gilbert Laporte,Silvano Martello
#t2001
#cDiscrete Applied Mathematics
#index837459
#% 
#!
  
#*On the hardness of the minimum height decision tree problem.
#@Eduardo Sany Laber,Loana Tito Nogueira
#t2004
#cDiscrete Applied Mathematics
#index837460
#%621298
#%861858
#!
  
#*The Copeland Measure of Condorcet Choice Functions.
#@Gilbert Laffond,Jean-François Laslier,Michel Le Breton
#t1994
#cDiscrete Applied Mathematics
#index837461
#% 
#!
  
#*Broadcast and Gossip in Line-communication Mode.
#@Christian Laforest
#t1997
#cDiscrete Applied Mathematics
#index837462
#% 
#!
  
#*The Nonexistence of Reduction Rules Giving an Embedding into a K-tree.
#@Jens Lagergren
#t1994
#cDiscrete Applied Mathematics
#index837463
#% 
#!
  
#*A convolutional-like approach to p-adic codes.
#@N. Lagorce
#t2001
#cDiscrete Applied Mathematics
#index837464
#% 
#!
  
#*Every Matroid Is a Submatroid of a Uniformly Dense Matroid.
#@Hong-Jian Lai,Hongyuan Lai
#t1995
#cDiscrete Applied Mathematics
#index837465
#% 
#!
  
#*On Bandwidth for the Tensor Product of Paths and Cycles.
#@Yung-Ling Lai,Kenneth Williams
#t1997
#cDiscrete Applied Mathematics
#index837466
#% 
#!
  
#*Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem.
#@Ten-Hwang Lai,Shu-Shang Wei
#t1997
#cDiscrete Applied Mathematics
#index837467
#% 
#!
  
#*Families of optimal codes for strong identification.
#@Tero Laihonen,Sanna M. Ranto
#t2002
#cDiscrete Applied Mathematics
#index837468
#%842072
#%846967
#!
  
#*A rounding algorithm for integer programs.
#@Sambhavi Lakshminarayanan,R. Chandrasekaran
#t1994
#cDiscrete Applied Mathematics
#index837469
#% 
#!
  
#*Algebraic structure of quasicyclic codes.
#@Kristine Lally,Patrick Fitzpatrick
#t2001
#cDiscrete Applied Mathematics
#index837470
#% 
#!
  
#*On the equitable chromatic number of complete n-partite graphs.
#@Peter Che Bor Lam,Wai Chee Shiu,Chong Sze Tong,Zhongfu Zhang
#t2001
#cDiscrete Applied Mathematics
#index837471
#% 
#!
  
#*Selecting the k largest elements with parity tests.
#@Tak Wah Lam,Hing-Fung Ting
#t2000
#cDiscrete Applied Mathematics
#index837472
#% 
#!
  
#*Edge Ranking of Graphs Is Hard.
#@Tak Wah Lam,Fung Ling Yue
#t1998
#cDiscrete Applied Mathematics
#index837473
#% 
#!
  
#*Efficient Optimal Equation Formulation in Lumped Power-conserving Systems.
#@John D. Lamb
#t1998
#cDiscrete Applied Mathematics
#index837474
#% 
#!
  
#*Bond Graphs III: Bond Graphs and Electrical Networks.
#@John D. Lamb,Gregory M. Asher,Douglas R. Woodall
#t1997
#cDiscrete Applied Mathematics
#index837475
#% 
#!
  
#*Bond Graphs I: Acausal Equivalence.
#@John D. Lamb,Douglas R. Woodall,Gregory M. Asher
#t1997
#cDiscrete Applied Mathematics
#index837476
#% 
#!
  
#*Bond Graphs II: Causality and Singularity.
#@John D. Lamb,Douglas R. Woodall,Gregory M. Asher
#t1997
#cDiscrete Applied Mathematics
#index837477
#% 
#!
  
#*Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques.
#@Giuseppe Lancia,Mark Perlin
#t1998
#cDiscrete Applied Mathematics
#index837478
#% 
#!
  
#*Interpolation of the Discrete Logarithm in F by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1.
#@Tanja Lange,Arne Winterhof
#t2003
#cDiscrete Applied Mathematics
#index837479
#% 
#!
  
#*A Recognition Algorithm for orders of Interval Dimension Two.
#@Larry J. Langley
#t1995
#cDiscrete Applied Mathematics
#index837480
#% 
#!
  
#*Irreflexive and Reflexive Dimension.
#@Larry J. Langley
#t1995
#cDiscrete Applied Mathematics
#index837481
#% 
#!
  
#*Clique divergent clockwork graphs and partial orders.
#@Francisco Larrión,Victor Neumann-Lara,Miguel A. Pizaña
#t2004
#cDiscrete Applied Mathematics
#index837482
#%848294
#%848726
#%851769
#%853325
#!
  
#*A class of heuristics for the constrained forest problem.
#@Michael Laszlo,Sumitra Mukherjee
#t2006
#cDiscrete Applied Mathematics
#index837483
#%361202
#%836506
#!
  
#*Update schedules of sequential dynamical systems.
#@Reinhard Laubenbacher,Bodo Pareigis
#t2006
#cDiscrete Applied Mathematics
#index837484
#%1148092
#!
  
#*Further combinatorial identities deriving from the th power of a 2×2 matrix.
#@James Mc Laughlin,Nancy J. Wyshinski
#t2006
#cDiscrete Applied Mathematics
#index837485
#% 
#!
  
#*On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects.
#@Warwick de Launey
#t2000
#cDiscrete Applied Mathematics
#index837486
#% 
#!
  
#*Cocyclic Hadamard matrices and difference sets.
#@Warwick de Launey,D. L. Flannery,Kathy J. Horadam
#t2000
#cDiscrete Applied Mathematics
#index837487
#% 
#!
  
#*On cocyclic weighing matrices and the regular group actions of certain paley matrices.
#@Warwick de Launey,Richard M. Stafford
#t2000
#cDiscrete Applied Mathematics
#index837488
#% 
#!
  
#*Locking Based on a Pairwise Decomposition of the Transaction System.
#@Georg Lausen
#t1992
#cDiscrete Applied Mathematics
#index837489
#% 
#!
  
#*Bounds for isoperimetric constants of infinite plane graphs.
#@Serge Lawrencenko,Michael D. Plummer,Xiaoya Zha
#t2001
#cDiscrete Applied Mathematics
#index837490
#% 
#!
  
#*Broadcasting in DMA-Bound Bounded Degree Graphs.
#@Emmanuel Lazard
#t1992
#cDiscrete Applied Mathematics
#index837491
#% 
#!
  
#*Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size.
#@Felix Lazebnik,Vasiliy A. Ustimenko
#t1995
#cDiscrete Applied Mathematics
#index837492
#% 
#!
  
#*Splitting a graph into disjoint induced paths or cycles.
#@Hoàng-Oanh Le,Van Bang Le,Haiko Müller
#t2003
#cDiscrete Applied Mathematics
#index837493
#%224689
#%225138
#%836195
#%887537
#%952621
#%1058651
#!
  
#*Finding Degeneracies Among Sets of Lines.
#@Alain Leblanc
#t1995
#cDiscrete Applied Mathematics
#index837494
#% 
#!
  
#*Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter.
#@Uwe Leck,Volker Leck
#t1999
#cDiscrete Applied Mathematics
#index837495
#% 
#!
  
#*The Median Procedure in the Semilattice of Orders.
#@Bruno Leclerc
#t2003
#cDiscrete Applied Mathematics
#index837496
#%837497
#%852154
#%853585
#!
  
#*Medians for Weight Metrics in the Covering Graphs of Semilattices.
#@Bruno Leclerc
#t1994
#cDiscrete Applied Mathematics
#index837497
#% 
#!
  
#*Distance-hereditary graphs are clique-perfect.
#@Chuan-Min Lee,Maw-Shang Chang
#t2006
#cDiscrete Applied Mathematics
#index837498
#%415309
#%660375
#%836381
#%836522
#%839425
#%850548
#%851608
#%852828
#%852882
#%853419
#%854031
#%929848
#%971764
#%974454
#%976986
#%1025659
#%1061166
#!
  
#*Set to Set Broadcasting in Communication Networks.
#@Hsun-Ming Lee,Gerard J. Chang
#t1992
#cDiscrete Applied Mathematics
#index837499
#% 
#!
  
#*A note on "parallel machine scheduling with non-simultaneous machine available time".
#@Chung-Yee Lee,Yong He,Guochun Tang
#t2000
#cDiscrete Applied Mathematics
#index837500
#% 
#!
  
#*Some combinatorial identities via Fibonacci numbers.
#@Gwang-Yeon Lee,Jin-Soo Kim,Seong-Hoon Cho
#t2003
#cDiscrete Applied Mathematics
#index837501
#%839200
#!
  
#*Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times.
#@Chung-Yee Lee,Surya Danusaputro Liman
#t1993
#cDiscrete Applied Mathematics
#index837502
#% 
#!
  
#*On the Fixed Interval Due-date Scheduling Problem.
#@Chung-Yee Lee,Chung-Lun Li
#t1996
#cDiscrete Applied Mathematics
#index837503
#% 
#!
  
#*Geometric Comparison of Combinatorial Polytopes.
#@Jon Lee,Walter D. Morris Jr.
#t1994
#cDiscrete Applied Mathematics
#index837504
#% 
#!
  
#*A Note on Graphs with Large Girth, Small Minus Domination Number.
#@Jaeun Lee,Moo Young Sohn,Kyung Kim Hye
#t1999
#cDiscrete Applied Mathematics
#index837505
#% 
#!
  
#*Transmission schedules for hypercube interconnection in WDM optical passive star networks.
#@Sang Kyu Lee,A. Duksu Oh,Hyeong-Ah Choi
#t2002
#cDiscrete Applied Mathematics
#index837506
#% 
#!
  
#*Optimal Transmission Schedules in TWDM Optical Passive Star Networks.
#@Sang Kyu Lee,A. Duksu Oh,Hongsik Choi,Hyeong-Ah Choi
#t1997
#cDiscrete Applied Mathematics
#index837507
#% 
#!
  
#*Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph.
#@Mahnhoon Lee,Sridhar Radhakrishnan
#t2005
#cDiscrete Applied Mathematics
#index837508
#%147
#%660486
#%1058926
#!
  
#*The achromatic number of the union of cycles.
#@Jaeun Lee,Young-hee Shin
#t2004
#cDiscrete Applied Mathematics
#index837509
#%848455
#!
  
#*Polyhedral methods for piecewise-linear functions I: the lambda method.
#@Jon Lee,Dan Wilson
#t2001
#cDiscrete Applied Mathematics
#index837510
#% 
#!
  
#*Rectilinear Paths Among Rectilinear Obstacles.
#@D. T. Lee,Chung-Do Yang,C. K. Wong
#t1996
#cDiscrete Applied Mathematics
#index837511
#% 
#!
  
#*Graphs with Largest Number of Minimum Cuts.
#@Jenö Lehel,Frédéric Maffray,Myriam Preissmann
#t1996
#cDiscrete Applied Mathematics
#index837512
#% 
#!
  
#*Additive Similarity Measures.
#@Lutz Leischner
#t2003
#cDiscrete Applied Mathematics
#index837513
#% 
#!
  
#*Linking Discrete Orthogonality with Dilation and Translation for Incomplete Sigma-pi Neural Networks of Hopfield-type.
#@Burkhard Lenze
#t1998
#cDiscrete Applied Mathematics
#index837514
#% 
#!
  
#*Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality".
#@Valeria A. Leoni,Graciela L. Nasini
#t2005
#cDiscrete Applied Mathematics
#index837515
#%835879
#%1013075
#!
  
#*More facets from fences for linear ordering and acyclic subgraph polytopes.
#@Janny Leung,Jon Lee
#t1994
#cDiscrete Applied Mathematics
#index837516
#% 
#!
  
#*Minimizing the Weighted Number of Tardy Task Units.
#@Joseph Y.-T. Leung,Vincent K. M. Yu,W.-D. Wei
#t1994
#cDiscrete Applied Mathematics
#index837517
#% 
#!
  
#*Uniformly bounded duplication languages.
#@Peter Leupold,Carlos Martín-Vide,Victor Mitrana
#t2005
#cDiscrete Applied Mathematics
#index837518
#%742124
#%742041
#!
  
#*Matching Parentheses in Parallel.
#@Christos Levcopoulos,Ola Petersson
#t1992
#cDiscrete Applied Mathematics
#index837519
#% 
#!
  
#*A new Greedoid: the family of local maximum stable sets of a forest.
#@Vadim E. Levit,Eugen Mandrescu
#t2002
#cDiscrete Applied Mathematics
#index837520
#%837002
#!
  
#*Combinatorial properties of the family of maximum stable sets of a graph.
#@Vadim E. Levit,Eugen Mandrescu
#t2002
#cDiscrete Applied Mathematics
#index837521
#% 
#!
  
#*Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings.
#@Vadim E. Levit,Eugen Mandrescu
#t2003
#cDiscrete Applied Mathematics
#index837522
#%837520
#%950770
#!
  
#*A Parametric Critical Path Problem and an Application for Cyclic Scheduling.
#@Eugene Levner,Vladimir Kats
#t1998
#cDiscrete Applied Mathematics
#index837523
#% 
#!
  
#*Pancyclicity and NP-completeness in Planar Graphs.
#@Ming-Chu Li,Derek G. Corneil,Eric Mendelsohn
#t2000
#cDiscrete Applied Mathematics
#index837524
#% 
#!
  
#*A Unified Approach to the First Derivatives of Graph Polynomials.
#@Xueliang Li,Ivan Gutman
#t1995
#cDiscrete Applied Mathematics
#index837525
#% 
#!
  
#*On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance.
#@Simon Litsyn,Patrick Solé,René Struik
#t1998
#cDiscrete Applied Mathematics
#index837526
#% 
#!
  
#*Minimizing makespan with release times on identical parallel batching machines.
#@Shuguang Li,Guojun Li,Shaoqiang Zhang
#t2005
#cDiscrete Applied Mathematics
#index837527
#%209818
#!
  
#*Recent advances on two-dimensional bin packing problems.
#@Andrea Lodi,Silvano Martello,Daniele Vigo
#t2002
#cDiscrete Applied Mathematics
#index837528
#%550124
#%624113
#%836593
#%1013161
#%1060492
#%1275185
#!
  
#*Limits of theory sequences over algebraically closed fields and applications.
#@Wei Li,Shilong Ma
#t2004
#cDiscrete Applied Mathematics
#index837529
#%186068
#%188801
#%449044
#%484433
#%626393
#%745201
#%949734
#%950076
#%951454
#%954671
#%994714
#!
  
#*Exact enumeration of acyclic deterministic automata.
#@Valery A. Liskovets
#t2006
#cDiscrete Applied Mathematics
#index837530
#%797214
#%816770
#%953793
#%1094218
#%3229880
#!
  
#*Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers.
#@Guiqing Li,Wenlong Su,Haipeng Luo
#t2003
#cDiscrete Applied Mathematics
#index837531
#% 
#!
  
#*Coset Correlation of LR m-Arrays.
#@Mulan Liu,Zunquan Li
#t1993
#cDiscrete Applied Mathematics
#index837532
#% 
#!
  
#*A degree condition of 2-factors in bipartite graphs.
#@Xiangwen Li,Bing Wei,Fan Yang
#t2001
#cDiscrete Applied Mathematics
#index837533
#% 
#!
  
#*Neighborhood unions and cyclability of graphs.
#@Huiqing Liu,Mei Lu,FengFeng Tian
#t2004
#cDiscrete Applied Mathematics
#index837534
#%975599
#!
  
#*The Infinite Families of Optimal Double Loop Networks.
#@Q. Li,Jun Ming Xu,Z. L. Zhang
#t1993
#cDiscrete Applied Mathematics
#index837535
#% 
#!
  
#*Fun with algorithms.
#@Elena Lodi,Linda Pagli,Nicola Santoro
#t2004
#cDiscrete Applied Mathematics
#index837536
#% 
#!
  
#*Hamiltonicity of a Type of Interchange Graphs.
#@Xueliang Li,Fuji Zhang
#t1994
#cDiscrete Applied Mathematics
#index837537
#% 
#!
  
#*Trees of extremal connectivity index.
#@Huiqing Liu,Mei Lu,Feng Tian
#t2006
#cDiscrete Applied Mathematics
#index837538
#%968161
#!
  
#*Finding the k most vital edges with respect to minimum spanning trees for fixed k.
#@Weifa Liang
#t2001
#cDiscrete Applied Mathematics
#index837539
#% 
#!
  
#*Irreducible Polynomials and Linear Recurring Arrays.
#@Mulan Liu,Gary L. Mullen
#t1997
#cDiscrete Applied Mathematics
#index837540
#% 
#!
  
#*Parallel Algorithms for the Domination Problems in Trapezoid Graphs.
#@Y. Daniel Liang
#t1997
#cDiscrete Applied Mathematics
#index837541
#% 
#!
  
#*A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid.
#@Yanpei Liu,Aurora Morgana,Bruno Simeone
#t1998
#cDiscrete Applied Mathematics
#index837542
#% 
#!
  
#*Automated estimation of the parameters of Gibbs priors to be used in binary tomography.
#@Hstau Y. Liao,Gabor T. Herman
#t2004
#cDiscrete Applied Mathematics
#index837543
#%852107
#%1031180
#%1032530
#%3077335
#!
  
#*Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates.
#@Zhen Liu,Eric Sanlaville
#t1995
#cDiscrete Applied Mathematics
#index837544
#% 
#!
  
#*A coordinate ascent approach to tomographic reconstruction of label images from a few projections.
#@Hstau Y. Liao,Gabor T. Herman
#t2005
#cDiscrete Applied Mathematics
#index837545
#%834408
#%834476
#%837543
#%1031894
#!
  
#*Generating Lower Bounds for the Linear Arrangement Problem.
#@Weiguo Liu,Anthony Vannelli
#t1995
#cDiscrete Applied Mathematics
#index837546
#% 
#!
  
#*Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions.
#@Marek Libura,Edo S. Van der Poort,Gerard Sierksma,Jack A. A. van der Veen
#t1998
#cDiscrete Applied Mathematics
#index837547
#% 
#!
  
#*Phorma: perfectly hashable order restricted multidimensional arrays.
#@Lauro Lins,Sóstenes Lins,Silvio Melo
#t2004
#cDiscrete Applied Mathematics
#index837548
#%193
#%2022
#!
  
#*A Note on Biased and Non-biased Games.
#@Xiaoyun Lu
#t1995
#cDiscrete Applied Mathematics
#index837549
#% 
#!
  
#*Broadcast time and connectivity.
#@Nicolas Lichiardopol
#t2004
#cDiscrete Applied Mathematics
#index837550
#% 
#!
  
#*Scheduling one batch processor subject to job release dates.
#@Zhaohui Liu,Wenci Yu
#t2000
#cDiscrete Applied Mathematics
#index837551
#% 
#!
  
#*Minimum Broadcast Digraphs.
#@Arthur L. Liestman,Joseph G. Peters
#t1992
#cDiscrete Applied Mathematics
#index837552
#% 
#!
  
#*An Optimal Parallel Algorithm for Node Ranking of Cographs.
#@Chuan-Ming Liu,Ming-Shing Yu
#t1998
#cDiscrete Applied Mathematics
#index837553
#% 
#!
  
#*Degree-constrained Spanners for Multidimensional Grids.
#@Arthur L. Liestman,Thomas C. Shermer,Christopher R. Stolte
#t1996
#cDiscrete Applied Mathematics
#index837554
#% 
#!
  
#*Some Problems on Factorizations with Constraints in Bipartite Graphs.
#@Guizhen Liu,Binhai Zhu
#t2003
#cDiscrete Applied Mathematics
#index837555
#%416030
#%852317
#%953080
#!
  
#*On an interpolation property of outerplanar graphs.
#@Ko-Wei Lih,Chen-Ying Lin,Li-Da Tong
#t2006
#cDiscrete Applied Mathematics
#index837556
#%851607
#%852884
#%854590
#%975596
#!
  
#*f-Factors in bipartite (mf)-graphs.
#@Guizhen Liu,Wenan Zang
#t2004
#cDiscrete Applied Mathematics
#index837557
#% 
#!
  
#*Edge-pancyclicity of coupled graphs.
#@Ko-Wei Lih,Zengmin Song,Wei-Fan Wang,Kemin Zhang
#t2002
#cDiscrete Applied Mathematics
#index837558
#% 
#!
  
#*Searching for two counterfeit coins with two-arms balance.
#@Wen An Liu,Wei-Guo Zhang,Zan Kan Nie
#t2005
#cDiscrete Applied Mathematics
#index837559
#%836223
#%836225
#%838244
#%839245
#%839248
#%854457
#%930705
#%931793
#%972334
#%1058321
#%1059091
#%1061168
#%1061561
#!
  
#*Embedding Trees in Recursive Circulants.
#@Hyeong-Seok Lim,Jung-Heum Park,Kyung-Yong Chwa
#t1996
#cDiscrete Applied Mathematics
#index837560
#% 
#!
  
#*A 3D 12-subiteration thinning algorithm based on P-simple points.
#@Christophe Lohou,Gilles Bertrand
#t2004
#cDiscrete Applied Mathematics
#index837561
#% 
#!
  
#*On the computational complexity of edge concentration.
#@Xuemin Lin
#t2000
#cDiscrete Applied Mathematics
#index837562
#% 
#!
  
#*A 3D 6-subiteration curve thinning algorithm based on -simple points.
#@Christophe Lohou,Gilles Bertrand
#t2005
#cDiscrete Applied Mathematics
#index837563
#% 
#!
  
#*The Exact Bound of Lee's MLPT.
#@Guo-Hui Lin
#t1998
#cDiscrete Applied Mathematics
#index837564
#% 
#!
  
#*Searching for a counterfeit coin with two unreliable weighings.
#@Wen An Liu,Qi-Min Zhang,Zan Kan Nie
#t2005
#cDiscrete Applied Mathematics
#index837565
#%835890
#%836223
#%836225
#%838244
#%839245
#%839248
#%847421
#%853516
#%854457
#%930705
#%931793
#%939915
#%976067
#%977347
#%977433
#%1058321
#%1093958
#!
  
#*The Equivalence Classes of LR Arrays.
#@Dongdai Lin,Mulan Liu
#t1993
#cDiscrete Applied Mathematics
#index837566
#% 
#!
  
#*Preface.
#@Donna Crystal Llewellyn
#t1993
#cDiscrete Applied Mathematics
#index837567
#% 
#!
  
#*Expansion of layouts of complete binary trees into grids.
#@Y.-B. Lin,Zevi Miller,Manley Perkel,Dan Pritikin,Ivan Hal Sudborough
#t2003
#cDiscrete Applied Mathematics
#index837568
#%2583
#%224772
#%660768
#%837858
#%930024
#%931469
#%1079440
#!
  
#*A Primal Dual Integer Programming Algorithm.
#@Donna Crystal Llewellyn,Jennifer Ryan
#t1993
#cDiscrete Applied Mathematics
#index837569
#% 
#!
  
#*A Fast Parallel Algorithm to Recognize P4-sparse Graphs.
#@Rong Lin,Stephan Olariu
#t1998
#cDiscrete Applied Mathematics
#index837570
#% 
#!
  
#*Dividing and Conquering the Square.
#@Donna Crystal Llewellyn,Craig A. Tovey
#t1993
#cDiscrete Applied Mathematics
#index837571
#% 
#!
  
#*Optimal algorithms for constructing knight's tours on arbitrary ? chessboards.
#@Shun-Shii Lin,Chung-Liang Wei
#t2005
#cDiscrete Applied Mathematics
#index837572
#% 
#!
  
#*Erratum: Local Optimization on Graphs.
#@Donna Crystal Llewellyn,Craig A. Tovey,Michael A. Trick
#t1993
#cDiscrete Applied Mathematics
#index837573
#% 
#!
  
#*Several parameters of generalized Mycielskians.
#@Wensong Lin,Jianzhuan Wu,Peter Che Bor Lam,Guohua Gu
#t2006
#cDiscrete Applied Mathematics
#index837574
#%797884
#%836800
#%847198
#%849138
#%851546
#%976831
#%1144324
#%3480206
#%3480283
#!
  
#*Balance, Uncorrelatedness and the Strict Avalanche Criterion.
#@Sheelagh Lloyd
#t1993
#cDiscrete Applied Mathematics
#index837575
#% 
#!
  
#*Surface digitizations by dilations which are tunnel-free.
#@Christoph Lincke,Charles A. Wüthrich
#t2003
#cDiscrete Applied Mathematics
#index837576
#%834111
#%834104
#%833834
#%834985
#!
  
#*Packing equal circles in a square: a deterministic global optimization approach.
#@Marco Locatelli,Ulrich Raber
#t2002
#cDiscrete Applied Mathematics
#index837577
#%853858
#!
  
#*An explicit class of codes with good parameters and their duals.
#@San Ling,Chaoping Xing,Ferruh Özbudak
#t2006
#cDiscrete Applied Mathematics
#index837578
#%993507
#!
  
#*Preface.
#@Mario Lucertini,Giovanni Rinaldi,Antonio Sassano,Bruno Simeone
#t1995
#cDiscrete Applied Mathematics
#index837579
#% 
#!
  
#*Strongly Prime PCP Words.
#@Marjo Lipponen,Gheorghe Paun
#t1995
#cDiscrete Applied Mathematics
#index837580
#% 
#!
  
#*Existence of whist tournaments with the three-person property 3PWh(v).
#@Y. Lu,Zhang Shengyuan
#t2000
#cDiscrete Applied Mathematics
#index837581
#% 
#!
  
#*Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors.
#@Luigi Lombardi,Iven Van Mechelen
#t2005
#cDiscrete Applied Mathematics
#index837582
#%852893
#!
  
#*On the Complexity of Some Edge-partition Problems for Graphs.
#@Zbigniew Lonc
#t1996
#cDiscrete Applied Mathematics
#index837583
#% 
#!
  
#*k-p-Infix codes and semaphore codes.
#@Dongyang Long,Weijia Jia,Jian Ma,Duanning Zhou
#t2001
#cDiscrete Applied Mathematics
#index837584
#% 
#!
  
#*Circular Permutation Graph Family with Applications.
#@Ruey-Der Lou,Majid Sarrafzadeh
#t1992
#cDiscrete Applied Mathematics
#index837585
#% 
#!
  
#*Connectivity of k-extendable graphs with large k.
#@Dingjun Lou,Qinglin Yu
#t2004
#cDiscrete Applied Mathematics
#index837586
#% 
#!
  
#*Independent sets in extensions of 2-free graphs.
#@Vadim V. Lozin,Raffaele Mosca
#t2005
#cDiscrete Applied Mathematics
#index837587
#% 
#!
  
#*Special issue on stability in graphs and related topics.
#@Vadim V. Lozin,Dominique de Werra
#t2003
#cDiscrete Applied Mathematics
#index837588
#% 
#!
  
#*Perfect edge domination and efficient edge domination in graphs.
#@Chin Lung Lu,Ming-Tat Ko,Chuan Yi Tang
#t2002
#cDiscrete Applied Mathematics
#index837589
#%836380
#%836387
#%837392
#%837591
#%838349
#%931480
#%933965
#!
  
#*Weighted efficient domination problem on some perfect graphs.
#@Chin Lung Lu,Chuan Yi Tang
#t2002
#cDiscrete Applied Mathematics
#index837590
#% 
#!
  
#*Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs.
#@Chin Lung Lu,Chuan Yi Tang
#t1998
#cDiscrete Applied Mathematics
#index837591
#% 
#!
  
#*On (d, 2)-dominating numbers of binary undirected de Bruijn graphs.
#@Changhong Lu,Juming Xu,Kemin Zhang
#t2000
#cDiscrete Applied Mathematics
#index837592
#% 
#!
  
#*Cycles of length 1 modulo 3 in graph.
#@Mei Lu,Zhengguang Yu
#t2001
#cDiscrete Applied Mathematics
#index837593
#% 
#!
  
#*Strong lower bounds for the prize collecting Steiner problem in graphs.
#@Abilio Lucena,Mauricio G. C. Resende
#t2004
#cDiscrete Applied Mathematics
#index837594
#%610807
#%1013384
#%1013703
#%1014019
#%3612060
#!
  
#*Most Uniform Path Partitioning and its Use in Image Processing.
#@Mario Lucertini,Yehoshua Perl,Bruno Simeone
#t1993
#cDiscrete Applied Mathematics
#index837595
#% 
#!
  
#*Dynamic Behavior of Cyclic Automata Networks.
#@Martín Matamala,Eric Goles Ch.
#t1997
#cDiscrete Applied Mathematics
#index837596
#% 
#!
  
#*Optimal arrangement of data in a tree directory.
#@Malwina J. Luczak,Steven D. Noble
#t2001
#cDiscrete Applied Mathematics
#index837597
#% 
#!
  
#*Simple Splicing Systems.
#@Alexandru Mateescu,Gheorghe Paun,Grzegorz Rozenberg,Arto Salomaa
#t1998
#cDiscrete Applied Mathematics
#index837598
#% 
#!
  
#*Optimal arrangement of data in a tree directory.
#@Malwina J. Luczak,Steven D. Noble
#t2002
#cDiscrete Applied Mathematics
#index837599
#%974669
#!
  
#*The Minimum Spanning Tree Problem on a Planar Graph.
#@Tomomi Matsui
#t1995
#cDiscrete Applied Mathematics
#index837600
#% 
#!
  
#*A bijection for the total area of parallelogram polyominoes.
#@Alberto Del Lungo,Maurice Nivat,Renzo Pinzani,Simone Rinaldi
#t2004
#cDiscrete Applied Mathematics
#index837601
#% 
#!
  
#*Adjacency on Combinatorial Polyhedra.
#@Tomomi Matsui,Sunao Tamura
#t1995
#cDiscrete Applied Mathematics
#index837602
#% 
#!
  
#*Preface.
#@Hans van Maaren
#t2003
#cDiscrete Applied Mathematics
#index837603
#% 
#!
  
#*Algorithms for finding a Kth best valued assignment.
#@Tomomi Matsui,Akihisa Tamura,Yoshiko Ikebe
#t1994
#cDiscrete Applied Mathematics
#index837604
#% 
#!
  
#*Elliptic Approximations of Propositional Formulae.
#@Hans van Maaren
#t1999
#cDiscrete Applied Mathematics
#index837605
#% 
#!
  
#*Secure multi-party computation made simple.
#@Ueli M. Maurer
#t2006
#cDiscrete Applied Mathematics
#index837606
#%50884
#%120000
#%120018
#%544079
#%653833
#%1059169
#%1123702
#!
  
#*Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT.
#@Hans van Maaren,Joost P. Warners
#t2000
#cDiscrete Applied Mathematics
#index837607
#% 
#!
  
#*Perfect 7-cycle systems.
#@Enzo Maria Li Marzi
#t2003
#cDiscrete Applied Mathematics
#index837608
#% 
#!
  
#*A Relation Between the Knapsack, Group Knapsack Problems.
#@Zhu Nan
#t1998
#cDiscrete Applied Mathematics
#index837609
#% 
#!
  
#*Generalized Partitions of Graphs.
#@Gary MacGilivray,Min-Li Yu
#t1999
#cDiscrete Applied Mathematics
#index837610
#% 
#!
  
#*All-to-all Personalized Communication on Multistage Interconnection Networks.
#@Annalisa Massini
#t2003
#cDiscrete Applied Mathematics
#index837611
#%341790
#%344399
#%344558
#%411316
#%929960
#%1079924
#%1125854
#%1125929
#%1126090
#%1126088
#%1125927
#!
  
#*Reconstruction of Rooted Trees From Subtrees.
#@Meei Pyng Ng,Nicholas C. Wormald
#t1996
#cDiscrete Applied Mathematics
#index837612
#% 
#!
  
#*Graph Homomorphisms with Infinite Targets.
#@Gary MacGillivray
#t1994
#cDiscrete Applied Mathematics
#index837613
#% 
#!
  
#*Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs.
#@Ueli M. Maurer
#t1992
#cDiscrete Applied Mathematics
#index837614
#% 
#!
  
#*The Combinations of Resistances.
#@P. A. Macmahon
#t1994
#cDiscrete Applied Mathematics
#index837615
#% 
#!
  
#*A New Exact Algorithm for the Solution of Quadratic Assignment Problems.
#@Thierry Mautor,Catherine Roucairol
#t1994
#cDiscrete Applied Mathematics
#index837616
#% 
#!
  
#*Error-correcting Nonadaptive Group Testing with d-disjunct Matrices.
#@Anthony J. Macula
#t1997
#cDiscrete Applied Mathematics
#index837617
#% 
#!
  
#*Inducing an Order on Cellular Automata by a Grouping Operation.
#@Jacques Mazoyer,Ivan Rapaport
#t1999
#cDiscrete Applied Mathematics
#index837618
#% 
#!
  
#*A group testing method for finding patterns in data.
#@Anthony J. Macula,Leonard J. Popyack
#t2004
#cDiscrete Applied Mathematics
#index837619
#%2067
#%302628
#%304018
#%978084
#!
  
#*A Lower Bound for Tree Resolution.
#@David J. McClurkin
#t1994
#cDiscrete Applied Mathematics
#index837620
#% 
#!
  
#*Trivial two-stage group testing for complexes using almost disjunct matrices.
#@Anthony J. Macula,Vyacheslav V. Rykov,Sergey Yekhanin
#t2004
#cDiscrete Applied Mathematics
#index837621
#% 
#!
  
#*Linear-time modular decomposition of directed graphs.
#@Ross M. McConnell,Fabien de Montgolfier
#t2005
#cDiscrete Applied Mathematics
#index837622
#%70760
#%611111
#%837741
#%851455
#%952832
#%952833
#%1060205
#%1090851
#%1090854
#!
  
#*Morphisms and Almost-periodicity.
#@Arnaud Maes
#t1998
#cDiscrete Applied Mathematics
#index837623
#% 
#!
  
#*Computing Maximum Mean Cuts.
#@S. Thomas McCormick,Thomas R. Ervolina
#t1994
#cDiscrete Applied Mathematics
#index837624
#% 
#!
  
#*In Memoriam Paolo M. Camerini.
#@Francesco Maffioli
#t1993
#cDiscrete Applied Mathematics
#index837625
#% 
#!
  
#*A Doubly Cyclic Channel Assignment Problem.
#@Colin McDiarmid
#t1997
#cDiscrete Applied Mathematics
#index837626
#% 
#!
  
#*Linear Recognition of Pseudo-split Graphs.
#@Frédéric Maffray,Myriam Preissmann
#t1994
#cDiscrete Applied Mathematics
#index837627
#% 
#!
  
#*Pattern Minimisation in Cutting Stock Problems.
#@Colin McDiarmid
#t1999
#cDiscrete Applied Mathematics
#index837628
#% 
#!
  
#*Sequential Colorings and Perfect Graphs.
#@Frédéric Maffray,Myriam Preissmann
#t1999
#cDiscrete Applied Mathematics
#index837629
#% 
#!
  
#*Chordally signed graphs.
#@Terry A. McKee
#t2002
#cDiscrete Applied Mathematics
#index837630
#%837130
#%852321
#!
  
#*Amenable Colorings.
#@Nadimpalli V. R. Mahadev,Fred S. Roberts
#t1997
#cDiscrete Applied Mathematics
#index837631
#% 
#!
  
#*The Expected Number of Symmetries in Locally Restricted Trees II.
#@Kathleen A. McKeon
#t1996
#cDiscrete Applied Mathematics
#index837632
#% 
#!
  
#*Regularity and Locality in K-terminal Graphs.
#@Sanjeev Mahajan,Joseph G. Peters
#t1994
#cDiscrete Applied Mathematics
#index837633
#% 
#!
  
#*Multi-source spanning trees: algorithms for minimizing source eccentricities.
#@H. Brendan McMahan,Andrzej Proskurowski
#t2004
#cDiscrete Applied Mathematics
#index837634
#%2022
#%838300
#%1061754
#!
  
#*The combinatorial approach yields an algorithm for computing Pfaffians.
#@Meena Mahajan,P. R. Subramanya,V. Vinay
#t2004
#cDiscrete Applied Mathematics
#index837635
#% 
#!
  
#*The median function on median graphs and semilattices.
#@Fred R. McMorris,Henry Martyn Mulder,Robert C. Powers
#t2000
#cDiscrete Applied Mathematics
#index837636
#% 
#!
  
#*On the computational complexity of strong edge coloring.
#@Mohammad Mahdian
#t2002
#cDiscrete Applied Mathematics
#index837637
#% 
#!
  
#*The Median Function on Distributive Semilattices.
#@Fred R. McMorris,Henry Martyn Mulder,Robert C. Powers
#t2003
#cDiscrete Applied Mathematics
#index837638
#%837497
#%837636
#%837640
#%853585
#%1061711
#!
  
#*Some minimum broadcast graphs.
#@Maryvonne Mahéo,Jean-François Saclé
#t1994
#cDiscrete Applied Mathematics
#index837639
#% 
#!
  
#*The Median Procedure on Median Graphs.
#@Fred R. McMorris,Henry Martyn Mulder,Fred S. Roberts
#t1998
#cDiscrete Applied Mathematics
#index837640
#% 
#!
  
#*Note on the problem of gossiping in multidimensional grids.
#@Maryvonne Mahéo,Jean-François Saclé
#t1994
#cDiscrete Applied Mathematics
#index837641
#% 
#!
  
#*Consensus Functions on Trees that Satisfy Independence Axiom.
#@Fred R. McMorris,Robert C. Powers
#t1993
#cDiscrete Applied Mathematics
#index837642
#% 
#!
  
#*A Min-max Relation for K-covers in Graphs Noncontractible to Ke.
#@Ali Ridha Mahjoub
#t1995
#cDiscrete Applied Mathematics
#index837643
#% 
#!
  
#*On Probe Interval Graphs.
#@Fred R. McMorris,Chi Wang,Peisen Zhang
#t1998
#cDiscrete Applied Mathematics
#index837644
#% 
#!
  
#*On the Linear Relaxation of the 2-node Connected Subgraph Polytope.
#@Ali Ridha Mahjoub,Charles Nocq
#t1999
#cDiscrete Applied Mathematics
#index837645
#% 
#!
  
#*Cardinality Constrained Boolean Quadratic Polytope.
#@Anuj Mehrotra
#t1997
#cDiscrete Applied Mathematics
#index837646
#% 
#!
  
#*The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension.
#@Vitaly Maiorov,Joel Ratsaby
#t1998
#cDiscrete Applied Mathematics
#index837647
#% 
#!
  
#*On the Consecutive Ones Property.
#@Joao Meidanis,Oscar Porto,Guilherme P. Telles
#t1998
#cDiscrete Applied Mathematics
#index837648
#% 
#!
  
#*A Maiorana-McFarland type construction for resilient Boolean functions on variables ( even) with nonlinearity >2-2+2.
#@Subhamoy Maitra,Enes Pasalic
#t2006
#cDiscrete Applied Mathematics
#index837649
#%50835
#%119766
#%119790
#%193423
#%217327
#%327378
#%399366
#%570401
#%3255771
#%3255629
#%399390
#!
  
#*Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs.
#@Daniel Meister
#t2005
#cDiscrete Applied Mathematics
#index837650
#%525
#%186325
#%610043
#%610994
#%624102
#%660475
#%660599
#%836101
#%836507
#%836546
#%836819
#%837122
#%837719
#%837785
#%851455
#%930689
#%931133
#%933207
#%933250
#%951800
#%1058966
#%1059009
#%1059834
#%1059709
#%1060205
#%1061230
#%1061595
#%1061818
#%1089427
#%1091696
#!
  
#*Distances Between Traveling Salesman Tours.
#@King-Tim Mak,Andrew J. Morton
#t1995
#cDiscrete Applied Mathematics
#index837651
#% 
#!
  
#*Covering a Rectangle with Six and Seven Circles.
#@Jan B. M. Melissen,P. C. Schuur
#t2000
#cDiscrete Applied Mathematics
#index837652
#% 
#!
  
#*On the structure of connected locally GQ(3, 9)-graphs.
#@A. A. Makhnev,D. V. Paduchikh
#t2004
#cDiscrete Applied Mathematics
#index837653
#% 
#!
  
#*A Note on Approximate Inclusion-exclusion.
#@Avraham A. Melkman,Solomon Eyal Shimony
#t1997
#cDiscrete Applied Mathematics
#index837654
#% 
#!
  
#*Efficient dualization of O(log n)-term monotone disjunctive normal forms.
#@Kazuhisa Makino
#t2003
#cDiscrete Applied Mathematics
#index837655
#% 
#!
  
#*The clique operator on graphs with few 's.
#@Célia Picinin de Mello,Aurora Morgana,M. Liverani
#t2006
#cDiscrete Applied Mathematics
#index837656
#% 
#!
  
#*Interior and Exterior Functions of Boolean Functions.
#@Kazuhisa Makino,Toshihide Ibaraki
#t1996
#cDiscrete Applied Mathematics
#index837657
#% 
#!
  
#*A Branch-and-Cut algorithm for graph coloring.
#@Isabel Méndez-Díaz,Paula Zabala
#t2006
#cDiscrete Applied Mathematics
#index837658
#%773510
#%1074418
#%3007117
#%3006909
#!
  
#*Inner-core and Outer-core Functions of Partially Defined Boolean Functions.
#@Kazuhisa Makino,Toshihide Ibaraki
#t1999
#cDiscrete Applied Mathematics
#index837659
#% 
#!
  
#*Connectivity of Vertex and Edge Transitive Graphs.
#@Jixiang Meng
#t2003
#cDiscrete Applied Mathematics
#index837660
#%864542
#!
  
#*Interior and exterior functions of positive Boolean functions.
#@Kazuhisa Makino,Hirotaka Ono,Toshihide Ibaraki
#t2003
#cDiscrete Applied Mathematics
#index837661
#%3670
#%837657
#%887270
#%887285
#%931986
#%952955
#%1058694
#%1059106
#%1060052
#!
  
#*On a kind of restricted edge connectivity of graphs.
#@Jixiang Meng,Youhu Ji
#t2002
#cDiscrete Applied Mathematics
#index837662
#% 
#!
  
#*Positive and Horn Decomposability of Partially Defined Boolean Functions.
#@Kazuhisa Makino,Kojin Yano,Toshihide Ibaraki
#t1997
#cDiscrete Applied Mathematics
#index837663
#% 
#!
  
#*Matching-star Ramsey Sets.
#@Ingrid Mengersen,Jörg Oeckermann
#t1999
#cDiscrete Applied Mathematics
#index837664
#% 
#!
  
#*Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width.
#@Johann A. Makowsky
#t2005
#cDiscrete Applied Mathematics
#index837665
#%477343
#%484695
#%484743
#%493212
#%611068
#%621953
#%831137
#%836521
#%836522
#%839382
#%852092
#%853447
#%887208
#%887537
#%952621
#%972597
#%974365
#%976458
#%1014638
#%1090210
#!
  
#*Upper bounds for the complexity of sequences generated by symmetric Boolean functions.
#@Yu. V. Merekin
#t2001
#cDiscrete Applied Mathematics
#index837666
#% 
#!
  
#*Latin squares with bounded size of row prefix intersections.
#@Grzegorz Malewicz
#t2006
#cDiscrete Applied Mathematics
#index837667
#%653973
#%1060403
#!
  
#*Underdiagonal Lattice Paths with Unrestricted Steps.
#@Donatella Merlini,Douglas G. Rogers,Renzo Sprugnoli,M. Cecilia Verri
#t1999
#cDiscrete Applied Mathematics
#index837668
#% 
#!
  
#*Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.
#@Federico Malucelli,Thomas Ottmann,Daniele Pretolani
#t1993
#cDiscrete Applied Mathematics
#index837669
#% 
#!
  
#*Waiting patterns for a printer.
#@Donatella Merlini,Renzo Sprugnoli,M. Cecilia Verri
#t2004
#cDiscrete Applied Mathematics
#index837670
#%846890
#%848544
#%854267
#%854414
#%3004496
#!
  
#*On a lower bound on the number of perfect binary codes.
#@S. A. Malyugin
#t2004
#cDiscrete Applied Mathematics
#index837671
#% 
#!
  
#*Improved algorithms for several network location problems with equality measures.
#@Juan A. Mesa,Justo Puerto,Arie Tamir
#t2003
#cDiscrete Applied Mathematics
#index837672
#%813212
#%934584
#%950099
#%953376
#%953102
#!
  
#*On enumeration of the perfect binary codes of length 15.
#@S. A. Malyugin
#t2004
#cDiscrete Applied Mathematics
#index837673
#%842055
#%842338
#%842337
#%1061706
#!
  
#*A wrap error attack against NTRUEncrypt.
#@Tommi Meskanen,Ari Renvall
#t2006
#cDiscrete Applied Mathematics
#index837674
#%42702
#%119754
#%120308
#!
  
#*The structure of stable marriage with indifference.
#@David Manlove
#t2002
#cDiscrete Applied Mathematics
#index837675
#%837219
#%838066
#%1059624
#%1059424
#%1091194
#%1093295
#%3003855
#!
  
#*Equivalence of some LP-based lower bounds for the problem.
#@Christophe Meyer,Brigitte Jaumard
#t2006
#cDiscrete Applied Mathematics
#index837676
#% 
#!
  
#*On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs.
#@David Manlove
#t1999
#cDiscrete Applied Mathematics
#index837677
#% 
#!
  
#*Sphere of Influence Graphs and the L-metric.
#@T. S. Michael,Thomas Quint
#t2003
#cDiscrete Applied Mathematics
#index837678
#% 
#!
  
#*On the Complexity of Inferring Functional Dependencies.
#@Heikki Mannila,Kari-Jouko Räihä
#t1992
#cDiscrete Applied Mathematics
#index837679
#% 
#!
  
#*Sphericity, cubicity, and edge clique covers of graphs.
#@T. S. Michael,Thomas Quint
#t2006
#cDiscrete Applied Mathematics
#index837680
#%803577
#%847974
#%850431
#%851188
#%852820
#%976960
#!
  
#*Fast Detection and Display of Symmetry in Outerplanar Graphs.
#@Joseph Manning,Mikhail J. Atallah
#t1992
#cDiscrete Applied Mathematics
#index837681
#% 
#!
  
#*Practical experiments of broadcasting algorithms on a configurable parallel computer.
#@Philippe Michallon,Denis Trystram
#t1994
#cDiscrete Applied Mathematics
#index837682
#% 
#!
  
#*An Enumerative Algorithm for the Frequency Assignment Problem.
#@Carlo Mannino,Antonio Sassano
#t2003
#cDiscrete Applied Mathematics
#index837683
#%567480
#%852640
#!
  
#*Lagrangean Methods for 0-1 Quadratic Problems.
#@Philippe Michelon,Nelson Maculan
#t1993
#cDiscrete Applied Mathematics
#index837684
#% 
#!
  
#*Alternating Paths in Edge-colored Complete Graphs.
#@Yannis Manoussakis
#t1995
#cDiscrete Applied Mathematics
#index837685
#% 
#!
  
#*Hybrid rounding techniques for knapsack problems.
#@Monaldo Mastrolilli,Marcus Hutter
#t2006
#cDiscrete Applied Mathematics
#index837686
#%46507
#%211265
#%816419
#%950753
#!
  
#*The Forwarding Index of Directed Networks.
#@Yannis Manoussakis,Zsolt Tuza
#t1996
#cDiscrete Applied Mathematics
#index837687
#% 
#!
  
#*Frequency-based views to pattern collections.
#@Taneli Mielikäinen
#t2006
#cDiscrete Applied Mathematics
#index837688
#%2067
#%108875
#%188242
#%188243
#%211197
#%299450
#%301329
#%302691
#%302708
#%302848
#%302646
#%302900
#%303017
#%473334
#%473466
#%473556
#%541466
#%544888
#%545212
#%597957
#%621364
#%621947
#%623225
#%642873
#%643909
#%817474
#%817475
#%839536
#%839571
#%839627
#%839518
#%950831
#%1009434
#%1113804
#%1113699
#%1118440
#%1118491
#%302809
#!
  
#*Performances of Parallel Branch and Bound Algorithms with Best-first Search.
#@Bernard Mans,Catherine Roucairol
#t1996
#cDiscrete Applied Mathematics
#index837689
#% 
#!
  
#*The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization.
#@Taneli Mielikäinen,Esko Ukkonen
#t2006
#cDiscrete Applied Mathematics
#index837690
#%2616
#%1058971
#%1059078
#!
  
#*Scheduling groups of tasks with precedence constraints on three dedicated processors.
#@Renata Mansini,Maria Grazia Speranza,Zsolt Tuza
#t2004
#cDiscrete Applied Mathematics
#index837691
#%836947
#%852467
#%930069
#!
  
#*Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution.
#@István Miklós
#t2003
#cDiscrete Applied Mathematics
#index837692
#% 
#!
  
#*On k-ary n-cubes: Theory and Applications.
#@Weizhen Mao,David M. Nicol
#t2003
#cDiscrete Applied Mathematics
#index837693
#% 
#!
  
#*Partitioning a matrix with non-guillotine cuts to minimize the maximum cos.
#@Aristide Mingozzi,Serena Morigi
#t2002
#cDiscrete Applied Mathematics
#index837694
#% 
#!
  
#*Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
#@Madhav V. Marathe,Harry B. Hunt III,S. S. Ravi
#t1996
#cDiscrete Applied Mathematics
#index837695
#% 
#!
  
#*Partitioning a Matrix to Minimize the Maximum Cost.
#@Aristide Mingozzi,Salvatore Ricciardelli,Massimo Spadoni
#t1995
#cDiscrete Applied Mathematics
#index837696
#% 
#!
  
#*Generalized Vertex Covering in Interval Graphs.
#@Madhav V. Marathe,R. Ravi,C. Pandu Rangan
#t1992
#cDiscrete Applied Mathematics
#index837697
#% 
#!
  
#*Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems.
#@Michel Minoux
#t2004
#cDiscrete Applied Mathematics
#index837698
#%2616
#%222117
#%302661
#%1040470
#%3005546
#%3007117
#!
  
#*Cutting planes in integer and mixed integer programming.
#@Hugues Marchand,Alexander Martin,Robert Weismantel,Laurence A. Wolsey
#t2002
#cDiscrete Applied Mathematics
#index837699
#%837889
#%924136
#%1013309
#%1013380
#%1013437
#%1013494
#%1013593
#%1013703
#%1014057
#%1014345
#%1275204
#%1275224
#%3007117
#!
  
#*Factoring Boolean functions using graph partitioning.
#@Aviad Mintz,Martin Charles Golumbic
#t2005
#cDiscrete Applied Mathematics
#index837700
#%132281
#%132420
#%282177
#%950620
#%952955
#%3417351
#!
  
#*Cooperative phenomena in crystals and the probability of tied Bord acount elections.
#@Thierry Marchant
#t2002
#cDiscrete Applied Mathematics
#index837701
#% 
#!
  
#*On approximability of linear ordering and related NP-optimization problems on graphs.
#@Sounaka Mishra,Kripasindhu Sikdar
#t2004
#cDiscrete Applied Mathematics
#index837702
#%105163
#%279663
#%406645
#%415177
#%768088
#%836016
#%877026
#%887571
#%950387
#%1025658
#%1061027
#!
  
#*A-closed classes of idempotent functions of many-valued logic definable by binary relations.
#@S. S. Marchenkov
#t2001
#cDiscrete Applied Mathematics
#index837703
#% 
#!
  
#*Extended finite automata over groups.
#@Victor Mitrana,Ralf Stiebe
#t2001
#cDiscrete Applied Mathematics
#index837704
#% 
#!
  
#*A-classification of idempotent functions of many-valued logic.
#@S. S. Marchenkov
#t2004
#cDiscrete Applied Mathematics
#index837705
#% 
#!
  
#*Lattice-theoretic properties of MPR-posets in phylogeny.
#@Kampei Miyakawa,Hiroshi Narushima
#t2004
#cDiscrete Applied Mathematics
#index837706
#%837059
#%837772
#%837774
#!
  
#*Some Complexity Results about Threshold Graphs.
#@François Margot
#t1994
#cDiscrete Applied Mathematics
#index837707
#% 
#!
  
#*A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains.
#@Masahiro Miyakawa,Akihiro Nozaki,Grant Pogosyan,Ivo G. Rosenberg
#t1999
#cDiscrete Applied Mathematics
#index837708
#% 
#!
  
#*The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making.
#@Jean-Luc Marichal
#t2000
#cDiscrete Applied Mathematics
#index837709
#% 
#!
  
#*Characterization of optimal key set protocols.
#@Takaaki Mizuki,Hiroki Shizuya,Takao Nishizeki
#t2003
#cDiscrete Applied Mathematics
#index837710
#%120014
#%610516
#!
  
#*Subclasses of -trees: Characterization and recognition.
#@Lilian Markenzon,C. M. Justel,N. Paciornik
#t2006
#cDiscrete Applied Mathematics
#index837711
#% 
#!
  
#*Hard problems in similarity searching.
#@Christophe Moan,Irena Rusu
#t2004
#cDiscrete Applied Mathematics
#index837712
#%481359
#%610943
#%620222
#%622635
#%1089500
#%1090979
#!
  
#*On Pseudounimodular Matrices.
#@Mario Martelli,Mario Pedrazzoli
#t1993
#cDiscrete Applied Mathematics
#index837713
#% 
#!
  
#*A Technique to Find Multiple Motif Occurrences in a Biomolecular Sequence.
#@Nicolas Moeri
#t1999
#cDiscrete Applied Mathematics
#index837714
#% 
#!
  
#*Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
#@Silvano Martello,François Soumis,Paolo Toth
#t1997
#cDiscrete Applied Mathematics
#index837715
#% 
#!
  
#*Two Machine open Shop Scheduling Problem with Bi-criteria.
#@Teruo Masuda,Hiroaki Ishii
#t1994
#cDiscrete Applied Mathematics
#index837716
#% 
#!
  
#*An asymmetric analogue of van der Veen conditions and the traveling salesman problem.
#@Yoshiaki Oda
#t2001
#cDiscrete Applied Mathematics
#index837717
#% 
#!
  
#*Secret sharing schemes on access structures with intersection number equal to one.
#@Jaume Martí-Farré,Carles Padró
#t2006
#cDiscrete Applied Mathematics
#index837718
#%119767
#%775946
#%842091
#%842121
#%842426
#%842179
#%842398
#%985929
#!
  
#*Triangulating Graphs Without Asteroidal Triples.
#@Rolf H. Möhring
#t1996
#cDiscrete Applied Mathematics
#index837719
#% 
#!
  
#*Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization.
#@Rafael Martí,Manuel Laguna
#t2003
#cDiscrete Applied Mathematics
#index837720
#%224999
#%813320
#%1128162
#%1275189
#%3006096
#!
  
#*Scheduling at Villa Vigoni.
#@Rolf H. Möhring,Franz Josef Radermacher,Maria Grazia Speranza
#t1997
#cDiscrete Applied Mathematics
#index837721
#% 
#!
  
#*Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition.
#@Wayne Martin
#t1998
#cDiscrete Applied Mathematics
#index837722
#% 
#!
  
#*Matrix period in max-algebra.
#@Monika Molnárová,Ján Pribis
#t2000
#cDiscrete Applied Mathematics
#index837723
#% 
#!
  
#*Median Hyperplanes in Normed Spaces - A Survey.
#@Horst Martini,Anita Schöbel
#t1998
#cDiscrete Applied Mathematics
#index837724
#% 
#!
  
#*Monotonicity of the minimum cardinality of an identifying code in the hypercube.
#@Julien Moncel
#t2006
#cDiscrete Applied Mathematics
#index837725
#%846967
#%932078
#!
  
#*Eulerian disjoint paths problem in grid graphs is NP-complete.
#@Dániel Marx
#t2004
#cDiscrete Applied Mathematics
#index837726
#%838291
#!
  
#*Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints.
#@Shlomo Moran,Yaron Wolfsthal
#t1993
#cDiscrete Applied Mathematics
#index837727
#% 
#!
  
#*Precoloring extension on unit interval graphs.
#@Dániel Marx
#t2006
#cDiscrete Applied Mathematics
#index837728
#%837726
#%838291
#%853215
#!
  
#*A Graph Theoretical Approach for the Yield Enhancement of Reconfigurable VLSI/WSI Arrays.
#@Jagannathan Narasimhan,Kazuo Nakajima,Chong S. Rim
#t1999
#cDiscrete Applied Mathematics
#index837729
#% 
#!
  
#*Bounds for optimal coverings.
#@Carlos Gustavo T. de A. Moreira,Yoshiharu Kohayakawa
#t2004
#cDiscrete Applied Mathematics
#index837730
#% 
#!
  
#*An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid.
#@Aurora Morgana,Célia Picinin de Mello,Giovanna Sontacchi
#t2004
#cDiscrete Applied Mathematics
#index837731
#%837542
#!
  
#*The geometry of carpentry and joinery.
#@Pat Morin,Jason Morrison
#t2004
#cDiscrete Applied Mathematics
#index837732
#%2022
#%3482
#%81853
#%803641
#%843169
#!
  
#*-Assignments of simplicial complexes and reverse search.
#@Sonoko Moriyama,Masahiro Hachimori
#t2006
#cDiscrete Applied Mathematics
#index837733
#%111067
#%835975
#!
  
#*Some results on maximum stable sets in certain P-free graphs.
#@Raffaele Mosca
#t2003
#cDiscrete Applied Mathematics
#index837734
#% 
#!
  
#*Stable Sets in Certain P-free Graphs.
#@Raffaele Mosca
#t1999
#cDiscrete Applied Mathematics
#index837735
#% 
#!
  
#*Complexity analysis of job-shop scheduling with deteriorating jobs.
#@Gur Mosheiov
#t2002
#cDiscrete Applied Mathematics
#index837736
#% 
#!
  
#*Computing Roots of Graphs Is Hard.
#@Rajeev Motwani,Madhu Sudan
#t1994
#cDiscrete Applied Mathematics
#index837737
#% 
#!
  
#*Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders.
#@Aziz Moukrim
#t2003
#cDiscrete Applied Mathematics
#index837738
#%2022
#%837875
#%953302
#%1035262
#%1091163
#%1125965
#!
  
#*Retractions of Finite Distance Functions Onto Tree Metrics.
#@Vincent Moulton,Mike A. Steel
#t1999
#cDiscrete Applied Mathematics
#index837739
#% 
#!
  
#*The Majority Strategy on Graphs.
#@Henry Martyn Mulder
#t1997
#cDiscrete Applied Mathematics
#index837740
#% 
#!
  
#*Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time.
#@Haiko Müller
#t1997
#cDiscrete Applied Mathematics
#index837741
#% 
#!
  
#*Cluttered orderings for the complete bipartite graph.
#@Meinard Müller,Tomoko Adachi,Masakazu Jimbo
#t2005
#cDiscrete Applied Mathematics
#index837742
#%832392
#%836405
#%1090197
#!
  
#*Erasure-resilient codes from affine spaces.
#@Meinard Müller,Masakazu Jimbo
#t2004
#cDiscrete Applied Mathematics
#index837743
#%832392
#%836405
#!
  
#*Probe location in the presence of errors: a problem from DNA mapping.
#@Brendan Mumey
#t2000
#cDiscrete Applied Mathematics
#index837744
#% 
#!
  
#*The Basic Cyclic Scheduling Problem with Linear Precedence Constraints.
#@Alix Munier
#t1996
#cDiscrete Applied Mathematics
#index837745
#% 
#!
  
#*On the probabilistic minimum coloring and minimum -coloring.
#@Cécile Murat,Vangelis Th. Paschos
#t2006
#cDiscrete Applied Mathematics
#index837746
#% 
#!
  
#*Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
#@Kazuo Murota,Akiyoshi Shioura
#t2001
#cDiscrete Applied Mathematics
#index837747
#% 
#!
  
#*Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization.
#@Kazuo Murota,Akiyoshi Shioura
#t2003
#cDiscrete Applied Mathematics
#index837748
#%837749
#%838123
#%1014020
#%2892105
#!
  
#*New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
#@Kazuo Murota,Akihisa Tamura
#t2003
#cDiscrete Applied Mathematics
#index837749
#%837747
#%838123
#%837748
#%1013215
#%1014020
#!
  
#*On the Complexity of a Special Basis Problem in LP.
#@Katta G. Murty
#t1993
#cDiscrete Applied Mathematics
#index837750
#% 
#!
  
#*Efficient generation of rotating workforce schedules.
#@Nysret Musliu,Johannes Gärtner,Wolfgang Slany
#t2002
#cDiscrete Applied Mathematics
#index837751
#%812888
#%813176
#!
  
#*on the Mathematical Model of Triangulanes.
#@Mikhail E. Muzychuk,Mikhail H. Klin,Nikolai S. Zefirov
#t1996
#cDiscrete Applied Mathematics
#index837752
#% 
#!
  
#*Periodic Network Optimization with Different Arc Frequencies.
#@Karl Nachtigall
#t1996
#cDiscrete Applied Mathematics
#index837753
#% 
#!
  
#*An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree.
#@Hiroshi Nagamochi
#t2003
#cDiscrete Applied Mathematics
#index837754
#%186032
#%210689
#%268436
#%610560
#%950872
#%1059461
#!
  
#*Polyhedral structure of submodular and posi-modular systems.
#@Hiroshi Nagamochi,Toshihide Ibaraki
#t2000
#cDiscrete Applied Mathematics
#index837755
#% 
#!
  
#*Graph connectivity and its augmentation: applications of MA orderings.
#@Hiroshi Nagamochi,Toshihide Ibaraki
#t2002
#cDiscrete Applied Mathematics
#index837756
#%186276
#%210736
#%210968
#%415530
#%415619
#%610198
#%610504
#%622069
#%622430
#%622068
#%622426
#%837755
#%933063
#%950342
#%950841
#%951673
#%953114
#%953134
#%953090
#%953064
#%973099
#%973100
#%975675
#%976474
#%976473
#%1014049
#%1014136
#%1059250
#%1059561
#%1059425
#%1059720
#%1060536
#%1061044
#%1061078
#%1061474
#%1061347
#%1061645
#%3005546
#!
  
#*On the minimum local-vertex-connectivity augmentation in graphs.
#@Hiroshi Nagamochi,Toshimasa Ishii
#t2003
#cDiscrete Applied Mathematics
#index837757
#%837756
#%1061347
#!
  
#*Minmax subtree cover problem on cacti.
#@Hiroshi Nagamochi,Taizo Kawada
#t2006
#cDiscrete Applied Mathematics
#index837758
#%835964
#%837345
#%896573
#%1092508
#!
  
#*A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree.
#@Hiroshi Nagamochi,Kohei Okada
#t2004
#cDiscrete Applied Mathematics
#index837759
#% 
#!
  
#*Hiroyuki Nagashima and Koichi Yamazaki.
#@Hiroyuki Nagashima,Koichi Yamazaki
#t2004
#cDiscrete Applied Mathematics
#index837760
#% 
#!
  
#*Watersheds, mosaics, and the emergence paradigm.
#@Laurent Najman,Michel Couprie,Gilles Bertrand
#t2005
#cDiscrete Applied Mathematics
#index837761
#%587330
#%1032534
#%1033267
#%1045662
#%1339232
#!
  
#*A single-element extension of antimatroids.
#@Masataka Nakamura
#t2002
#cDiscrete Applied Mathematics
#index837762
#% 
#!
  
#*Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
#@M. Nakamura
#t2003
#cDiscrete Applied Mathematics
#index837763
#%837849
#%977856
#!
  
#*An Extension of Elementary Bipartite Graphs to Matroid Pairs and its Characterization.
#@Masataka Nakamura
#t1994
#cDiscrete Applied Mathematics
#index837764
#% 
#!
  
#*Shattering a set of objects in 2D.
#@Subhas C. Nandy,Tetsuo Asano,Tomohiro Harayama
#t2002
#cDiscrete Applied Mathematics
#index837765
#%3482
#%81965
#%803695
#%931022
#%971843
#!
  
#*Dynamic storage allocation with known durations.
#@Joseph Naor,Ariel Orda,Yael Petruschka
#t2000
#cDiscrete Applied Mathematics
#index837766
#% 
#!
  
#*Complexity of the directed spanning cactus problem.
#@Anna Palbom
#t2005
#cDiscrete Applied Mathematics
#index837767
#%2022
#%211083
#%406787
#%838012
#%951516
#%952941
#!
  
#*A note on the minimization of symmetric and general submodular functions.
#@H. Narayanan
#t2003
#cDiscrete Applied Mathematics
#index837768
#%611226
#%622353
#%933063
#%951673
#%977868
#%1014049
#%1061645
#!
  
#*Rigidity of Octahedral-tetrahedral Trusses.
#@Damien Palmer,Don Row,Roy Stee,Simon Wotherspoon
#t1998
#cDiscrete Applied Mathematics
#index837769
#% 
#!
  
#*Worst-case analysis of a dynamic channel assignment strategy.
#@Lata Narayanan,Yihui Tang
#t2004
#cDiscrete Applied Mathematics
#index837770
#%544395
#%614152
#%851813
#%953191
#%1141127
#!
  
#*Path partition for graphs with special blocks.
#@Jun-Jie Pan,Gerard J. Chang
#t2005
#cDiscrete Applied Mathematics
#index837771
#%853614
#%854237
#%929786
#%930385
#%934559
#%1061170
#%1094718
#%1095250
#!
  
#*A More Efficient Algorithm for MPR Problems in Phylogeny.
#@Hiroshi Narushima,Masazumi Hanazawa
#t1997
#cDiscrete Applied Mathematics
#index837772
#% 
#!
  
#*Relative completeness with respect to two unary functions.
#@Jovanka Pantovic,Ratko Tosic,Gradimir Vojvodic
#t2001
#cDiscrete Applied Mathematics
#index837773
#% 
#!
  
#*On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization.
#@Hiroshi Narushima,Natalia Misheva
#t2002
#cDiscrete Applied Mathematics
#index837774
#%837059
#%837772
#!
  
#*Computing the Throughput of a Network with Dedicated Lines.
#@Christos H. Papadimitriou,Paolo Serafini,Mihalis Yannakakis
#t1993
#cDiscrete Applied Mathematics
#index837775
#% 
#!
  
#*Complexity classification of some edge modification problems.
#@Assaf Natanzon,Ron Shamir,Roded Sharan
#t2001
#cDiscrete Applied Mathematics
#index837776
#% 
#!
  
#*An Efficient Algorithm for the Knight's Tour Problem.
#@Ian Parberry
#t1997
#cDiscrete Applied Mathematics
#index837777
#% 
#!
  
#*The Point-to-point Connection Problem - Analysis and Algorithms.
#@Madan Natu,Shu-Cherng Fang
#t1997
#cDiscrete Applied Mathematics
#index837778
#% 
#!
  
#*Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis.
#@Laxmi Parida,Bud Mishra
#t2000
#cDiscrete Applied Mathematics
#index837779
#% 
#!
  
#*Polynomial Invariants of Graphs with State Models.
#@Seiya Negami,Kenichi Kawagoe
#t1995
#cDiscrete Applied Mathematics
#index837780
#% 
#!
  
#*Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem.
#@Kyungchul Park,Sungsoo Park
#t1997
#cDiscrete Applied Mathematics
#index837781
#% 
#!
  
#*The Cardinality and Precedence Constrained Maximum Value Sub-hypergraph Problem, Its Applications.
#@David Nehme,Gang Yu
#t1997
#cDiscrete Applied Mathematics
#index837782
#% 
#!
  
#*Triangulating Multitolerance Graphs.
#@Andreas Parra
#t1998
#cDiscrete Applied Mathematics
#index837783
#% 
#!
  
#*on ordered Graphs and Graph orderings.
#@Jaroslav Nesetril
#t1994
#cDiscrete Applied Mathematics
#index837784
#% 
#!
  
#*Characterizations and Algorithmic Applications of Chordal Graph Embeddings.
#@Andreas Parra,Petra Scheffler
#t1997
#cDiscrete Applied Mathematics
#index837785
#% 
#!
  
#*Graph representations of a bicircular matroid.
#@Nancy Ann Neudauer
#t2002
#cDiscrete Applied Mathematics
#index837786
#% 
#!
  
#*On the Complexity of String Folding.
#@Mike Paterson,Teresa M. Przytycka
#t1996
#cDiscrete Applied Mathematics
#index837787
#% 
#!
  
#*The Number of Clone Orderings.
#@Lee Aaron Newberg
#t1996
#cDiscrete Applied Mathematics
#index837788
#% 
#!
  
#*Improving graph partitions using submodular functions.
#@Sachin B. Patkar,H. Narayanan
#t2003
#cDiscrete Applied Mathematics
#index837789
#%131318
#%835950
#%930505
#%950463
#%952625
#%953412
#%1059429
#%1059273
#%3006755
#!
  
#*The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees.
#@Meei Pyng Ng,Mike A. Steel,Nicholas C. Wormald
#t2000
#cDiscrete Applied Mathematics
#index837790
#% 
#!
  
#*Lot-size Scheduling of Two Types of Jobs on Identical Machines.
#@Marcus Pattloch,Günter Schmidt
#t1996
#cDiscrete Applied Mathematics
#index837791
#% 
#!
  
#*Optimally balancing assembly lines with different workstations.
#@Gaia Nicosia,Dario Pacciarelli,Andrea Pacifici
#t2002
#cDiscrete Applied Mathematics
#index837792
#%1036944
#%1036899
#!
  
#*Single machine scheduling with assignable due dates.
#@Xiangtong Qi,Gang Yu,Jonathan F. Bard
#t2002
#cDiscrete Applied Mathematics
#index837793
#%812840
#%836426
#%837413
#%931436
#!
  
#*Earliness and Tardiness Scheduling Problems on a Batch Processor.
#@Xiangtong Qi,Fengsheng Tu
#t1999
#cDiscrete Applied Mathematics
#index837794
#% 
#!
  
#*Towards optimal locality in mesh-indexings.
#@Rolf Niedermeier,Klaus Reinhardt,Peter Sanders
#t2002
#cDiscrete Applied Mathematics
#index837795
#% 
#!
  
#*On the Splicing Operation.
#@Gheorghe Paun
#t1996
#cDiscrete Applied Mathematics
#index837796
#% 
#!
  
#*How to Find overfull Subgraphs in Graphs with Large Maximum Degree.
#@Thomas Niessen
#t1994
#cDiscrete Applied Mathematics
#index837797
#% 
#!
  
#*Thin and Slender Languages.
#@Gheorghe Paun,Arto Salomaa
#t1995
#cDiscrete Applied Mathematics
#index837798
#% 
#!
  
#*Optimal Channel Allocation for Several Types of Cellular Radio Networks.
#@Thomas Niessen
#t1997
#cDiscrete Applied Mathematics
#index837799
#% 
#!
  
#*Linear Broadcast Encryption Schemes.
#@Carles Padró,Ignacio Gracia,Sebastià Martín Molleví,Paz Morillo
#t2003
#cDiscrete Applied Mathematics
#index837800
#%50990
#%51083
#%83945
#%119769
#%267418
#%396180
#%839285
#%842319
#%842355
#%933991
#%985937
#%3005937
#!
  
#*Interactive L Systems with a Fast Local Growth.
#@Yoav Raz
#t1989
#cDiscrete Applied Mathematics
#index837801
#% 
#!
  
#*Coloring permutation graphs in parallel.
#@Stavros D. Nikolopoulos
#t2002
#cDiscrete Applied Mathematics
#index837802
#%147
#%219722
#%289185
#%839330
#%933141
#%949772
#%1025548
#%1089659
#%3006037
#!
  
#*Diameter-vulnerability of Large Bipartite Digraphs.
#@Carles Padró,Paz Morillo,Eduard Llobet Valero
#t1996
#cDiscrete Applied Mathematics
#index837803
#% 
#!
  
#*Congruences concerning Bernoulli numbers and Bernoulli polynomials.
#@Zhi-Hong Sun
#t2000
#cDiscrete Applied Mathematics
#index837804
#% 
#!
  
#*Efficient parallel recognition of cographs.
#@Stavros D. Nikolopoulos,Leonidas Palios
#t2005
#cDiscrete Applied Mathematics
#index837805
#%147
#%836548
#%837570
#%839487
#%952492
#%952770
#%989289
#%1015381
#%1061056
#%1093680
#!
  
#*On the robustness of primitive words.
#@Gheorghe Paun,Nicolae Santean,Gabriel Thierrin,Sheng Yu
#t2002
#cDiscrete Applied Mathematics
#index837806
#% 
#!
  
#*Graph layering by promotion of nodes.
#@Nikola S. Nikolov,Alexandre Tarassov
#t2006
#cDiscrete Applied Mathematics
#index837807
#%224887
#%224957
#%224958
#%268637
#%803948
#%832718
#%930194
#%1128162
#%3007117
#!
  
#*Maximal Value of the Zeroth-order Randic Index.
#@Ljiljana Pavlovic
#t2003
#cDiscrete Applied Mathematics
#index837808
#% 
#!
  
#*Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.
#@Naomi Nishimura,Prabhakar Ragde,Dimitrios M. Thilikos
#t2005
#cDiscrete Applied Mathematics
#index837809
#%707
#%660873
#%838193
#%854862
#%929689
#%929855
#%931056
#%950279
#%953372
#%971913
#%974671
#%976811
#%977721
#%1059078
#%1059711
#%1089958
#!
  
#*On the Primer Selection Problem in Polymerase Chain Reaction Experiments.
#@William R. Pearson,Gabriel Robins,Dallas E. Wrege,Tongtong Zhang
#t1996
#cDiscrete Applied Mathematics
#index837810
#% 
#!
  
#*k-Connectivity and Decomposition of Graphs into Forests.
#@Takao Nishizeki,Svatopluk Poljak
#t1994
#cDiscrete Applied Mathematics
#index837811
#% 
#!
  
#*A Divisibility Property for a Subgroup of Riordan Matrices.
#@Paul Peart,Wen-Jin Woan
#t2000
#cDiscrete Applied Mathematics
#index837812
#% 
#!
  
#*The edge-disjoint paths problem is NP-complete for series-parallel graphs.
#@Takao Nishizeki,Jens Vygen,Xiao Zhou
#t2001
#cDiscrete Applied Mathematics
#index837813
#% 
#!
  
#*The number of independent sets in unicyclic graphs.
#@Anders Sune Pedersen,Preben D. Vestergaard
#t2005
#cDiscrete Applied Mathematics
#index837814
#%745763
#%837293
#!
  
#*On the combinatorics of leftist trees.
#@P. Nogueira
#t2001
#cDiscrete Applied Mathematics
#index837815
#% 
#!
  
#*The maximum edge biclique problem is NP-complete.
#@René Peeters
#t2003
#cDiscrete Applied Mathematics
#index837816
#%623296
#%953079
#%953243
#%953241
#%976091
#!
  
#*Preface.
#@Hartmut Noltemeier,Kokichi Sugihara
#t1999
#cDiscrete Applied Mathematics
#index837817
#% 
#!
  
#*Equistable chordal graphs.
#@Uri N. Peled,Udi Rotics
#t2003
#cDiscrete Applied Mathematics
#index837818
#%837382
#!
  
#*Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths.
#@Nancy Norris
#t1995
#cDiscrete Applied Mathematics
#index837819
#% 
#!
  
#*A O()-Time Algorithm for Computing the Dual of a Regular Boolean Function.
#@Uri N. Peled,Bruno Simeone
#t1994
#cDiscrete Applied Mathematics
#index837820
#% 
#!
  
#*Configurations induced by discrete rotations: periodicity and quasi-periodicity properties.
#@Bertrand Nouvel,Eric Rémila
#t2005
#cDiscrete Applied Mathematics
#index837821
#%110796
#%153944
#%593771
#%834565
#%1090468
#!
  
#*Total Matchings and Total Coverings of Threshold Graphs.
#@Uri N. Peled,Feng Sun
#t1994
#cDiscrete Applied Mathematics
#index837822
#% 
#!
  
#*Search ans Sweep Numbers of Finite Directed Acyclic Graphs.
#@Richard J. Nowakowski
#t1993
#cDiscrete Applied Mathematics
#index837823
#% 
#!
  
#*Enumeration of Difference Graphs.
#@Uri N. Peled,Feng Sun
#t1995
#cDiscrete Applied Mathematics
#index837824
#% 
#!
  
#*New Results in the Worst-Case Analysis for Flow-Shop Scheduling.
#@Eugeniusz Nowicki,Czeslaw Smutnicki
#t1993
#cDiscrete Applied Mathematics
#index837825
#% 
#!
  
#*Size Bounds for Dynamic Monopolies.
#@David Peleg
#t1998
#cDiscrete Applied Mathematics
#index837826
#% 
#!
  
#*An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times.
#@Eugeniusz Nowicki,Czeslaw Smutnicki
#t1994
#cDiscrete Applied Mathematics
#index837827
#% 
#!
  
#*The Availability of Crumbling Wall Quorum Systems.
#@David Peleg,Avishai Wool
#t1997
#cDiscrete Applied Mathematics
#index837828
#% 
#!
  
#*A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times.
#@Eugeniusz Nowicki,Stanislaw Zdrzalka
#t1995
#cDiscrete Applied Mathematics
#index837829
#% 
#!
  
#*Recognizing DNA graphs is difficult.
#@Rudi Pendavingh,Petra Schuurman,Gerhard J. Woeginger
#t2003
#cDiscrete Applied Mathematics
#index837830
#%622266
#%836162
#%861892
#%1081717
#!
  
#*Upper bounds for covering arrays by tabu search.
#@Kari J. Nurmela
#t2004
#cDiscrete Applied Mathematics
#index837831
#%842418
#%977541
#!
  
#*On the interval completion of chordal graphs.
#@Sheng-Lung Peng,Chi-Kang Chen
#t2006
#cDiscrete Applied Mathematics
#index837832
#%211084
#%268897
#%611268
#%622444
#%832456
#%837015
#%837719
#%929689
#%1059711
#%1059884
#%1059834
#%1061343
#!
  
#*Covering t-sets with (t+2)-sets.
#@Kari J. Nurmela,Patric R. J. Östergård
#t1999
#cDiscrete Applied Mathematics
#index837833
#% 
#!
  
#*Isostatic Bar and Joint Frameworks in the Plane with Irreducible Pure Conditions.
#@Rudi Penne
#t1994
#cDiscrete Applied Mathematics
#index837834
#% 
#!
  
#*on the Integral Dicycle Packings and Covers and the Linear ordering Polytope.
#@Zeev Nutov,Michal Penn
#t1995
#cDiscrete Applied Mathematics
#index837835
#% 
#!
  
#*on-line Algorithms for ordered Sets and Comparability Graphs.
#@Stephen G. Penrice
#t1995
#cDiscrete Applied Mathematics
#index837836
#% 
#!
  
#*Correlation theorems in cryptanalysis.
#@Kaisa Nyberg
#t2001
#cDiscrete Applied Mathematics
#index837837
#% 
#!
  
#*A distributed algorithm to find k-dominating sets.
#@Lucia Draque Penso,Valmir C. Barbosa
#t2004
#cDiscrete Applied Mathematics
#index837838
#% 
#!
  
#*Advances in Discrete Geometry and Topology: Special issue devoted to the 11th International Conference on Discrete Geometry for Computer Imagery (DGCI 2003) Naples, Italy 19-21 November 2003.
#@Ingela Nyström,Gabriella Sanniti di Baja,Stina Svensson
#t2005
#cDiscrete Applied Mathematics
#index837839
#% 
#!
  
#*Statistical learning formulation of the DNA base-calling problem and its solution in a Bayesian EM framework.
#@Manuela S. Pereira,Lucio Andrade,Sameh El Difrawy,Barry L. Karger,Elias S. Manolakos
#t2000
#cDiscrete Applied Mathematics
#index837840
#% 
#!
  
#*Nondegenerate Functions and Permutations.
#@Luke O'Connor
#t1997
#cDiscrete Applied Mathematics
#index837841
#% 
#!
  
#*A Proof of Jean De Rumeur's Conjecture.
#@Stephane Perennes
#t1997
#cDiscrete Applied Mathematics
#index837842
#% 
#!
  
#*Tight Bounds for Synchronous Communication of Information Using Bits, Silence.
#@Una-May O'Reilly,Nicola Santoro
#t2003
#cDiscrete Applied Mathematics
#index837843
#% 
#!
  
#*Regularity of Splicing Languages.
#@Dennis Pixton
#t1996
#cDiscrete Applied Mathematics
#index837844
#% 
#!
  
#*On strong Menger-connectivity of star graphs.
#@Eunseuk Oh,Jianer Chen
#t2003
#cDiscrete Applied Mathematics
#index837845
#%408502
#%951394
#%1078072
#%1077859
#%1078601
#%1124749
#%1124904
#!
  
#*Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks.
#@Stephane Perennes
#t1998
#cDiscrete Applied Mathematics
#index837846
#% 
#!
  
#*Traveling salesman games with the Monge property.
#@Yoshio Okamoto
#t2004
#cDiscrete Applied Mathematics
#index837847
#%186044
#%610611
#%812153
#%813141
#%836303
#%836692
#%836727
#%836973
#%837312
#%837717
#%950771
#%976381
#%977868
#%1014087
#%1061251
#%1061855
#%3350508
#%3449689
#!
  
#*On cyclic <m,n>-enumerations.
#@A. L. Perezhogin
#t2004
#cDiscrete Applied Mathematics
#index837848
#% 
#!
  
#*The forbidden minor characterization of line-search antimatroids of rooted digraphs.
#@Yoshio Okamoto,Masataka Nakamura
#t2003
#cDiscrete Applied Mathematics
#index837849
#%837763
#%839457
#%977856
#%1191993
#!
  
#*On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
#@Igor Pak,Van H. Vu
#t2001
#cDiscrete Applied Mathematics
#index837850
#% 
#!
  
#*Approximation algorithms for the watchman route and zookeeper's problems.
#@Xuehou Tan
#t2004
#cDiscrete Applied Mathematics
#index837851
#%803636
#%843169
#%843177
#%929637
#%930537
#%931993
#%933474
#%934072
#%940107
#%111297
#!
  
#*Comparing the sizes of nondeterministic branching read-k-times programs.
#@Elizaveta A. Okol'nishnikova
#t2004
#cDiscrete Applied Mathematics
#index837852
#% 
#!
  
#*A scheme for the synchronization of variable length codes.
#@Stephanie Perkins,Derek H. Smith
#t2000
#cDiscrete Applied Mathematics
#index837853
#% 
#!
  
#*Greedy algorithms for tracking mobile users in special mobility graphs.
#@Stephan Olariu,Maria Cristina Pinotti,Larry Wilson
#t2002
#cDiscrete Applied Mathematics
#index837854
#%401742
#%505588
#%933207
#%1121911
#%1122436
#%1141052
#%1140999
#%1140987
#%1141362
#%1141360
#!
  
#*TSP Ejection Chains.
#@Erwin Pesch,Fred Glover
#t1997
#cDiscrete Applied Mathematics
#index837855
#% 
#!
  
#*A decomposability index in logical analysis of data.
#@Hirotaka Ono,Mutsunori Yagiura,Toshihide Ibaraki
#t2004
#cDiscrete Applied Mathematics
#index837856
#% 
#!
  
#*A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
#@R. J. Petch,Said Salhi
#t2003
#cDiscrete Applied Mathematics
#index837857
#%812910
#!
  
#*Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1.
#@Jaroslav Opatrny,Dominique Sotteau
#t2000
#cDiscrete Applied Mathematics
#index837858
#% 
#!
  
#*N-extendible Posets, and How to Minimize Total Weighted Completion Time.
#@Markus Peter,Georg Wambach
#t2000
#cDiscrete Applied Mathematics
#index837859
#% 
#!
  
#*Clique family inequalities for the stable set polytope of quasi-line graphs.
#@G. Oriolo
#t2003
#cDiscrete Applied Mathematics
#index837860
#%975813
#%976813
#%1014248
#!
  
#*Bounded Depth Broadcasting.
#@David B. Peters,Joseph G. Peters
#t1996
#cDiscrete Applied Mathematics
#index837861
#% 
#!
  
#*On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures.
#@Alon Orlitsky,Santosh S. Venkatesh
#t1996
#cDiscrete Applied Mathematics
#index837862
#% 
#!
  
#*Gridline graphs: a review in two dimensions and an extension to higher dimensions.
#@Dale Peterson
#t2003
#cDiscrete Applied Mathematics
#index837863
#%837629
#%853325
#%975815
#%977063
#%1060403
#!
  
#*Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases.
#@V. A. Orlov
#t2004
#cDiscrete Applied Mathematics
#index837864
#% 
#!
  
#*A Framework for Adaptive Sorting.
#@Ola Petersson,Alistair Moffat
#t1995
#cDiscrete Applied Mathematics
#index837865
#% 
#!
  
#*On the Complexity of Coupled-task Scheduling.
#@Alex J. Orman,Chris N. Potts
#t1997
#cDiscrete Applied Mathematics
#index837866
#% 
#!
  
#*Delay-related secondary objectives for rectilinear Steiner minimum trees.
#@Sven Peyer,Martin Zachariasen,David Grove Jørgensen
#t2004
#cDiscrete Applied Mathematics
#index837867
#%131494
#%131493
#%131519
#%131864
#%211558
#%281990
#!
  
#*Characterizing and Edge-colouring Split-indifference Graphs.
#@Carmen Ortiz,Nelson Maculan,Jayme Luiz Szwarcfiter
#t1998
#cDiscrete Applied Mathematics
#index837868
#% 
#!
  
#*A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs.
#@Frank Pfeiffer
#t1994
#cDiscrete Applied Mathematics
#index837869
#% 
#!
  
#*A fast algorithm for the maximum clique problem.
#@Patric R. J. Östergård
#t2002
#cDiscrete Applied Mathematics
#index837870
#%1275210
#!
  
#*Simple But Efficient Approaches for the Collapsing Knapsack Problem.
#@Ulrich Pferschy,David Pisinger,Gerhard J. Woeginger
#t1997
#cDiscrete Applied Mathematics
#index837871
#% 
#!
  
#*Column Scrambler for the GPT Cryptosystem.
#@Alexei V. Ourivski,Ernst M. Gabidulin
#t2003
#cDiscrete Applied Mathematics
#index837872
#%841999
#!
  
#*The Asymmetric Median Tree - A New Model for Building Consensus Trees.
#@Cynthia A. Phillips,Tandy Warnow
#t1996
#cDiscrete Applied Mathematics
#index837873
#% 
#!
  
#*How Good Are Branching Rules in DPLL?
#@Ming Ouyang
#t1998
#cDiscrete Applied Mathematics
#index837874
#% 
#!
  
#*New Complexity Results on Scheduling with Small Communication Delays.
#@Christophe Picouleau
#t1995
#cDiscrete Applied Mathematics
#index837875
#% 
#!
  
#*Panelling Planar Graphs.
#@James G. Oxley,Don Row
#t1998
#cDiscrete Applied Mathematics
#index837876
#% 
#!
  
#*The Asymptotic Optimality of Spider-Web Networks.
#@Nicholas Pippenger
#t1992
#cDiscrete Applied Mathematics
#index837877
#% 
#!
  
#*Constructing Status Injective Graphs.
#@Lior Pachter
#t1997
#cDiscrete Applied Mathematics
#index837878
#% 
#!
  
#*A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time.
#@Nicolai N. Pisaruk
#t2003
#cDiscrete Applied Mathematics
#index837879
#%836408
#%3005546
#!
  
#*Polynomial-time approximation of largest simplices in V-polytopes.
#@Asa Packer
#t2004
#cDiscrete Applied Mathematics
#index837880
#% 
#!
  
#*A Fast Algorithm for Strongly Correlated Knapsack Problems.
#@David Pisinger
#t1998
#cDiscrete Applied Mathematics
#index837881
#% 
#!
  
#*Improving the trade-off between storage and communication in broadcast encryption schemes.
#@Carles Padró,Ignacio Gracia,Sebastià Martín Molleví
#t2004
#cDiscrete Applied Mathematics
#index837882
#%119769
#%837800
#%842319
#%933991
#%3005937
#!
  
#*On the log-concavity of sequences arising from integer bases.
#@Philippe Pitteloud
#t2004
#cDiscrete Applied Mathematics
#index837883
#%848310
#!
  
#*Distances and diameters on iterated clique graphs.
#@Miguel A. Pizaña
#t2004
#cDiscrete Applied Mathematics
#index837884
#%848726
#%851769
#%853797
#%977379
#!
  
#*A satisfiability procedure for quantified Boolean formulae.
#@David A. Plaisted,Armin Biere,Yunshan Zhu
#t2003
#cDiscrete Applied Mathematics
#index837885
#%12165
#%71348
#%72072
#%83711
#%133214
#%133590
#%390331
#%645228
#%771155
#%887427
#%950130
#%954917
#%954767
#%994488
#%1078407
#%3006115
#!
  
#*-Parametric eigenproblem in max-algebra.
#@Ján Plávka
#t2005
#cDiscrete Applied Mathematics
#index837886
#%839352
#!
  
#*Heuristics for the Steiner Problem in Graphs.
#@Ján Plesník
#t1992
#cDiscrete Applied Mathematics
#index837887
#% 
#!
  
#*Constrained Weighted Matchings and Edge Coverings in Graphs.
#@Ján Plesník
#t1999
#cDiscrete Applied Mathematics
#index837888
#% 
#!
  
#*Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation.
#@Yves Pochet,Laurence A. Wolsey
#t1995
#cDiscrete Applied Mathematics
#index837889
#% 
#!
  
#*Score certificate numbers of upset tournaments.
#@Jeffrey L. Poet,Bryan L. Shader
#t2000
#cDiscrete Applied Mathematics
#index837890
#% 
#!
  
#*on Reliable Graphs with Static Routing Plans.
#@Werner Poguntke
#t1994
#cDiscrete Applied Mathematics
#index837891
#% 
#!
  
#*Solving the Max-cut Problem Using Eigenvalues.
#@Svatopluk Poljak,Franz Rendl
#t1995
#cDiscrete Applied Mathematics
#index837892
#% 
#!
  
#*Functorial scaling of ordinal data.
#@Silke Pollandt,Rudolf Wille
#t2005
#cDiscrete Applied Mathematics
#index837893
#% 
#!
  
#*A comparison of Steiner tree relaxations.
#@Tobias Polzin,Siavash Vahdati Daneshmand
#t2001
#cDiscrete Applied Mathematics
#index837894
#% 
#!
  
#*Improved algorithms for the Steiner problem in networks.
#@Tobias Polzin,Siavash Vahdati Daneshmand
#t2001
#cDiscrete Applied Mathematics
#index837895
#% 
#!
  
#*Negative Cycles in Complete Signed Graphs.
#@Dragos Radu Popescu,Ioan Tomescu
#t1996
#cDiscrete Applied Mathematics
#index837896
#% 
#!
  
#*Pruning the Search Tree in the Constructive Enumeration of Molecular Graphs.
#@Jiri Pospichal,Vladimir Kvasnicka
#t1996
#cDiscrete Applied Mathematics
#index837897
#% 
#!
  
#*Redundancy estimates for the Lempel-Ziv algorithm of data compression.
#@V. N. Potapov
#t2004
#cDiscrete Applied Mathematics
#index837898
#% 
#!
  
#*Nonlinear functions in abelian groups and relative difference sets.
#@Alexander Pott
#t2004
#cDiscrete Applied Mathematics
#index837899
#%841904
#%841916
#%841955
#%842207
#%847445
#%864639
#%974379
#%974377
#%975300
#!
  
#*Medians and Majorities in Semimodular Posets.
#@Robert C. Powers
#t2003
#cDiscrete Applied Mathematics
#index837900
#%837497
#%837640
#%853585
#%1061711
#!
  
#*Arrow's Theorem for Closed Weak Hierarchies.
#@Robert C. Powers
#t1996
#cDiscrete Applied Mathematics
#index837901
#% 
#!
  
#*Formal Concept Analysis for General Objects.
#@Susanne Prediger
#t2003
#cDiscrete Applied Mathematics
#index837902
#%290262
#%3006612
#!
  
#*Bounding the probability of the union of events by aggregation and disaggregation in linear programs.
#@András Prékopa,Linchun Gao
#t2005
#cDiscrete Applied Mathematics
#index837903
#%848257
#%852491
#!
  
#*SAT problems with chains of dependent variables.
#@Steven David Prestwich
#t2003
#cDiscrete Applied Mathematics
#index837904
#%12979
#%14938
#%72072
#%133250
#%310547
#%367566
#%744626
#%751887
#%771155
#%931129
#%12888
#!
  
#*Catastrophic Faults in Reconfigurable Systolic Linear Arrays.
#@Roberto De Prisco,Alfredo De Santis
#t1997
#cDiscrete Applied Mathematics
#index837905
#% 
#!
  
#*Recognizing k-path Graphs.
#@Erich Prisner
#t2000
#cDiscrete Applied Mathematics
#index837906
#% 
#!
  
#*Algorithms for Interval Catch Digraphs.
#@Erich Prisner
#t1994
#cDiscrete Applied Mathematics
#index837907
#% 
#!
  
#*Clique Covering and Clique Partition in Generalizations of Line Graphs.
#@Erich Prisner
#t1995
#cDiscrete Applied Mathematics
#index837908
#% 
#!
  
#*Recognizing Clique Graphs of Directed and Rooted Path Graphs.
#@Erich Prisner,Jayme Luiz Szwarcfiter
#t1999
#cDiscrete Applied Mathematics
#index837909
#% 
#!
  
#*Excluding Induced Subgraphs II: Extremal Graphs.
#@Hans Jürgen Prömel,Angelika Steger
#t1993
#cDiscrete Applied Mathematics
#index837910
#% 
#!
  
#*Using Local Adaptations to Reconfigure a Spanning Tree of a Network.
#@Kirk Pruhs
#t1995
#cDiscrete Applied Mathematics
#index837911
#% 
#!
  
#*2-Tree probe interval graphs have a large obstruction set.
#@Natasa Przulj,Derek G. Corneil
#t2005
#cDiscrete Applied Mathematics
#index837912
#%211394
#%610046
#%610809
#%611109
#%837741
#%837644
#%953527
#!
  
#*Hereditary dominating pair graphs.
#@Natasa Przulj,Derek G. Corneil,Ekkehard Köhler
#t2004
#cDiscrete Applied Mathematics
#index837913
#%1058966
#%1061230
#!
  
#*Minimum Dispersion Problems.
#@Abraham P. Punnen,Yash P. Aneja
#t1997
#cDiscrete Applied Mathematics
#index837914
#% 
#!
  
#*Domination analysis of some heuristics for the traveling salesman problem.
#@Abraham P. Punnen,Santosh N. Kabadi
#t2002
#cDiscrete Applied Mathematics
#index837915
#% 
#!
  
#*Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.
#@Abraham P. Punnen,Kunhiraman Nair
#t1994
#cDiscrete Applied Mathematics
#index837916
#% 
#!
  
#*The incidentor coloring of multigraphs and its applications.
#@Artem V. Pyatkin
#t2002
#cDiscrete Applied Mathematics
#index837917
#%851842
#!
  
#*A probabilistic analysis of the multi-period single-sourcing problem.
#@H. Edwin Romeijn,Dolores Romero Morales
#t2001
#cDiscrete Applied Mathematics
#index837918
#% 
#!
  
#*Expanding and forwarding parameters of product graphs.
#@Jianguo Qian,Fuji Zhang
#t2004
#cDiscrete Applied Mathematics
#index837919
#%832804
#%838179
#%838235
#%839343
#%1059658
#%1104914
#!
  
#*Voronoi Diagrams over Dynamic Scenes.
#@Thomas Roos
#t1993
#cDiscrete Applied Mathematics
#index837920
#% 
#!
  
#*Homogeneous bent functions.
#@Chengxin Qu,Jennifer Seberry,Josef Pieprzyk
#t2000
#cDiscrete Applied Mathematics
#index837921
#% 
#!
  
#*Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies.
#@Arnold L. Rosenberg
#t1992
#cDiscrete Applied Mathematics
#index837922
#% 
#!
  
#*Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters.
#@Ronan Quarez
#t2006
#cDiscrete Applied Mathematics
#index837923
#%848287
#!
  
#*Cartels via the modiclus.
#@Joachim Rosenmüller,Peter Sudhölter
#t2004
#cDiscrete Applied Mathematics
#index837924
#%3350275
#%3449661
#!
  
#*The Performance Ratio of Grouping Policies for the Joint Replenishment Problem.
#@Maurice Queyranne,Daning Sun
#t1993
#cDiscrete Applied Mathematics
#index837925
#% 
#!
  
#*The nucleolus of homogeneous games with steps.
#@Joachim Rosenmüller,Peter Sudhölter
#t1994
#cDiscrete Applied Mathematics
#index837926
#% 
#!
  
#*Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs.
#@Maurice Queyranne,Frits C. R. Spieksma
#t1997
#cDiscrete Applied Mathematics
#index837927
#% 
#!
  
#*Characterizations of Max-Balanced Flows.
#@Uriel G. Rothblum,Hans Schneider,Michael H. Schneider
#t1992
#cDiscrete Applied Mathematics
#index837928
#% 
#!
  
#*Algorithmic Characterizations of Interval ordered Hypergraphs and Applications.
#@Alain Quilliot,Sun Xiao Chao
#t1994
#cDiscrete Applied Mathematics
#index837929
#% 
#!
  
#*Efficient embeddings of grids into grids.
#@Markus Röttger,Ulf-Peter Schroeder
#t2001
#cDiscrete Applied Mathematics
#index837930
#% 
#!
  
#*Hybrid grids and the Homing Robot.
#@Joseph Rabinoff
#t2004
#cDiscrete Applied Mathematics
#index837931
#%934322
#!
  
#*The Characteristic Polynomials of Modified Graphs.
#@Peter Rowlinson
#t1996
#cDiscrete Applied Mathematics
#index837932
#% 
#!
  
#*Energy ordering of catacondensed hexagonal systems.
#@Juan Rada
#t2005
#cDiscrete Applied Mathematics
#index837933
#%836861
#!
  
#*Recognition of D-dimensional Monge Arrays.
#@Rüdiger Rudolf
#t1994
#cDiscrete Applied Mathematics
#index837934
#% 
#!
  
#*Variation of the Wiener index under tree transformations.
#@Juan Rada
#t2005
#cDiscrete Applied Mathematics
#index837935
#% 
#!
  
#*The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking).
#@Frank Ruskey,Ming Jiang,Andrew Weston
#t1995
#cDiscrete Applied Mathematics
#index837936
#% 
#!
  
#*Higher order connectivity index of starlike trees.
#@Juan Rada,Oswaldo Araujo
#t2002
#cDiscrete Applied Mathematics
#index837937
#% 
#!
  
#*P-domination in Minimal Imperfect Graphs.
#@Irena Rusu
#t1999
#cDiscrete Applied Mathematics
#index837938
#% 
#!
  
#*Randic Structure of a Graph.
#@Juan Rada,Carlos Uzcátegui
#t2003
#cDiscrete Applied Mathematics
#index837939
#% 
#!
  
#*Domination graphs: examples and counterexamples.
#@Irena Rusu,Jeremy Spinrad
#t2001
#cDiscrete Applied Mathematics
#index837940
#% 
#!
  
#*Randic ordering of chemical trees.
#@Juan Rada,Carlos Uzcátegui
#t2005
#cDiscrete Applied Mathematics
#index837941
#% 
#!
  
#*The Depth and Width of Local Minima in Discrete Solution Spaces.
#@Jennifer Ryan
#t1995
#cDiscrete Applied Mathematics
#index837942
#% 
#!
  
#*Rigidity of multi-story buildings.
#@Norbert Radics
#t2001
#cDiscrete Applied Mathematics
#index837943
#% 
#!
  
#*Enumeration of inequivalent irreducible Goppa codes.
#@John A. Ryan,Patrick Fitzpatrick
#t2006
#cDiscrete Applied Mathematics
#index837944
#% 
#!
  
#*Applications of combinatorics to statics--rigidity of grid.
#@Norbert Radics,András Recski
#t2002
#cDiscrete Applied Mathematics
#index837945
#% 
#!
  
#*Remark on the Dimer Problem.
#@Horst Sachs,Holger Zernitz
#t1994
#cDiscrete Applied Mathematics
#index837946
#% 
#!
  
#*Asymptotic Estimation of the Average Number of Terminal States in DAWGs.
#@Mathieu Raffinot
#t1999
#cDiscrete Applied Mathematics
#index837947
#% 
#!
  
#*Generation of Key Predistribution Schemes Using Secret Sharing Schemes.
#@Germán Sáez
#t2003
#cDiscrete Applied Mathematics
#index837948
#%119769
#%120325
#%775946
#%842091
#%842426
#%3005937
#!
  
#*Integer Programming in VLSI Design.
#@Prabhakar Raghavan
#t1992
#cDiscrete Applied Mathematics
#index837949
#% 
#!
  
#*Minimizing Restricted-Fanout Queries.
#@Yehoshua Sagiv,Yatin P. Saraiya
#t1992
#cDiscrete Applied Mathematics
#index837950
#% 
#!
  
#*on Paving Matroids and a Generalization of MDS Codes.
#@Sanjay Rajpal
#t1995
#cDiscrete Applied Mathematics
#index837951
#% 
#!
  
#*A characterization problem on underlying graphs of line digraphs.
#@Amine El Sahili
#t2005
#cDiscrete Applied Mathematics
#index837952
#%839478
#!
  
#*3-Colorability in P for P-free graphs.
#@Bert Randerath,Ingo Schiermeyer
#t2004
#cDiscrete Applied Mathematics
#index837953
#% 
#!
  
#*Bisecting De Bruijn and Kautz Graphs.
#@José D. P. Rolim,Pavel Tvrdík,Jan Trdlicka,Imrich Vrto
#t1998
#cDiscrete Applied Mathematics
#index837954
#% 
#!
  
#*Approximation algorithms for the optimal -source communication spanning tree.
#@Bang Ye Wu
#t2004
#cDiscrete Applied Mathematics
#index837955
#% 
#!
  
#*Vertex pancyclic graphs.
#@Bert Randerath,Ingo Schiermeyer,Meike Tewes,Lutz Volkmann
#t2002
#cDiscrete Applied Mathematics
#index837956
#%852316
#%852795
#%976161
#!
  
#*Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.
#@G. Sajith,Sanjeev Saxena
#t1996
#cDiscrete Applied Mathematics
#index837957
#% 
#!
  
#*Paroids: A Canonical Format for Combinatorial Optimization.
#@Ronald L. Rardin,Moises Sudit
#t1992
#cDiscrete Applied Mathematics
#index837958
#% 
#!
  
#*A note on greedy algorithms for the maximum weighted independent set problem.
#@Shuichi Sakai,Mitsunori Togasaki,Koichi Yamazaki
#t2003
#cDiscrete Applied Mathematics
#index837959
#%854405
#%854756
#!
  
#*Paroid Search: Generic Local Combinatorial Optimization.
#@Ronald L. Rardin,Moises Sudit
#t1993
#cDiscrete Applied Mathematics
#index837960
#% 
#!
  
#*On kernel-less clique-acyclic orientations of minimally imperfect graphs.
#@Tadashi Sakuma
#t2001
#cDiscrete Applied Mathematics
#index837961
#% 
#!
  
#*On the P4-components of graphs.
#@Thomas Raschle,Klaus Simon
#t2000
#cDiscrete Applied Mathematics
#index837962
#% 
#!
  
#*Repeated-root cyclic and negacyclic codes over a finite chain ring.
#@Ana Salagean
#t2006
#cDiscrete Applied Mathematics
#index837963
#% 
#!
  
#*Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
#@R. Ravi,John D. Kececioglu
#t1998
#cDiscrete Applied Mathematics
#index837964
#% 
#!
  
#*Directed Rectangle-visibility Graphs Have Unbounded Dimension.
#@Kathleen Romanik
#t1997
#cDiscrete Applied Mathematics
#index837965
#% 
#!
  
#*An improved algorithm for the k-source maximum eccentricity spanning trees.
#@Bang Ye Wu
#t2004
#cDiscrete Applied Mathematics
#index837966
#% 
#!
  
#*Broadcasting on [0, L].
#@Krishnamurthi Ravishankar,Suresh Singh
#t1994
#cDiscrete Applied Mathematics
#index837967
#% 
#!
  
#*On nonsystematic perfect binary codes of length 15.
#@A. M. Romanov
#t2004
#cDiscrete Applied Mathematics
#index837968
#%1061706
#!
  
#*On unicyclic graphs whose second largest eigenvalue dose not exceed 1.
#@Guang-Hui Xu
#t2004
#cDiscrete Applied Mathematics
#index837969
#% 
#!
  
#*Asymptotically optimal Gossiping in Radio Networks.
#@Krishnamurthi Ravishankar,Suresh Singh
#t1995
#cDiscrete Applied Mathematics
#index837970
#% 
#!
  
#*A class of greedy algorithms for the generalized assignment problem.
#@H. Edwin Romeijn,Dolores Romero Morales
#t2000
#cDiscrete Applied Mathematics
#index837971
#% 
#!
  
#*On the average similarity degree between solutions of random k-SAT and random CSPs.
#@Ke Xu,Wei Li
#t2004
#cDiscrete Applied Mathematics
#index837972
#% 
#!
  
#*Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing.
#@Arundhati Raychaudhuri
#t1992
#cDiscrete Applied Mathematics
#index837973
#% 
#!
  
#*On Sum Coloring of Graphs.
#@Mohammad R. Salavatipour
#t2003
#cDiscrete Applied Mathematics
#index837974
#%22484
#%233386
#%557743
#%660807
#%847891
#%887133
#%952599
#%953187
#!
  
#*Chemistry and Discrete Mathematics.
#@Ronald C. Read
#t1996
#cDiscrete Applied Mathematics
#index837975
#% 
#!
  
#*A polynomial time algorithm for strong edge coloring of partial -trees.
#@Mohammad R. Salavatipour
#t2004
#cDiscrete Applied Mathematics
#index837976
#%836956
#%836958
#%837637
#%851309
#%952621
#%952716
#%977711
#%977715
#%1058651
#%1058652
#!
  
#*Exchange relations, Dyck paths and copolymer adsorption.
#@A. Rechnitzer,E. J. Janse van Rensburg
#t2004
#cDiscrete Applied Mathematics
#index837977
#%851525
#%854170
#%1089121
#!
  
#*A note on the generalized steiner tree polytope.
#@Juan José Salazar
#t2000
#cDiscrete Applied Mathematics
#index837978
#% 
#!
  
#*Searching in trees.
#@Frank Recker
#t2004
#cDiscrete Applied Mathematics
#index837979
#% 
#!
  
#*Finitely generated distribution algebras.
#@F. I. Salimov
#t2004
#cDiscrete Applied Mathematics
#index837980
#% 
#!
  
#*Some polynomially solvable subcases of the detailed routing problem in VLSI design.
#@András Recski
#t2001
#cDiscrete Applied Mathematics
#index837981
#% 
#!
  
#*Simple Reductions Between 0 Language and Sequence Equivalence Problems.
#@Arto Salomaa
#t1993
#cDiscrete Applied Mathematics
#index837982
#% 
#!
  
#*One-Story Buildings as Tensegrity Frameworks III.
#@András Recski,Werner Schwärzler
#t1992
#cDiscrete Applied Mathematics
#index837983
#% 
#!
  
#*Euclidean Spanner Graphs with Degree Four.
#@Jeffrey S. Salowe
#t1994
#cDiscrete Applied Mathematics
#index837984
#% 
#!
  
#*Rooted Routing in the Plane.
#@Bruce A. Reed
#t1995
#cDiscrete Applied Mathematics
#index837985
#% 
#!
  
#*Vertex-symmetric generalized Moore graphs.
#@Michael Sampels
#t2004
#cDiscrete Applied Mathematics
#index837986
#%660911
#%836307
#%993474
#!
  
#*Preface.
#@Bruce A. Reed,Siang W. Song,Jayme Luiz Szwarcfiter
#t2004
#cDiscrete Applied Mathematics
#index837987
#% 
#!
  
#*Generating Hard and Diverse Test Sets for NP-hard Graph Problems.
#@Laura A. Sanchis
#t1995
#cDiscrete Applied Mathematics
#index837988
#% 
#!
  
#*A unified approach to word occurrence probabilities.
#@Mireille Régnier
#t2000
#cDiscrete Applied Mathematics
#index837989
#% 
#!
  
#*A type-B Tamari poset.
#@Nirit Sandman
#t2004
#cDiscrete Applied Mathematics
#index837990
#%852265
#!
  
#*The k-ball l-path Branch Weight Centroid.
#@K. Brooks Reid
#t1997
#cDiscrete Applied Mathematics
#index837991
#% 
#!
  
#*Broadcasting on recursively decomposable Cayley graphs.
#@Chandra Gowri Sankaran
#t1994
#cDiscrete Applied Mathematics
#index837992
#% 
#!
  
#*Enumerating near-4-regular maps on the sphere and the torus.
#@Han Ren,Yanpei Liu
#t2001
#cDiscrete Applied Mathematics
#index837993
#% 
#!
  
#*Conserved Synteny As a Measure of Genomic Distance.
#@David Sankoff,Joseph H. Nadeau
#t1996
#cDiscrete Applied Mathematics
#index837994
#% 
#!
  
#*An infinite sequence of non-realizable weavings.
#@Dusan Repovs,Arkady Skopenkov,Fulvia Spaggiari
#t2005
#cDiscrete Applied Mathematics
#index837995
#%839160
#!
  
#*Nearly on Line Scheduling of Preemptive Independent Tasks.
#@Eric Sanlaville
#t1995
#cDiscrete Applied Mathematics
#index837996
#% 
#!
  
#*Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP.
#@Mauricio G. C. Resende,Leonidas S. Pitsoulis,Panos M. Pardalos
#t2000
#cDiscrete Applied Mathematics
#index837997
#% 
#!
  
#*Graph splicing systems.
#@Rahul Santhanam,Kamala Krithivasan
#t2006
#cDiscrete Applied Mathematics
#index837998
#%953865
#!
  
#*Periodicity vectors for labelled trees.
#@Antonio Restivo,Pedro V. Silva
#t2003
#cDiscrete Applied Mathematics
#index837999
#%70681
#%1091480
#%1094209
#!
  
#*Unconditionally secure key assignment schemes.
#@Alfredo De Santis,Anna Lisa Ferrara,Barbara Masucci
#t2006
#cDiscrete Applied Mathematics
#index838000
#%570169
#%805457
#%876950
#%931830
#%933663
#%996398
#%1080723
#%1117344
#!
  
#*Preface.
#@Celso C. Ribeiro
#t2006
#cDiscrete Applied Mathematics
#index838001
#% 
#!
  
#*On the number of connected sets with the neighborhood of a given size in a graph.
#@Alexander A. Sapozhenko
#t2001
#cDiscrete Applied Mathematics
#index838002
#% 
#!
  
#*Variable neighborhood search for the degree-constrained minimum spanning tree problem.
#@Celso C. Ribeiro,Maurício C. Souza
#t2002
#cDiscrete Applied Mathematics
#index838003
#%813608
#%885452
#%1121658
#!
  
#*The Set of Reversible 90/150 Cellular Automata Is Regular.
#@Palash Sarkar,Rana Barua
#t1998
#cDiscrete Applied Mathematics
#index838004
#% 
#!
  
#*Some analytic features of algebraic data.
#@Gabriele Ricci
#t2002
#cDiscrete Applied Mathematics
#index838005
#% 
#!
  
#*Computing zeta functions for ordinary formal groups over finite fields.
#@Takakazu Satoh,Yuichiro Taguchi
#t2003
#cDiscrete Applied Mathematics
#index838006
#%42653
#%42791
#!
  
#*Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization.
#@Michael B. Richey,Abraham P. Punnen
#t1992
#cDiscrete Applied Mathematics
#index838007
#% 
#!
  
#*The Parity Path Problem on Some Subclasses of Perfect Graphs.
#@Satyan R. Coorg,C. Pandu Rangan
#t1996
#cDiscrete Applied Mathematics
#index838008
#% 
#!
  
#*Characterization of Test-sets for Overlap-free Morphisms.
#@Gwénaël Richomme,Patrice Séébold
#t1999
#cDiscrete Applied Mathematics
#index838009
#% 
#!
  
#*Optimal ordered binary decision diagrams for read-once formulas.
#@Martin Sauerhoff,Ingo Wegener,Ralph Werchner
#t2000
#cDiscrete Applied Mathematics
#index838010
#% 
#!
  
#*Overlap-free morphisms and finite test-sets.
#@Gwénaël Richomme,Francis Wlazinski
#t2004
#cDiscrete Applied Mathematics
#index838011
#%204259
#%493172
#%494441
#%836105
#%838009
#%933537
#%1092651
#%1094518
#!
  
#*Remarks on Hamiltonian Properties of Powers of Digraphs.
#@Günter Schaar
#t1994
#cDiscrete Applied Mathematics
#index838012
#% 
#!
  
#*Preference modeling on totally ordered sets by the Sugeno integral.
#@Agnès Rico,Michel Grabisch,Christophe Labreuche,Alain Chateauneuf
#t2005
#cDiscrete Applied Mathematics
#index838013
#% 
#!
  
#*A Lower Bound on the Weight Hierarchies of Product Codes.
#@Hans Georg Schaathun,Wolfgang Willems
#t2003
#cDiscrete Applied Mathematics
#index838014
#% 
#!
  
#*Families of non-IRUP instances of the one-dimensional cutting stoc problem.
#@Jürgen Rietz,Guntram Scheithauer,Johannes Terno
#t2002
#cDiscrete Applied Mathematics
#index838015
#% 
#!
  
#*A Faster Algorithm to Recognize Undirected Path Graphs.
#@Alejandro A. Schäffer
#t1993
#cDiscrete Applied Mathematics
#index838016
#% 
#!
  
#*Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems.
#@Giovanni Righini,Marco Trubian
#t1999
#cDiscrete Applied Mathematics
#index838017
#% 
#!
  
#*Drawing Graphs on Rectangular Grids.
#@Markus W. Schäffter
#t1995
#cDiscrete Applied Mathematics
#index838018
#% 
#!
  
#*The commutative closure of a binary slip-language is context-free: a new proof.
#@Michel Rigo
#t2003
#cDiscrete Applied Mathematics
#index838019
#% 
#!
  
#*Scheduling with Forbidden Sets.
#@Markus W. Schäffter
#t1997
#cDiscrete Applied Mathematics
#index838020
#% 
#!
  
#*A simple minimum T-cut algorithm.
#@Romeo Rizzi
#t2003
#cDiscrete Applied Mathematics
#index838021
#% 
#!
  
#*On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection.
#@Edward R. Scheinerman,Ann N. Trenk
#t1993
#cDiscrete Applied Mathematics
#index838022
#% 
#!
  
#*On the mean radius of permutation polytopes.
#@Raymond Robb
#t2005
#cDiscrete Applied Mathematics
#index838023
#%2616
#%210045
#%1051698
#!
  
#*Ramsey Numbers r(K, G) for Connected Graphs G of Order Seven.
#@Annette Schelten,Ingo Schiermeyer
#t1997
#cDiscrete Applied Mathematics
#index838024
#% 
#!
  
#*Phylogeny numbers for graphs with two triangles.
#@Fred S. Roberts,Li Sheng
#t2000
#cDiscrete Applied Mathematics
#index838025
#% 
#!
  
#*Small Cycles in Hamiltonian Graphs.
#@Uwe Schelten,Ingo Schiermeyer
#t1997
#cDiscrete Applied Mathematics
#index838026
#% 
#!
  
#*Phylogeny Numbers.
#@Fred S. Roberts,Li Sheng
#t1998
#cDiscrete Applied Mathematics
#index838027
#% 
#!
  
#*Processor Interconnection Networks from Cayley Graphs.
#@Stephen T. Schibell,Richard M. Stafford
#t1992
#cDiscrete Applied Mathematics
#index838028
#% 
#!
  
#*Characterizations of Consistent Marked Graphs.
#@Fred S. Roberts,Shaoji Xu
#t2003
#cDiscrete Applied Mathematics
#index838029
#%2616
#!
  
#*Computing the minimum DNF representation of Boolean functions defined by intervals.
#@Baruch Schieber,Daniel Geist,Ayal Zaks
#t2005
#cDiscrete Applied Mathematics
#index838030
#%211902
#%285828
#%1095422
#%1127941
#!
  
#*On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets.
#@Fred S. Roberts,Yonghua Xu
#t1994
#cDiscrete Applied Mathematics
#index838031
#% 
#!
  
#*Random Knapsacks with Many Constraints.
#@Kenneth Schilling
#t1994
#cDiscrete Applied Mathematics
#index838032
#% 
#!
  
#*On Broadcasting Multiple Messages in a D-dimensional Grid.
#@Yehuda Roditty,Barack Shoham
#t1997
#cDiscrete Applied Mathematics
#index838033
#% 
#!
  
#*On enumerating all minimal solutions of feedback problems.
#@Benno Schwikowski,Ewald Speckenmeyer
#t2002
#cDiscrete Applied Mathematics
#index838034
#% 
#!
  
#*Linear Trees and RNA Secondary Structure.
#@William R. Schmitt,Michael S. Waterman
#t1994
#cDiscrete Applied Mathematics
#index838035
#% 
#!
  
#*Fast Multiple Alignment of Ungapped DNA Sequences Using Information Theory and a Relaxation Method.
#@Thomas D. Schneider,David N. Mastronarde
#t1996
#cDiscrete Applied Mathematics
#index838036
#% 
#!
  
#*Solving Restricted Line Location Problems via a Dual Interpretation.
#@Anita Schöbel
#t1999
#cDiscrete Applied Mathematics
#index838037
#% 
#!
  
#*The Setup Polyhedron of Series-parallel Posets.
#@Rainer Schrader,Georg Wambach
#t1997
#cDiscrete Applied Mathematics
#index838038
#% 
#!
  
#*Edge-oblique polyhedral graphs.
#@Jens Schreyer,Hansjoachim Walther
#t2004
#cDiscrete Applied Mathematics
#index838039
#%838303
#%849084
#%852750
#!
  
#*Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes.
#@Heiko Schröder,Ondrej Sýkora,Imrich Vrto
#t2004
#cDiscrete Applied Mathematics
#index838040
#%105291
#%267364
#%612217
#%660883
#%836120
#%836403
#%888287
#!
  
#*Discrete tomography by convex-concave regularization and D.C. programming.
#@Thomas Schüle,Christoph Schnörr,Stefan Weber,Joachim Hornegger
#t2005
#cDiscrete Applied Mathematics
#index838041
#%836797
#%2892320
#!
  
#*The Permutahedron of Series-parallel Posets.
#@Andreas S. Schulz
#t1995
#cDiscrete Applied Mathematics
#index838042
#% 
#!
  
#*Suborthogonal Double Covers of the Complete Graph by Stars.
#@Ulrike Schumacher
#t1999
#cDiscrete Applied Mathematics
#index838043
#% 
#!
  
#*The Covering Radius of the Cycle Code of a Graph.
#@Patrick Solé,Thomas Zaslavsky
#t1993
#cDiscrete Applied Mathematics
#index838044
#% 
#!
  
#*Decomposing toroidal graphs into circuits and edges.
#@Baogang Xu,Lusheng Wang
#t2005
#cDiscrete Applied Mathematics
#index838045
#% 
#!
  
#*Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions.
#@Benno Schwikowski,Martin Vingron
#t2003
#cDiscrete Applied Mathematics
#index838046
#%522
#%438196
#%559083
#%622374
#%950268
#%962202
#!
  
#*Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II.
#@Terunao Soneoka,Makoto Imase,Yoshifumi Manabe
#t1996
#cDiscrete Applied Mathematics
#index838047
#% 
#!
  
#*Better Bounds for Perpetual Gossiping.
#@Alex D. Scott
#t1997
#cDiscrete Applied Mathematics
#index838048
#% 
#!
  
#*Super Edge-Connectivity of Dense Digraphs and Graphs.
#@Terunao Soneoka
#t1992
#cDiscrete Applied Mathematics
#index838049
#% 
#!
  
#*Broadcasting multiple messages in a grid.
#@Frances L. Van Scoy,Jeffrey A. Brooks
#t1994
#cDiscrete Applied Mathematics
#index838050
#% 
#!
  
#*On (n, k)-sequences.
#@Hong-Yeop Song,June Bok Lee
#t2000
#cDiscrete Applied Mathematics
#index838051
#% 
#!
  
#*A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem.
#@Maria Grazia Scutellà
#t1998
#cDiscrete Applied Mathematics
#index838052
#% 
#!
  
#*Competition hypergraphs.
#@Martin Sonntag,Hanns-Martin Teichert
#t2004
#cDiscrete Applied Mathematics
#index838053
#% 
#!
  
#*Optimal Binary Trees with Order Constraints.
#@András Sebö,Zeev Waksman
#t1999
#cDiscrete Applied Mathematics
#index838054
#% 
#!
  
#*Some Concepts of Stability Analysis in Combinatorial optimization.
#@Yuri N. Sotskov,V. K. Leontev,Evgenii N. Gordeev
#t1995
#cDiscrete Applied Mathematics
#index838055
#% 
#!
  
#*Reconstructing Minimal Rooted Trees.
#@Charles Semple
#t2003
#cDiscrete Applied Mathematics
#index838056
#%837612
#!
  
#*NP-hardness of Shop-scheduling Problems with Three Jobs.
#@Yuri N. Sotskov,Natalia V. Shakhlevich
#t1995
#cDiscrete Applied Mathematics
#index838057
#% 
#!
  
#*A supertree method for rooted trees.
#@Charles Semple,Mike A. Steel
#t2000
#cDiscrete Applied Mathematics
#index838058
#% 
#!
  
#*Some New Classes of Facets for the Equicut Polytope.
#@Cid C. de Souza,M. Laurent
#t1995
#cDiscrete Applied Mathematics
#index838059
#% 
#!
  
#*On finding a maximum spanning tree of bounded radius.
#@A. I. Serdjukov
#t2001
#cDiscrete Applied Mathematics
#index838060
#% 
#!
  
#*Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study.
#@C. Carvalho de Souza,Celso C. Ribeiro
#t1993
#cDiscrete Applied Mathematics
#index838061
#% 
#!
  
#*Monotone Boolean formulas can approximate monotone linear threshold functions.
#@Rocco A. Servedio
#t2004
#cDiscrete Applied Mathematics
#index838062
#% 
#!
  
#*Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees.
#@Emina Soljanin,Elke Offer
#t2003
#cDiscrete Applied Mathematics
#index838063
#%745643
#!
  
#*Opacity of a finite automaton, method of calculation and the Ising chain.
#@Jia-Yan Yao
#t2003
#cDiscrete Applied Mathematics
#index838064
#%847287
#!
  
#*Linear time approximation scheme for the multiprocessor open shop problem.
#@Sergey V. Sevastianov,Gerhard J. Woeginger
#t2001
#cDiscrete Applied Mathematics
#index838065
#% 
#!
  
#*The Set of Super-stable Marriages Forms a Distributive Lattice.
#@Boris Spieker
#t1995
#cDiscrete Applied Mathematics
#index838066
#% 
#!
  
#*on Some Geometric Methods in Scheduling Theory: A Survey.
#@Sergey Vasil'evich Sevast'janov
#t1994
#cDiscrete Applied Mathematics
#index838067
#% 
#!
  
#*Recognizing quasi-triangulated graphs.
#@Jeremy Spinrad
#t2004
#cDiscrete Applied Mathematics
#index838068
#%851185
#%851376
#%960157
#%993684
#!
  
#*Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem.
#@Farhad Shahrokhi,László A. Székely
#t2001
#cDiscrete Applied Mathematics
#index838069
#% 
#!
  
#*-Trees and Substitution Decomposition.
#@Jeremy Spinrad
#t1992
#cDiscrete Applied Mathematics
#index838070
#% 
#!
  
#*A fully dynamic algorithm for modular decomposition and recognition of cographs.
#@Ron Shamir,Roded Sharan
#t2004
#cDiscrete Applied Mathematics
#index838071
#%70760
#%610337
#%610766
#%611111
#%951220
#%1059009
#%1059504
#!
  
#*Algorithms for Weakly Triangulated Graphs.
#@Jeremy Spinrad,R. Sritharan
#t1995
#cDiscrete Applied Mathematics
#index838072
#% 
#!
  
#*Cluster graph modification problems.
#@Ron Shamir,Roded Sharan,Dekel Tsur
#t2004
#cDiscrete Applied Mathematics
#index838073
#%210022
#%438641
#%660945
#%950456
#%1013773
#%1032565
#!
  
#*Routings for Involutions of a Hypercube.
#@Alan P. Sprague,Hisao Tamaki
#t1994
#cDiscrete Applied Mathematics
#index838074
#% 
#!
  
#*A note on Nordhaus-Gaddum inequalities for domination.
#@Erfang Shan,Chuangyin Dang,Liying Kang
#t2004
#cDiscrete Applied Mathematics
#index838075
#%854219
#!
  
#*Matroid optimization with Generalized Constraints.
#@Mandayam A. Srinivas
#t1995
#cDiscrete Applied Mathematics
#index838076
#% 
#!
  
#*Characterizations of some classes of strong sign nonsingular digraphs.
#@Jia-Yu Shao,Zhi-Xiang Hu
#t2000
#cDiscrete Applied Mathematics
#index838077
#% 
#!
  
#*On Complexity, Representation and Approximation of Integral Multicommodity Flows.
#@Anand Srivastav,Peter Stangier
#t2000
#cDiscrete Applied Mathematics
#index838078
#% 
#!
  
#*Random Walks with Absorbing Points.
#@Louis W. Shapiro
#t1992
#cDiscrete Applied Mathematics
#index838079
#% 
#!
  
#*Weighted Fractional and Integral K-matching in Hypergraphs.
#@Anand Srivastav,Peter Stangier
#t1995
#cDiscrete Applied Mathematics
#index838080
#% 
#!
  
#*Time-relaxed broadcasting in communication networks.
#@Aditya Shastri
#t1998
#cDiscrete Applied Mathematics
#index838081
#% 
#!
  
#*Structure of i-components of perfect binary codes.
#@Faina I. Solov'eva
#t2001
#cDiscrete Applied Mathematics
#index838082
#% 
#!
  
#*A survey on maximum distance holey packings.
#@Jianxing Yin
#t2002
#cDiscrete Applied Mathematics
#index838083
#%841784
#%841716
#%848343
#!
  
#*Special Issue of DAM on the Vapnik-chervonenkis Dimension.
#@John Shawe-Taylor
#t1998
#cDiscrete Applied Mathematics
#index838084
#% 
#!
  
#*On irreversibility of von Neumann additive cellular automata on grids.
#@Nei Y. Soma,J. P. Melo
#t2006
#cDiscrete Applied Mathematics
#index838085
#%837036
#!
  
#*Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem.
#@Wenci Yu
#t1996
#cDiscrete Applied Mathematics
#index838086
#% 
#!
  
#*Bounding Sample Size with the Vapnik-Chervonenkis Dimension.
#@John Shawe-Taylor,Martin Anthony,Norman Biggs
#t1993
#cDiscrete Applied Mathematics
#index838087
#% 
#!
  
#*Tight Approximations for Resource Constrained Scheduling and Bin Packing.
#@Anand Srivastav,Peter Stangier
#t1997
#cDiscrete Applied Mathematics
#index838088
#% 
#!
  
#*On the Nonexistence of Extremal Self-dual Codes.
#@Zhang Shengyuan
#t1999
#cDiscrete Applied Mathematics
#index838089
#% 
#!
  
#*Bisection Width of Transposition Graphs.
#@Ladislav Stacho,Imrich Vrto
#t1998
#cDiscrete Applied Mathematics
#index838090
#% 
#!
  
#*A greedy algorithm for some classes of integer programs.
#@V. V. Shenmaier
#t2003
#cDiscrete Applied Mathematics
#index838091
#%406849
#%1061478
#!
  
#*Selecting Jobs for Scheduling on a Machine Subject to Failure.
#@Wolfgang Stadje
#t1995
#cDiscrete Applied Mathematics
#index838092
#% 
#!
  
#*A greedy algorithm for maximizing a linear objective function.
#@V. V. Shenmaier
#t2004
#cDiscrete Applied Mathematics
#index838093
#% 
#!
  
#*The Complementary Class of Generalized Flow Cover Inequalities.
#@Jan Stallaert
#t1997
#cDiscrete Applied Mathematics
#index838094
#% 
#!
  
#*A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.
#@F. Bruce Shepherd,Lisa Zhang
#t2001
#cDiscrete Applied Mathematics
#index838095
#% 
#!
  
#*Object and image indexing based on region connection calculus and oriented matroid theory.
#@Ernesto Staffetti,Antoni Grau,Francesc Serratosa,Alberto Sanfeliu
#t2005
#cDiscrete Applied Mathematics
#index838096
#%168366
#%883617
#%954988
#%1031107
#%1031402
#%1032317
#%1044591
#!
  
#*A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems.
#@Hanif D. Sherali,Warren P. Adams
#t1994
#cDiscrete Applied Mathematics
#index838097
#% 
#!
  
#*Valid Inequalities and Separation for Capacitated Fixed Charge Flow Problems.
#@Jan Stallaert
#t2000
#cDiscrete Applied Mathematics
#index838098
#% 
#!
  
#*Tighter Representations for Set Partitioning Problems.
#@Hanif D. Sherali,Youngho Lee
#t1996
#cDiscrete Applied Mathematics
#index838099
#% 
#!
  
#*Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony.
#@Mike A. Steel
#t1993
#cDiscrete Applied Mathematics
#index838100
#% 
#!
  
#*A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem.
#@Hanif D. Sherali,Sridhar Ramachandran,Seong-in Kim
#t1994
#cDiscrete Applied Mathematics
#index838101
#% 
#!
  
#*Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results.
#@Mike A. Steel,Michael D. Hendy,David Penny
#t1998
#cDiscrete Applied Mathematics
#index838102
#% 
#!
  
#*A class of web-based facets for the generalized vertex packing problem.
#@Hanif D. Sherali,Jonathan Cole Smith
#t2005
#cDiscrete Applied Mathematics
#index838103
#%1014252
#%1288634
#%3007117
#!
  
#*Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates.
#@George Steiner
#t1997
#cDiscrete Applied Mathematics
#index838104
#% 
#!
  
#*Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations.
#@Hanif D. Sherali,Jonathan Cole Smith,Warren P. Adams
#t2000
#cDiscrete Applied Mathematics
#index838105
#% 
#!
  
#*The maximum traveling salesman problem on van der Veen matrices.
#@George Steiner,Zhihui Xue
#t2005
#cDiscrete Applied Mathematics
#index838106
#%836586
#!
  
#*A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis.
#@C.-J. Richard Shi,Janusz A. Brzozowski
#t1999
#cDiscrete Applied Mathematics
#index838107
#% 
#!
  
#*Fluctuation Bounds for Sock-sorting and Other Stochastic Processes.
#@David Steinsaltz
#t1998
#cDiscrete Applied Mathematics
#index838108
#% 
#!
  
#*Generating the States of a Binary Stochastic System.
#@Douglas R. Shier,E. J. Valvo,Robert E. Jamison
#t1992
#cDiscrete Applied Mathematics
#index838109
#% 
#!
  
#*Complexity of Searching an Immobile Hider in a Graph.
#@Bernhard von Stengel,Ralph Werchner
#t1997
#cDiscrete Applied Mathematics
#index838110
#% 
#!
  
#*A Cost-scaling Algorithm for 0-1 Submodular Flows.
#@Maiko Shigeno,Satoru Iwata
#t1997
#cDiscrete Applied Mathematics
#index838111
#% 
#!
  
#*Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs.
#@Peter W. Stephens
#t1996
#cDiscrete Applied Mathematics
#index838112
#% 
#!
  
#*An Algorithm for Fractional Assignment Problems.
#@Maiko Shigeno,Yasufumi Saruwatari,Tomomi Matsui
#t1995
#cDiscrete Applied Mathematics
#index838113
#% 
#!
  
#*Finding Regular Subgraphs in Both Arbitrary and Planar Graphs.
#@Iain A. Stewart
#t1996
#cDiscrete Applied Mathematics
#index838114
#% 
#!
  
#*Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
#@Sangho Shim,Jozef Sirán,Janez Zerovnik
#t2002
#cDiscrete Applied Mathematics
#index838115
#%836903
#%839343
#%1104914
#!
  
#*Computing Optimal Assignments for Residual Network Reliability.
#@Constantine Stivaros,Klaus Sutner
#t1997
#cDiscrete Applied Mathematics
#index838116
#% 
#!
  
#*A family of Hadamard matrices of dihedral group type.
#@Koichi Shinoda,Mieko Yamada
#t2000
#cDiscrete Applied Mathematics
#index838117
#% 
#!
  
#*Unital designs in planes of order 16.
#@Stoicho D. Stoichev,Vladimir D. Tonchev
#t2000
#cDiscrete Applied Mathematics
#index838118
#% 
#!
  
#*Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
#@Akiyoshi Shioura
#t2004
#cDiscrete Applied Mathematics
#index838119
#%407001
#%838123
#%837748
#%950771
#%977868
#%1014020
#%3006493
#%3005546
#!
  
#*Multiplicative Circulant Networks Topological Properties and Communication Algorithms.
#@Ivan Stojmenovic
#t1997
#cDiscrete Applied Mathematics
#index838120
#% 
#!
  
#*A Constructive Proof for the Induction of M-convex Functions through Networks.
#@Akiyoshi Shioura
#t1998
#cDiscrete Applied Mathematics
#index838121
#% 
#!
  
#*A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length.
#@Leen Stougie
#t1993
#cDiscrete Applied Mathematics
#index838122
#% 
#!
  
#*Minimization of an M-convex Function.
#@Akiyoshi Shioura
#t1998
#cDiscrete Applied Mathematics
#index838123
#% 
#!
  
#*Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds.
#@Vitaly A. Strusevich
#t1995
#cDiscrete Applied Mathematics
#index838124
#% 
#!
  
#*A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings.
#@Keisuke Shiromoto,Leo Storme
#t2003
#cDiscrete Applied Mathematics
#index838125
#%841711
#%847999
#%851300
#!
  
#*A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times.
#@Vitaly A. Strusevich
#t1999
#cDiscrete Applied Mathematics
#index838126
#% 
#!
  
#*The Wiener Number of the Hexagonal Net.
#@Wai Chee Shiu,Peter Che Bor Lam
#t1997
#cDiscrete Applied Mathematics
#index838127
#% 
#!
  
#*Parsimonious Set Representations of Orders, a Generalization of the Interval Order Concept, and Knowledge Spaces.
#@Reinhard Suck
#t2003
#cDiscrete Applied Mathematics
#index838128
#%3005077
#!
  
#*On Wiener numbers of polygonal nets.
#@Wai Chee Shiu,Peter Che Bor Lam,Kin Keung Poon
#t2002
#cDiscrete Applied Mathematics
#index838129
#%838127
#%838131
#%852151
#%854513
#!
  
#*Cut, Paste, Filter.
#@Peggy Sullivan
#t2003
#cDiscrete Applied Mathematics
#index838130
#% 
#!
  
#*Wiener Number of Hexagonal Jagged-rectangles.
#@Wai Chee Shiu,Chong Sze Tong,Peter Che Bor Lam
#t1997
#cDiscrete Applied Mathematics
#index838131
#% 
#!
  
#*Fast Information Sharing in a Complete Network.
#@Vaidy S. Sunderam,Peter Winkler
#t1993
#cDiscrete Applied Mathematics
#index838132
#% 
#!
  
#*On complexity of minimization and compression problems for models of sequential choice.
#@L. A. Sholomov
#t2004
#cDiscrete Applied Mathematics
#index838133
#% 
#!
  
#*Correlation Functions of a Family of Generalized Geometric Sequences.
#@Wei Sun,Yi Xian Yang
#t1997
#cDiscrete Applied Mathematics
#index838134
#% 
#!
  
#*Recognizing Hidden Bicircular Networks.
#@Randy Shull,Alan Shuchat,James B. Orlin,Marianne Lepp
#t1993
#cDiscrete Applied Mathematics
#index838135
#% 
#!
  
#*Sampling properties of the discrete radon transform.
#@Imants D. Svalbe
#t2004
#cDiscrete Applied Mathematics
#index838136
#%1032482
#!
  
#*Cliques That Are Tolerance Digraphs.
#@Randy Shull,Ann N. Trenk
#t1997
#cDiscrete Applied Mathematics
#index838137
#% 
#!
  
#*on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets.
#@Maciej M. Syslo
#t1995
#cDiscrete Applied Mathematics
#index838138
#% 
#!
  
#*Cardinality-restricted Chains and Antichains in Partially ordered Sets.
#@Henry Shum,Leslie E. Trotter Jr.
#t1996
#cDiscrete Applied Mathematics
#index838139
#% 
#!
  
#*The Arborescence-realization Problem.
#@Ramjee P. Swaminathan,Donald K. Wagner
#t1995
#cDiscrete Applied Mathematics
#index838140
#% 
#!
  
#*The Single Loop Representations of Regular Languages.
#@Huei-Jan Shyr,Shyr-Shen Yu
#t1998
#cDiscrete Applied Mathematics
#index838141
#% 
#!
  
#*Exact Classification with Two-layer Neural Nets in N Dimensions.
#@Catherine Z. W. Hassell Sweatman,Gavin J. Gibson,Bernard Mulgrew
#t1998
#cDiscrete Applied Mathematics
#index838142
#% 
#!
  
#*Entity authentication schemes using braid word reduction.
#@Hervé Sibert,Patrick Dehornoy,Marc Girault
#t2006
#cDiscrete Applied Mathematics
#index838143
#%985864
#!
  
#*Homomorphisms of conjunctive normal forms.
#@Stefan Szeider
#t2003
#cDiscrete Applied Mathematics
#index838144
#%71934
#%104660
#%124250
#%624654
#%741092
#%751599
#%836835
#%837445
#%837446
#%838224
#%861073
#%972760
#%974301
#%1091114
#!
  
#*The Optimal Unicyclic Graphs for Pair-Connected Reliability.
#@Kyle Siegrist,Ashok T. Amin,Peter J. Slater
#t1993
#cDiscrete Applied Mathematics
#index838145
#% 
#!
  
#*On the distance function approach to color image enhancement.
#@Marek Szczepanski,Bogdan Smolka,Kostas N. Plataniotis,Anastasios N. Venetsanopoulos
#t2004
#cDiscrete Applied Mathematics
#index838146
#%833662
#%1032708
#!
  
#*The complexity of minimizing and learning OBDDs and FBDDs.
#@Detlef Sieling
#t2002
#cDiscrete Applied Mathematics
#index838147
#%267990
#%283053
#%415967
#%494281
#%494451
#%620820
#%838156
#%861917
#%889441
#%951349
#%951812
#%1078310
#%1078407
#%1079257
#%1079379
#!
  
#*Finding paths in graphs avoiding forbidden transitions.
#@Stefan Szeider
#t2003
#cDiscrete Applied Mathematics
#index838148
#%839256
#%852035
#%975627
#%975629
#!
  
#*The Skeleton of the Symmetric Traveling Salesman Polytope.
#@Gerard Sierksma
#t1993
#cDiscrete Applied Mathematics
#index838149
#% 
#!
  
#*Regular affine tilings and regular maps on a flat torus.
#@J. M. Szucs,D. J. Klein
#t2000
#cDiscrete Applied Mathematics
#index838150
#% 
#!
  
#*Interchange Graphs and the Hamiltonian Cycle Polytope.
#@Gerard Sierksma
#t1998
#cDiscrete Applied Mathematics
#index838151
#% 
#!
  
#*Finding the Pareto-optima for the total and maximum tardiness single machine problem.
#@Roberto Tadei,Andrea Grosso,Federico Della Croce
#t2002
#cDiscrete Applied Mathematics
#index838152
#% 
#!
  
#*Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters.
#@Gerard Sierksma,Ruud H. Teunter
#t2000
#cDiscrete Applied Mathematics
#index838153
#% 
#!
  
#*Theory of 2-3 Heaps.
#@Tadao Takaoka
#t2003
#cDiscrete Applied Mathematics
#index838154
#%73
#%771370
#%776732
#%949610
#%950342
#!
  
#*The Capacity of Monotonic Functions.
#@Joseph Sill
#t1998
#cDiscrete Applied Mathematics
#index838155
#% 
#!
  
#*Hardness of identifying the minimum ordered binary decision diagram.
#@Yasuhiko Takenaga,Shuzo Yajima
#t2000
#cDiscrete Applied Mathematics
#index838156
#% 
#!
  
#*On the Two-connected Planar Spanning Subgraph Polytope.
#@Caterina De Simone,Michael Jünger
#t1997
#cDiscrete Applied Mathematics
#index838157
#% 
#!
  
#*Representing graphs implicitly using almost optimal space.
#@Maurizio Talamo,Paola Vocca
#t2001
#cDiscrete Applied Mathematics
#index838158
#% 
#!
  
#*On the Odd Cycles of Normal Graphs.
#@Caterina De Simone,János Körner
#t1999
#cDiscrete Applied Mathematics
#index838159
#% 
#!
  
#*Efficient m-ary Balanced Codes.
#@Luca G. Tallini,Ugo Vaccaro
#t1999
#cDiscrete Applied Mathematics
#index838160
#% 
#!
  
#*Stability Number of Bull- and Chair-Free Graphs.
#@Caterina De Simone,Antonio Sassano
#t1993
#cDiscrete Applied Mathematics
#index838161
#% 
#!
  
#*The k-centrum multi-facility location problem.
#@Arie Tamir
#t2001
#cDiscrete Applied Mathematics
#index838162
#% 
#!
  
#*Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly.
#@Frank W. Sinden
#t1993
#cDiscrete Applied Mathematics
#index838163
#% 
#!
  
#*A Unifying Location Model on Tree Graphs Based on Submodularity Properties.
#@Arie Tamir
#t1993
#cDiscrete Applied Mathematics
#index838164
#% 
#!
  
#*A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.
#@René Sitters
#t1999
#cDiscrete Applied Mathematics
#index838165
#% 
#!
  
#*Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem.
#@Arie Tamir
#t1998
#cDiscrete Applied Mathematics
#index838166
#% 
#!
  
#*The Average Dimension of the Hull of Cyclic Codes.
#@Gintaras Skersys
#t2003
#cDiscrete Applied Mathematics
#index838167
#%852727
#%994124
#%1061799
#!
  
#*The centdian subtree on tree networks.
#@Arie Tamir,Justo Puerto,Dionisio Pérez-Brito
#t2002
#cDiscrete Applied Mathematics
#index838168
#% 
#!
  
#*A digital analogue of the Jordan curve theorem.
#@Josef Slapal
#t2004
#cDiscrete Applied Mathematics
#index838169
#%834104
#%843597
#%951476
#%1094673
#%1094641
#!
  
#*Deterministic Communication Complexity of Set Intersection.
#@Ulrich Tamm
#t1995
#cDiscrete Applied Mathematics
#index838170
#% 
#!
  
#*A Combinatorial Approach to the Problem of Self-assembly.
#@Yakov S. Smetanich,Yakov B. Kazanovich,Vyacheslav V. Kornilov
#t1995
#cDiscrete Applied Mathematics
#index838171
#% 
#!
  
#*Routing Multiterminal Nets on a Hexagonal Grid.
#@Xuehou Tan,Xiaoyu Song
#t1999
#cDiscrete Applied Mathematics
#index838172
#% 
#!
  
#*Computing large planar regions in terrains, with an application to fracture surfaces.
#@Michiel H. M. Smid,Rahul Ray,Ulrich Wendt,Katharina Lange
#t2004
#cDiscrete Applied Mathematics
#index838173
#%525
#%185865
#%609788
#%622298
#%623169
#%1119513
#!
  
#*A Generalization of the Stable Matching Problem.
#@Jimmy J. M. Tan,Yuang-Cheh Hsueh
#t1995
#cDiscrete Applied Mathematics
#index838174
#% 
#!
  
#*Euclidean Steiner Minimal Trees, Minimum Energy Configurations, and the Embedding Problem of Weighted Graphs in E.
#@J. MacGregor Smith,Badri Toppur
#t1996
#cDiscrete Applied Mathematics
#index838175
#% 
#!
  
#*On the pagenumber of trivalent Cayley graphs.
#@Yuuki Tanaka,Yukio Shibata
#t2006
#cDiscrete Applied Mathematics
#index838176
#%837096
#%934332
#%934275
#%934277
#%1058388
#!
  
#*A New Algorithm for Jordan Sorting: Its Average-Case Analysis.
#@Eduard Sojka
#t1999
#cDiscrete Applied Mathematics
#index838177
#% 
#!
  
#*Distinguished representatives for equivalent labelled stratified graphs and applications.
#@Nicolae Tandareanu
#t2004
#cDiscrete Applied Mathematics
#index838178
#%88
#%290136
#!
  
#*Expanding and Forwarding.
#@Patrick Solé
#t1995
#cDiscrete Applied Mathematics
#index838179
#% 
#!
  
#*Aligning two fragmented sequences.
#@Vamsi Veeramachaneni,Piotr Berman,Webb Miller
#t2003
#cDiscrete Applied Mathematics
#index838180
#%610174
#%621377
#!
  
#*The Covering Radius of Hadamard Codes in Odd Graphs.
#@Patrick Solé,Arif Ghafoor,Sohail Sheikh
#t1992
#cDiscrete Applied Mathematics
#index838181
#% 
#!
  
#*Some Constacyclic Codes Over Zk and Binary Quasi-cyclic Codes.
#@Horacio Tapia-Recillas,Gerardo Vega
#t2003
#cDiscrete Applied Mathematics
#index838182
#% 
#!
  
#*A Polynomial Approximation Scheme for the Subset Sum Problem.
#@Nei Yoshihiro Soma,Alan Solon Ivor Zinober,Horacio Hideki Yanasse,Peter John Harley
#t1995
#cDiscrete Applied Mathematics
#index838183
#% 
#!
  
#*d-minimal Languages.
#@S. S. Yu
#t1998
#cDiscrete Applied Mathematics
#index838184
#% 
#!
  
#*Trading properties and Alexandrov kernels for Boolean functions.
#@Alan D. Taylor,William S. Zwicker
#t2000
#cDiscrete Applied Mathematics
#index838185
#% 
#!
  
#*Tree-decompositions of small pathwidth.
#@Jan Arne Telle
#t2005
#cDiscrete Applied Mathematics
#index838186
#%38786
#%481074
#%493215
#%493212
#%610080
#%837361
#%837719
#%837783
#%887765
#%889631
#%1061056
#%1061230
#!
  
#*Efficient Sets in Partial -Trees.
#@Jan Arne Telle,Andrzej Proskurowski
#t1993
#cDiscrete Applied Mathematics
#index838187
#% 
#!
  
#*Computing discrete logarithms with the parallelized kangaroo method, .
#@Edlyn Teske
#t2003
#cDiscrete Applied Mathematics
#index838188
#%484
#%1012396
#%1012358
#%1012365
#!
  
#*List -Colorings of Graphs.
#@Barry A. Tesman
#t1993
#cDiscrete Applied Mathematics
#index838189
#% 
#!
  
#*Pancyclic orderings of in-tournaments.
#@Meike Tewes
#t2002
#cDiscrete Applied Mathematics
#index838190
#%849055
#%852795
#%974471
#%976255
#!
  
#*The Number of Keys in Relational and Nested Relational Databases.
#@Bernhard Thalheim
#t1992
#cDiscrete Applied Mathematics
#index838191
#% 
#!
  
#*Numerical representation of interval orders.
#@An Ngo The,Alexis Tsoukiàs
#t2005
#cDiscrete Applied Mathematics
#index838192
#% 
#!
  
#*Algorithms and obstructions for linear-width and related search parameters.
#@Dimitrios M. Thilikos
#t2000
#cDiscrete Applied Mathematics
#index838193
#% 
#!
  
#*Minimum matrix representation of some key system.
#@Krisztián Tichler
#t2002
#cDiscrete Applied Mathematics
#index838194
#% 
#!
  
#*A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem.
#@Vadim G. Timkovsky
#t1997
#cDiscrete Applied Mathematics
#index838195
#% 
#!
  
#*Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?.
#@Vadim G. Timkovsky
#t1998
#cDiscrete Applied Mathematics
#index838196
#% 
#!
  
#*Bin-packing and Matchings in Threshold Graphs.
#@Gottfried Tinhofer
#t1995
#cDiscrete Applied Mathematics
#index838197
#% 
#!
  
#*Partitions and Network Reliability.
#@Peter Tittmann
#t1999
#cDiscrete Applied Mathematics
#index838198
#% 
#!
  
#*Some Extremal Properties of the Degree Distance of a Graph.
#@Ioan Tomescu
#t1999
#cDiscrete Applied Mathematics
#index838199
#% 
#!
  
#*Minimum Spanning Hypertrees.
#@Ioan Tomescu,Marius Zimand
#t1994
#cDiscrete Applied Mathematics
#index838200
#% 
#!
  
#*Well Irredundant Graphs.
#@Jerzy Topp,Preben D. Vestergaard
#t1995
#cDiscrete Applied Mathematics
#index838201
#% 
#!
  
#*Illuminating labyrinths.
#@Csaba D. Tóth
#t2004
#cDiscrete Applied Mathematics
#index838202
#%803922
#%836541
#%854554
#%975258
#%978071
#!
  
#*Models, relaxations and exact approaches for the capacitated vehicle routing problem.
#@Paolo Toth,Daniele Vigo
#t2002
#cDiscrete Applied Mathematics
#index838203
#%951211
#%1013605
#%1013648
#!
  
#*Non-approximability of precedence-constrained sequencing to minimize setups.
#@Craig A. Tovey
#t2004
#cDiscrete Applied Mathematics
#index838204
#%1061847
#!
  
#*On the colored Tutte polynomial of a graph of bounded treewidth.
#@Lorenzo Traldi
#t2006
#cDiscrete Applied Mathematics
#index838205
#%267427
#%611068
#%831137
#%851275
#%852092
#%974365
#%1058651
#!
  
#*Generalized Perfect Graphs: Characterizations and Inversion.
#@Ann N. Trenk
#t1995
#cDiscrete Applied Mathematics
#index838206
#% 
#!
  
#*A Group Testing Problem for Hypergraphs of Bounded Rank.
#@Eberhard Triesch
#t1996
#cDiscrete Applied Mathematics
#index838207
#% 
#!
  
#*A Note on Subtrees Rooted Along the Primary Path of a Binary Tree.
#@Brent M. Troutman,Michael R. Karlinger
#t1993
#cDiscrete Applied Mathematics
#index838208
#% 
#!
  
#*No-hole k-tuple (r+1)-distant Colorings.
#@Denise Sakai Troxell
#t1996
#cDiscrete Applied Mathematics
#index838209
#% 
#!
  
#*Monotonicity and positive invariance of linear systems over dioids.
#@Laurent Truffet,Edouard Wagneur
#t2005
#cDiscrete Applied Mathematics
#index838210
#% 
#!
  
#*Bernoulli Numbers and the Probability of a Birthday Surprise.
#@Boaz Tsaban
#t2003
#cDiscrete Applied Mathematics
#index838211
#%817162
#%889411
#%971489
#%3256076
#!
  
#*The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints.
#@Li-Hui Tsai
#t1995
#cDiscrete Applied Mathematics
#index838212
#% 
#!
  
#*A Characterization of PQI Interval Orders.
#@Alexis Tsoukiàs,Philippe Vincke
#t2003
#cDiscrete Applied Mathematics
#index838213
#% 
#!
  
#*Strong branchwidth and local transversals.
#@Zsolt Tuza
#t2005
#cDiscrete Applied Mathematics
#index838214
#%952733
#%977717
#!
  
#*Inequalities for Minimal Covering Sets in Set Systems of Given Rank.
#@Zsolt Tuza
#t1994
#cDiscrete Applied Mathematics
#index838215
#% 
#!
  
#*Uncolorable Mixed Hypergraphs.
#@Zsolt Tuza,Vitaly I. Voloshin
#t2000
#cDiscrete Applied Mathematics
#index838216
#% 
#!
  
#*List Colorings and Reducibility.
#@Zsolt Tuza,Margit Voigt
#t1997
#cDiscrete Applied Mathematics
#index838217
#% 
#!
  
#*Uniform homomorphisms of de Bruijn and Kautz networks.
#@Pavel Tvrdík,Rabah Harbane,Marie-Claude Heydemann
#t1998
#cDiscrete Applied Mathematics
#index838218
#% 
#!
  
#*Reflectiveness and compression of threshold transformations.
#@Takao Ueda
#t2000
#cDiscrete Applied Mathematics
#index838219
#% 
#!
  
#*Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
#@Ryuhei Uehara,Seinosuke Toda,Takayuki Nagoya
#t2005
#cDiscrete Applied Mathematics
#index838220
#%209948
#%861271
#%952558
#%971698
#!
  
#*Induced Permutation Automata and Coverings of Strongly Connected Automata.
#@Kenji Uemura,Takeo Yaku,Kimio Sugita
#t1999
#cDiscrete Applied Mathematics
#index838221
#% 
#!
  
#*Sequential testing of complex systems: a review.
#@Tonguç Ünlüyurt
#t2004
#cDiscrete Applied Mathematics
#index838222
#% 
#!
  
#*on a Partition into Convex Polygons.
#@Masatsugu Urabe
#t1996
#cDiscrete Applied Mathematics
#index838223
#% 
#!
  
#*The Symmetry Rule in Propositional Logic.
#@Alasdair Urquhart
#t1999
#cDiscrete Applied Mathematics
#index838224
#% 
#!
  
#*Genetic Algorithms in Coding Theory - A Table for A().
#@Rob J. M. Vaessens,Emile H. L. Aarts,Jacobus H. van Lint
#t1993
#cDiscrete Applied Mathematics
#index838225
#% 
#!
  
#*Two Machine Openshop Scheduling with Machine-dependent Processing Times.
#@Asoo J. Vakharia,Bülent Çatay
#t1997
#cDiscrete Applied Mathematics
#index838226
#% 
#!
  
#*Detection and recognition of a binary linear code.
#@Antoine Valembois
#t2001
#cDiscrete Applied Mathematics
#index838227
#% 
#!
  
#*Classic Squares and Broadcast Squares.
#@Marcos Valerio,Louise E. Moser,P. M. Melliar-Smith
#t1994
#cDiscrete Applied Mathematics
#index838228
#% 
#!
  
#*Optimal communication algorithms for Manhattan Street networks.
#@Emmanouel A. Varvarigos
#t1998
#cDiscrete Applied Mathematics
#index838229
#% 
#!
  
#*Local spectra of perfect binary codes.
#@Anastasia Yu. Vasil'eva
#t2004
#cDiscrete Applied Mathematics
#index838230
#% 
#!
  
#*Structural Properties of Matroid Matchings.
#@John H. Vande Vate
#t1992
#cDiscrete Applied Mathematics
#index838231
#% 
#!
  
#*Graph-theoretical properties of parallelism in the digital plane.
#@Peter Veelaert
#t2003
#cDiscrete Applied Mathematics
#index838232
#%745467
#%771673
#%834022
#%1339385
#%1339397
#%1339439
#%3003450
#!
  
#*An O() Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices.
#@Jack A. A. van der Veen
#t1993
#cDiscrete Applied Mathematics
#index838233
#% 
#!
  
#*On a Multiconstrained Model for Chromatic Scheduling.
#@Dominique de Werra
#t1999
#cDiscrete Applied Mathematics
#index838234
#% 
#!
  
#*The Forwarding Diameter of Graphs.
#@Wenceslas Fernandez de la Vega,Mohamed El Haddad,Daniel Barraez,Oscar Ordaz
#t1998
#cDiscrete Applied Mathematics
#index838235
#% 
#!
  
#*on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation.
#@Dominique de Werra
#t1994
#cDiscrete Applied Mathematics
#index838236
#% 
#!
  
#*The task allocation problem with constant communication.
#@Wenceslas Fernandez de la Vega,M. Lamari
#t2003
#cDiscrete Applied Mathematics
#index838237
#%415045
#%621821
#%949759
#%1080488
#%1127574
#%1129603
#!
  
#*Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219).
#@Dominique de Werra,Jacek Blazewicz
#t1993
#cDiscrete Applied Mathematics
#index838238
#% 
#!
  
#*The Forwarding Index of Communication Networks with Given Connectivity.
#@Wenceslas Fernandez de la Vega,Yannis Manoussakis
#t1992
#cDiscrete Applied Mathematics
#index838239
#% 
#!
  
#*A hypocoloring model for batch scheduling.
#@Dominique de Werra,Marc Demange,Jérôme Monnot,Vangelis Th. Paschos
#t2005
#cDiscrete Applied Mathematics
#index838240
#%623072
#%660364
#%660639
#%809507
#%836194
#%851198
#%3078687
#!
  
#*An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.
#@Wenceslas Fernandez de la Vega,Vassilis Zissimopoulos
#t1998
#cDiscrete Applied Mathematics
#index838241
#% 
#!
  
#*On a Graph-theoretical Model for Cyclic Register Allocation.
#@Dominique de Werra,Christine Eisenbeis,Sylvain Lelait,Bruno Marmol
#t1999
#cDiscrete Applied Mathematics
#index838242
#% 
#!
  
#*Characterizing convexity of games using marginal vectors.
#@Bas van Velzen,Herbert Hamers,Henk Norde
#t2004
#cDiscrete Applied Mathematics
#index838243
#%836974
#%836973
#!
  
#*Optimal detection of two counterfeit coins with two-arms balance.
#@Wen An Liu,Zan Kan Nie
#t2004
#cDiscrete Applied Mathematics
#index838244
#%836223
#%836225
#%854457
#!
  
#*A novel use of t-packings to construct d-disjunct matrices.
#@Hung-Lin Fu,Frank K. Hwang
#t2006
#cDiscrete Applied Mathematics
#index838245
#% 
#!
  
#*Minimizing maximum indegree.
#@Venkat Venkateswaran
#t2004
#cDiscrete Applied Mathematics
#index838246
#%3007117
#!
  
#*Cut Invariant D and Bond orders of Kekuléan Benzenoids.
#@He Wenchen,He Wenjie,He Ying
#t1996
#cDiscrete Applied Mathematics
#index838247
#% 
#!
  
#*Two classes of edge domination in graphs.
#@Baogen Xu
#t2006
#cDiscrete Applied Mathematics
#index838248
#%849264
#%849140
#%851702
#!
  
#*The Complexity of Multidimensional Periodic Scheduling.
#@Wim F. J. Verhaegh,Paul E. R. Lippens,Emile H. L. Aarts,Jef L. van Meerbergen,Albert van der Werf
#t1998
#cDiscrete Applied Mathematics
#index838249
#% 
#!
  
#*Construction of sports schedules with multiple venues.
#@Dominique de Werra,Tinaz Ekim,C. Raess
#t2006
#cDiscrete Applied Mathematics
#index838250
#%839324
#!
  
#*Solving problems for maximal reducible flowgraphs.
#@Oswaldo Vernet,Lilian Markenzon
#t2004
#cDiscrete Applied Mathematics
#index838251
#%413874
#%546665
#%577207
#%950625
#%953560
#%1061749
#!
  
#*Chromatic Scheduling and Frequency Assignment.
#@Dominique de Werra,Y. Gay
#t1994
#cDiscrete Applied Mathematics
#index838252
#% 
#!
  
#*Compatible Euler Tours of K**.
#@Helen Verrall
#t1998
#cDiscrete Applied Mathematics
#index838253
#% 
#!
  
#*Restrictions and Preassignments in Preemptive open Shop Scheduling.
#@Dominique de Werra,Alan J. Hoffman,Nadimpalli V. R. Mahadev,Uri N. Peled
#t1996
#cDiscrete Applied Mathematics
#index838254
#% 
#!
  
#*Compatible Hamilton Decompositions of Directed Wrapped Butterfly Graphs.
#@Helen Verrall
#t1999
#cDiscrete Applied Mathematics
#index838255
#% 
#!
  
#*Preassignment Requirements in Chromatic Scheduling.
#@Dominique de Werra,Nadimpalli V. R. Mahadev
#t1997
#cDiscrete Applied Mathematics
#index838256
#% 
#!
  
#*Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays.
#@Jacques Verriet
#t2000
#cDiscrete Applied Mathematics
#index838257
#% 
#!
  
#*Recognition problems and communication complexity.
#@Gábor Wiener
#t2004
#cDiscrete Applied Mathematics
#index838258
#% 
#!
  
#*Recognizing pseudo-median graphs.
#@Aleksander Vesel
#t2002
#cDiscrete Applied Mathematics
#index838259
#% 
#!
  
#*The many benefits of putting stack filters into disjunctive or conjunctive normal form.
#@Marcel Wild
#t2005
#cDiscrete Applied Mathematics
#index838260
#%1059107
#%1095222
#!
  
#*The complexity of arc-colorings for directed hypergraphs.
#@Andrea Vietri
#t2004
#cDiscrete Applied Mathematics
#index838261
#%368233
#%836842
#%836884
#%838261
#%1058478
#%1061292
#%1191885
#%3003185
#!
  
#*A Manhattan Channel Router with Good Theoretical and Practical Performance.
#@Charlotte Wieners-Lummer
#t1992
#cDiscrete Applied Mathematics
#index838262
#% 
#!
  
#*The Underlying Graph of a Line Digraph.
#@Jorge Luis Villar
#t1992
#cDiscrete Applied Mathematics
#index838263
#% 
#!
  
#*Pairs of graphs with site and bond percolation critical probabilities in opposite orders.
#@John C. Wierman
#t2003
#cDiscrete Applied Mathematics
#index838264
#% 
#!
  
#*A framework for the greedy algorithm.
#@Andrew Vince
#t2002
#cDiscrete Applied Mathematics
#index838265
#%2616
#!
  
#*Consistent formulas for estimating the total lengths of trees.
#@Stephen J. Willson
#t2005
#cDiscrete Applied Mathematics
#index838266
#%836607
#!
  
#*The integrity of a cubic graph.
#@A. Vince
#t2004
#cDiscrete Applied Mathematics
#index838267
#%609970
#%835997
#%852787
#%932532
#%932682
#%972537
#!
  
#*On Paths with the Shortest Average Arc Length in Weighted Graphs.
#@Shmuel Wimer,Israel Koren,Israel Cederbaum
#t1993
#cDiscrete Applied Mathematics
#index838268
#% 
#!
  
#*Alignment Networks and Electrical Networks.
#@Martin Vingron,Michael S. Waterman
#t1996
#cDiscrete Applied Mathematics
#index838269
#% 
#!
  
#*Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs.
#@Pawel Winter
#t1993
#cDiscrete Applied Mathematics
#index838270
#% 
#!
  
#*On connected list colorings of graphs.
#@Vadym G. Vizing
#t2001
#cDiscrete Applied Mathematics
#index838271
#% 
#!
  
#*Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers.
#@Pawel Winter,Maciej M. Syslo
#t1994
#cDiscrete Applied Mathematics
#index838272
#% 
#!
  
#*On Hyperedge Replacement and BNLC Graph Grammars.
#@Walter Vogler
#t1993
#cDiscrete Applied Mathematics
#index838273
#% 
#!
  
#*Short trees in polygons.
#@Pawel Winter,Martin Zachariasen,Jens Nielsen
#t2002
#cDiscrete Applied Mathematics
#index838274
#%1060280
#!
  
#*A Probabilistic Analysis of the Maximal Covering Location Problem.
#@Rakesh Vohra,Nicholas G. Hall
#t1993
#cDiscrete Applied Mathematics
#index838275
#% 
#!
  
#*Reload cost problems: minimum diameter spanning tree.
#@Hans-Christoph Wirth,Jan Steffan
#t2001
#cDiscrete Applied Mathematics
#index838276
#% 
#!
  
#*Chromatic Number of Prime Distance Graphs.
#@Margit Voigt,Hansjoachim Walther
#t1994
#cDiscrete Applied Mathematics
#index838277
#% 
#!
  
#*Vertex-distinguishing Edge-colorings of 2-regular Graphs.
#@P. Wittmann
#t1997
#cDiscrete Applied Mathematics
#index838278
#% 
#!
  
#*on Graphs with Equal Domination and Covering Numbers.
#@Lutz Volkmann
#t1994
#cDiscrete Applied Mathematics
#index838279
#% 
#!
  
#*A note on the depth function of combinatorial optimization problems.
#@Gerhard J. Woeginger
#t2001
#cDiscrete Applied Mathematics
#index838280
#% 
#!
  
#*Signed domatic number of a graph.
#@Lutz Volkmann,Bohdan Zelinka
#t2005
#cDiscrete Applied Mathematics
#index838281
#%854283
#%854289
#%854299
#!
  
#*On the approximability of average completion time scheduling under precedence constraints.
#@Gerhard J. Woeginger
#t2003
#cDiscrete Applied Mathematics
#index838282
#%836408
#%839414
#%1061396
#!
  
#*A novel giant-subgraph phase-transition in sparse random -partite graphs.
#@Ulrich Voll
#t2005
#cDiscrete Applied Mathematics
#index838283
#% 
#!
  
#*Sensitivity Analysis for Knapsack Problems: Another Negative Result.
#@Gerhard J. Woeginger
#t1999
#cDiscrete Applied Mathematics
#index838284
#% 
#!
  
#*Circular mixed hypergraphs II: The upper chromatic number.
#@Vitaly I. Voloshin,Heinz-Jürgen Voss
#t2006
#cDiscrete Applied Mathematics
#index838285
#%836293
#%838216
#%849042
#%851480
#%852170
#!
  
#*Coloring Edges of Self-complementary Graphs.
#@A. Pawel Wojda,Malgorzata Zwonek
#t1997
#cDiscrete Applied Mathematics
#index838286
#% 
#!
  
#*Steiner's Problem in Graphs: Heuristic Methods.
#@Stefan Voß
#t1992
#cDiscrete Applied Mathematics
#index838287
#% 
#!
  
#*Semidefinite programming for discrete optimization and matrix completion problems.
#@Henry Wolkowicz,Miguel F. Anjos
#t2002
#cDiscrete Applied Mathematics
#index838288
#%835858
#%950456
#%1013675
#%1013705
#%1014143
#%1013929
#%1014132
#%2892352
#%2892359
#!
  
#*Two Remarks on "Expanding and Forwarding" By P. Solé.
#@Imrich Vrto
#t1995
#cDiscrete Applied Mathematics
#index838289
#% 
#!
  
#*Semidefinite Programming Relaxations for the Graph Partitioning Problem.
#@Henry Wolkowicz,Qing Zhao
#t1999
#cDiscrete Applied Mathematics
#index838290
#% 
#!
  
#*NP-completeness of Some Edge-disjoint Paths Problems.
#@Jens Vygen
#t1995
#cDiscrete Applied Mathematics
#index838291
#% 
#!
  
#*Representation Theory and Invariant Neural Networks.
#@Jeffrey Wood,John Shawe-Taylor
#t1996
#cDiscrete Applied Mathematics
#index838292
#% 
#!
  
#*Efficient Fault-Tolerant Fixed Routings on ( + 1)-Connected Digraphs.
#@Koichi Wada,Kimio Kawaguchi
#t1992
#cDiscrete Applied Mathematics
#index838293
#% 
#!
  
#*Monotonicity of Single-seat Preferential Election Rules.
#@Douglas R. Woodall
#t1997
#cDiscrete Applied Mathematics
#index838294
#% 
#!
  
#*Critical Edges in Perfect Line Graphs and some Polyhedral Consequences.
#@Annegret Wagler
#t1999
#cDiscrete Applied Mathematics
#index838295
#% 
#!
  
#*Embedding Graphs of Small Size.
#@Mariusz Wozniak
#t1994
#cDiscrete Applied Mathematics
#index838296
#% 
#!
  
#*On the Complexity of the Embedding Problem for Hypercube Related Graphs.
#@Alan Wagner,Derek G. Corneil
#t1993
#cDiscrete Applied Mathematics
#index838297
#% 
#!
  
#*Approximation algorithms for the shortest total path length spanning tree problem.
#@Bang Ye Wu,Kun-Mao Chao,Chuan Yi Tang
#t2000
#cDiscrete Applied Mathematics
#index838298
#% 
#!
  
#*An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.
#@Dorothea Wagner,Frank Wagner
#t1992
#cDiscrete Applied Mathematics
#index838299
#% 
#!
  
#*Approximation algorithms for some optimum communication spanning tree problems.
#@Bang Ye Wu,Kun-Mao Chao,Chuan Yi Tang
#t2000
#cDiscrete Applied Mathematics
#index838300
#% 
#!
  
#*A family of restricted subadditive recursion.
#@Roger J. Wallace
#t2002
#cDiscrete Applied Mathematics
#index838301
#% 
#!
  
#*The Shields-Harary Number for Wheel and Broken Wheel Graphs.
#@Jared Wunsch
#t1995
#cDiscrete Applied Mathematics
#index838302
#% 
#!
  
#*Polyhedral graphs with extreme numbers of types of faces.
#@Hansjoachim Walther
#t2002
#cDiscrete Applied Mathematics
#index838303
#% 
#!
  
#*On the Average Hamming Distance for Binary Codes.
#@Shutao Xia,Fangwei Fu
#t1998
#cDiscrete Applied Mathematics
#index838304
#% 
#!
  
#*Polyhedral Graphs Without Hamiltonian Cycles.
#@Hansjoachim Walther
#t1997
#cDiscrete Applied Mathematics
#index838305
#% 
#!
  
#*On the Average Hamming Distance for Binary Codes.
#@Shutao Xia,Fangwei Fu
#t1999
#cDiscrete Applied Mathematics
#index838306
#% 
#!
  
#*Vertex-pancyclicity of edge-face-total graphs.
#@Wei-Fan Wang
#t2004
#cDiscrete Applied Mathematics
#index838307
#%837558
#%849119
#%978369
#!
  
#*Homogeneous bent functions of degree in variables do not exist for ge3.
#@Tianbing Xia,Jennifer Seberry,Josef Pieprzyk,Chris Charnes
#t2004
#cDiscrete Applied Mathematics
#index838308
#% 
#!
  
#*Nested chain partitions of LYM posets.
#@Yi Wang
#t2005
#cDiscrete Applied Mathematics
#index838309
#%853907
#!
  
#*An infinite family of Goethals-Seidel arrays.
#@Mingyuan Xia,Tianbing Xia,Jennifer Seberry,Jing Wu
#t2005
#cDiscrete Applied Mathematics
#index838310
#% 
#!
  
#*The (2, 1)-labelling of trees.
#@Wei-Fan Wang
#t2006
#cDiscrete Applied Mathematics
#index838311
#% 
#!
  
#*Linear symmetries of Boolean functions.
#@Wenjun Xiao
#t2005
#cDiscrete Applied Mathematics
#index838312
#%930606
#%1058880
#!
  
#*An algorithm for solving partial differential parametric systems.
#@Jimin Wang,Xiao-Shan Gao
#t2004
#cDiscrete Applied Mathematics
#index838313
#%449268
#%449546
#%449539
#%993927
#%1090615
#!
  
#*Parallel machine scheduling with splitting jobs.
#@Wenxun Xing,Jiawei Zhang
#t2000
#cDiscrete Applied Mathematics
#index838314
#% 
#!
  
#*Families of integral trees with diameters 4, 6, and 8.
#@Ligong Wang,Xueliang Li,Shenggui Zhang
#t2004
#cDiscrete Applied Mathematics
#index838315
#% 
#!
  
#*Sparse networks tolerating random faults.
#@Toshinori Yamada,Kumiko Nomura,Shuichi Ueno
#t2004
#cDiscrete Applied Mathematics
#index838316
#%614631
#%798147
#%851138
#%931258
#%931554
#%1077859
#%1078477
#!
  
#*The Exponent of the Primitive Cayley Digraphs on Finite Abelian Groups.
#@Jian-Zhong Wang,Ji-Xiang Meng
#t1997
#cDiscrete Applied Mathematics
#index838317
#% 
#!
  
#*Finding all the negative cycles in a directed graph.
#@Takeo Yamada,Harunobu Kinoshita
#t2002
#cDiscrete Applied Mathematics
#index838318
#% 
#!
  
#*Fixed topology alignment with recombination.
#@Lusheng Wang,Bin Ma,Ming Li
#t2000
#cDiscrete Applied Mathematics
#index838319
#% 
#!
  
#*On sequential diagnosis of multiprocessor systems.
#@Toshinori Yamada,Takashi Ohtsuka,Akitsugu Watanabe,Shuichi Ueno
#t2005
#cDiscrete Applied Mathematics
#index838320
#%2022
#%989089
#%1080150
#%1081459
#!
  
#*Completeness of temporal logics over infinite intervals.
#@Hanpin Wang,Qiwen Xu
#t2004
#cDiscrete Applied Mathematics
#index838321
#%114612
#%484609
#%552640
#!
  
#*On approximation intractability of the path-distance-width problem.
#@Koichi Yamazaki
#t2001
#cDiscrete Applied Mathematics
#index838322
#% 
#!
  
#*k-NLC Graphs and Polynomial Algorithms.
#@Egon Wanke
#t1994
#cDiscrete Applied Mathematics
#index838323
#% 
#!
  
#*Quasi-threshold Graphs.
#@Jing-Ho Yan,Jer-Jeong Chen,Gerard J. Chang
#t1996
#cDiscrete Applied Mathematics
#index838324
#% 
#!
  
#*Solving satisfiability problems using elliptic approximations - effective branching rules.
#@Joost P. Warners,Hans van Maaren
#t2000
#cDiscrete Applied Mathematics
#index838325
#% 
#!
  
#*k-Path Partitions in Trees.
#@Jing-Ho Yan,Gerard J. Chang,Sandra Mitchell Hedetniemi,Stephen T. Hedetniemi
#t1997
#cDiscrete Applied Mathematics
#index838326
#% 
#!
  
#*Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
#@Joost P. Warners,Hans van Maaren
#t2000
#cDiscrete Applied Mathematics
#index838327
#% 
#!
  
#*Heredity of the index of convergence of the line digraph.
#@Weigen Yan,Fuji Zhang
#t2003
#cDiscrete Applied Mathematics
#index838328
#%851922
#!
  
#*A Potential Reduction Approach to the Frequency Assignment Problem.
#@Joost P. Warners,Tamás Terlaky,Cornelis Roos,Benjamin Jansen
#t1997
#cDiscrete Applied Mathematics
#index838329
#% 
#!
  
#*Enumeration of perfect matchings of a type of Cartesian products of graphs.
#@Weigen Yan,Fuji Zhang
#t2006
#cDiscrete Applied Mathematics
#index838330
#%622722
#%838393
#%975122
#%976447
#!
  
#*How to Cut a Cake Fairly Using a Minimal Number of Cuts.
#@William A. Webb
#t1997
#cDiscrete Applied Mathematics
#index838331
#% 
#!
  
#*On the LU factorization of the Vandermonde matrix.
#@Sheng-Liang Yang
#t2005
#cDiscrete Applied Mathematics
#index838332
#% 
#!
  
#*BDDs--design, analysis, complexity, and applications.
#@Ingo Wegener
#t2004
#cDiscrete Applied Mathematics
#index838333
#%131550
#%132517
#%209882
#%210068
#%210364
#%283053
#%494451
#%620216
#%620820
#%838010
#%861087
#%861917
#%862020
#%878912
#%930118
#%931393
#%933875
#%934410
#%951812
#%971473
#%1060243
#%1078310
#%1078408
#%1078407
#%1079379
#!
  
#*An approximation algorithm for scheduling two parallel machines with capacity constraints.
#@Heng Yang,Yinyu Ye,Jiawei Zhang
#t2003
#cDiscrete Applied Mathematics
#index838334
#%104806
#%211311
#%211802
#%622131
#%623033
#%623256
#%950456
#%951514
#%951616
#%1060565
#!
  
#*Review of combinatorial problems induced by spatial forest harvesting planning.
#@Andres Weintraub,Alan T. Murray
#t2006
#cDiscrete Applied Mathematics
#index838335
#%1289912
#%1290024
#!
  
#*Matrix and combinatorics solutions of Boolean differential equations.
#@Svetlana N. Yanushkevich
#t2002
#cDiscrete Applied Mathematics
#index838336
#% 
#!
  
#*Insertion Techniques for the Heuristic Solution of the Job Shop Problem.
#@Frank Werner,Andreas Winkler
#t1995
#cDiscrete Applied Mathematics
#index838337
#% 
#!
  
#*A note on worst-case performance of heuristics for maintenance scheduling problems.
#@Xiangtong Qi
#t2007
#cDiscrete Applied Mathematics
#index838338
#% 
#!
  
#*The effect of side-information on smooth entropy.
#@Bo Yang,Tong Zhang,Changxing Pei
#t2004
#cDiscrete Applied Mathematics
#index838339
#% 
#!
  
#*On the commutativity of antiblocker diagrams under lift-and-project operators.
#@Mariana S. Escalante,Graciela L. Nasini,M. C. Varaldo
#t2006
#cDiscrete Applied Mathematics
#index838340
#%835877
#%1013083
#%1013075
#%1013437
#%1014248
#!
  
#*Pancyclic out-arcs of a Vertex in Tournaments.
#@Tianxing Yao,Yubao Guo,Kemin Zhang
#t2000
#cDiscrete Applied Mathematics
#index838341
#% 
#!
  
#*Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].
#@Refael Hassin,Shlomi Rubinstein
#t2006
#cDiscrete Applied Mathematics
#index838342
#% 
#!
  
#*Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs.
#@Hong-Gwa Yeh,Gerard J. Chang
#t1998
#cDiscrete Applied Mathematics
#index838343
#% 
#!
  
#*Application of an optimization problem in Max-Plus algebra to scheduling problems.
#@Jean-Louis Bouquard,Christophe Lenté,Jean-Charles Billaut
#t2006
#cDiscrete Applied Mathematics
#index838344
#% 
#!
  
#*Graph Transformations Which Preserve the Multiplicity of an Eigenvalue.
#@Yeong-Nan Yeh,Ivan Gutman,Chin-Mei Fu
#t1996
#cDiscrete Applied Mathematics
#index838345
#% 
#!
  
#*Supply chain scheduling: Sequence coordination.
#@Alessandro Agnetis,Nicholas G. Hall,Dario Pacciarelli
#t2006
#cDiscrete Applied Mathematics
#index838346
#%1290037
#!
  
#*The Disjunctivities of w-languages.
#@Y. T. Yeh,S. S. Yu
#t2003
#cDiscrete Applied Mathematics
#index838347
#% 
#!
  
#*Preface.
#@Ulrich Faigle,Johann Hurink,Stefan Wolfgang Pickl
#t2006
#cDiscrete Applied Mathematics
#index838348
#% 
#!
  
#*The Weighted Perfect Domination Problem and Its Variants.
#@Chain-Chin Yen,Richard C. T. Lee
#t1996
#cDiscrete Applied Mathematics
#index838349
#% 
#!
  
#*New Z-cyclic triplewhist frames and triplewhist tournament designs.
#@R. Julian R. Abel,Norman J. Finizio,Gennian Ge,Malcolm Greig
#t2006
#cDiscrete Applied Mathematics
#index838350
#% 
#!
  
#*Matchings in colored bipartite networks.
#@Tongnyoul Yi,Katta G. Murty,Cosimo Spera
#t2002
#cDiscrete Applied Mathematics
#index838351
#% 
#!
  
#*A new family of proximity graphs: Class cover catch digraphs.
#@Jason DeVinney,Carey E. Priebe
#t2006
#cDiscrete Applied Mathematics
#index838352
#%751484
#%1156607
#%1292155
#!
  
#*Maximum Number of Disjoint Paths Connecting Specified Terminals in a Graph.
#@Hananya Yinnone
#t1994
#cDiscrete Applied Mathematics
#index838353
#% 
#!
  
#*On robust identification in the square and king grids.
#@Tero Laihonen
#t2006
#cDiscrete Applied Mathematics
#index838354
#%846967
#%864795
#%976295
#%976294
#%1059501
#%1060992
#%1061214
#%1078780
#!
  
#*On Paths Avoiding Forbidden Pairs of Vertices in a Graph.
#@Hananya Yinnone
#t1997
#cDiscrete Applied Mathematics
#index838355
#% 
#!
  
#*An O(n logn) algorithm for the optimal sink location problem in dynamic tree networks.
#@Satoko Mamada,Takeaki Uno,Kazuhisa Makino,Satoru Fujishige
#t2006
#cDiscrete Applied Mathematics
#index838356
#% 
#!
  
#*Affine equivalence in the AES round function.
#@Amr M. Youssef,Stafford E. Tavares
#t2005
#cDiscrete Applied Mathematics
#index838357
#%75663
#%120164
#%120280
#%193316
#%217175
#!
  
#*Permutations of separable preference orders.
#@Jonathan K. Hodge
#t2006
#cDiscrete Applied Mathematics
#index838358
#% 
#!
  
#*Discrete convexity: convexity for functions defined on discrete spaces.
#@Ümit Yüceer
#t2002
#cDiscrete Applied Mathematics
#index838359
#%1014020
#!
  
#*Searching for a counterfeit coin with b-balance.
#@Wen An Liu,Huan Huan Cui,Bing Qing Ma
#t2006
#cDiscrete Applied Mathematics
#index838360
#% 
#!
  
#*Parallel algorithms for separable permutations.
#@V. Yugandhar,Sanjeev Saxena
#t2005
#cDiscrete Applied Mathematics
#index838361
#%147
#%110658
#%210837
#%651149
#%887263
#%887201
#%931849
#%952656
#%952655
#%953543
#%1025650
#%1058591
#%1058926
#%1059183
#!
  
#*Lower and upper orientable strong radius and strong diameter of complete k-partite graphs.
#@Huifang Miao,Xiaofeng Guo
#t2006
#cDiscrete Applied Mathematics
#index838362
#%847389
#!
  
#*Cyclic distance-preserving codes on a constant-weight basis.
#@A. J. van Zanten
#t2001
#cDiscrete Applied Mathematics
#index838363
#% 
#!
  
#*Minimum edge ranking spanning trees of split graphs.
#@Kazuhisa Makino,Yushi Uno,Toshihide Ibaraki
#t2006
#cDiscrete Applied Mathematics
#index838364
#%415789
#%837473
#%839119
#%953386
#%972404
#%1061052
#!
  
#*A Sequencing Problem with Family Setup Times.
#@Stanislaw Zdrzalka
#t1996
#cDiscrete Applied Mathematics
#index838365
#% 
#!
  
#*Optimal key systems.
#@Kristina Crona
#t2006
#cDiscrete Applied Mathematics
#index838366
#% 
#!
  
#*Application of Coding Theory to Interconnection Networks.
#@Gilles Zémor,Gérard D. Cohen
#t1992
#cDiscrete Applied Mathematics
#index838367
#% 
#!
  
#*Locally minimal uniformly oriented shortest networks.
#@Marcus Brazil,D. A. Thomas,J. F. Weng
#t2006
#cDiscrete Applied Mathematics
#index838368
#%415748
#%1058706
#%1060636
#!
  
#*An on-line bin-batching problem.
#@Guochuan Zhang
#t2001
#cDiscrete Applied Mathematics
#index838369
#% 
#!
  
#*Path-fan Ramsey numbers.
#@A. N. M. Salman,Hajo Broersma
#t2006
#cDiscrete Applied Mathematics
#index838370
#%851213
#!
  
#*Studies on Hypergraphs I: Hyperforests.
#@Lianwen Zhang
#t1993
#cDiscrete Applied Mathematics
#index838371
#% 
#!
  
#*On the binary projective codes with dimension 6.
#@Iliya Bouyukliev
#t2006
#cDiscrete Applied Mathematics
#index838372
#%841973
#%842311
#%842563
#%847121
#%848937
#%851950
#%853533
#%854027
#%953319
#!
  
#*A New Version of On-line Variable-sized Bin Packing.
#@Guochuan Zhang
#t1997
#cDiscrete Applied Mathematics
#index838373
#% 
#!
  
#*A concentration bound for the longest increasing subsequence of a randomly chosen involution.
#@Marcos A. Kiwi
#t2006
#cDiscrete Applied Mathematics
#index838374
#%976611
#!
  
#*Acyclic Molecules with Greatest HOMO-LUMO Separation.
#@Fuji Zhang,Chang An
#t1999
#cDiscrete Applied Mathematics
#index838375
#% 
#!
  
#*A bijection between permutations and floorplans, and its applications.
#@Eyal Ackerman,Gill Barequet,Ron Y. Pinter
#t2006
#cDiscrete Applied Mathematics
#index838376
#%53234
#%282291
#%609741
#%852344
#%930157
#%1117970
#!
  
#*Ordering graphs with small index and its application.
#@Fuji Zhang,Zhibo Chen
#t2002
#cDiscrete Applied Mathematics
#index838377
#%838375
#!
  
#*The game chromatic index of forests of maximum degree Delta>=5.
#@Stephan Dominique Andres
#t2006
#cDiscrete Applied Mathematics
#index838378
#% 
#!
  
#*Local Multiple Alignment Via Subgraph Enumeration.
#@Z. Zhang,B. He,Webb C. Miller
#t1996
#cDiscrete Applied Mathematics
#index838379
#% 
#!
  
#*Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees.
#@Martin Charles Golumbic,Aviad Mintz,Udi Rotics
#t2006
#cDiscrete Applied Mathematics
#index838380
#%132281
#%282177
#%839345
#%853657
#%887285
#%931986
#%949538
#%950620
#%952621
#%952955
#%971609
#%1058651
#%1059356
#%1090228
#!
  
#*Cell rotation graphs of strongly connected orientations of plane graphs with an application.
#@Heping Zhang,Peter Che Bor Lam,Wai Chee Shiu
#t2003
#cDiscrete Applied Mathematics
#index838381
#%838393
#%838389
#%975387
#%978597
#!
  
#*Well-covered graphs and factors.
#@Bert Randerath,Preben D. Vestergaard
#t2006
#cDiscrete Applied Mathematics
#index838382
#%848788
#%851960
#%852379
#%854809
#%975646
#!
  
#*Hexagonal Systems with Fixed Bonds.
#@Fuji Zhang,Xueliang Li,Heping Zhang
#t1993
#cDiscrete Applied Mathematics
#index838383
#% 
#!
  
#*Single machine scheduling with controllable release and processing parameters.
#@Natalia V. Shakhlevich,Vitaly A. Strusevich
#t2006
#cDiscrete Applied Mathematics
#index838384
#%838124
#%839420
#%1290037
#!
  
#*On optimally- transitive graphs.
#@Zhao Zhang,Jixiang Meng
#t2006
#cDiscrete Applied Mathematics
#index838385
#% 
#!
  
#*Multicommodity flows in cycle graphs.
#@Young-Soo Myung
#t2006
#cDiscrete Applied Mathematics
#index838386
#%836843
#%953639
#%1061639
#!
  
#*Improved approximations for max set splitting and max NAE SAT.
#@Jiawei Zhang,Yinyu Ye,Qiaoming Han
#t2004
#cDiscrete Applied Mathematics
#index838387
#% 
#!
  
#*Complexity of minimizing the total flow time with interval data and minmax regret criterion.
#@Vasilij Lebedev,Igor Averbakh
#t2006
#cDiscrete Applied Mathematics
#index838388
#%1054474
#!
  
#*Plane elementary bipartite graphs.
#@Heping Zhang,Fuji Zhang
#t2000
#cDiscrete Applied Mathematics
#index838389
#% 
#!
  
#*The elimination procedure for the competition number is not optimal.
#@Stephen G. Hartke
#t2006
#cDiscrete Applied Mathematics
#index838390
#%837358
#%838027
#!
  
#*The Clar Covering Polynomial of Hexagonal Systems I.
#@Heping Zhang,Fuji Zhang
#t1996
#cDiscrete Applied Mathematics
#index838391
#% 
#!
  
#*On a certain class of nonideal clutters.
#@Gabriela R. Argiroffo,Silvia M. Bianchi,Graciela L. Nasini
#t2006
#cDiscrete Applied Mathematics
#index838392
#%835879
#%975847
#%1013083
#%1014248
#%1014246
#!
  
#*A Note on the Number of Perfect Matchings of Bipartite Graphs.
#@Fuji Zhang,Heping Zhang
#t1997
#cDiscrete Applied Mathematics
#index838393
#% 
#!
  
#*Efficient automatic simulation of parallel computation on networks of workstations.
#@Christos Kaklamanis,Danny Krizanc,Manuela Montangero,Giuseppe Persiano
#t2006
#cDiscrete Applied Mathematics
#index838394
#%723
#%211290
#%621318
#%621262
#%621765
#%776642
#%951394
#%614068
#!
  
#*On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs.
#@Huaxiao Zhang,Fuji Zhang,Qiongxiang Huang
#t1997
#cDiscrete Applied Mathematics
#index838395
#% 
#!
  
#*Improved bottleneck domination algorithms.
#@Ton Kloks,Dieter Kratsch,Chuan-Min Lee,Jiping Liu
#t2006
#cDiscrete Applied Mathematics
#index838396
#%22579
#%610940
#%660771
#%851455
#%1058651
#%1061125
#%1061595
#!
  
#*Z-transformation graphs of maximum matchings of plane bipartite graphs.
#@Heping Zhang,Rijun Zha,Haiyuan Yao
#t2004
#cDiscrete Applied Mathematics
#index838397
#% 
#!
  
#*Minimal average cost of searching for a counterfeit coin: Restricted model.
#@Wen An Liu,Hong Yong Ma
#t2006
#cDiscrete Applied Mathematics
#index838398
#%836223
#%836225
#%837559
#%838244
#%853989
#%854457
#%1093958
#!
  
#*(2+f(n))-SAT and its properties.
#@Yunlei Zhao,Xiaotie Deng,Chan H. Lee,Hong Zhu
#t2004
#cDiscrete Applied Mathematics
#index838399
#% 
#!
  
#*On bent functions with some symmetric properties.
#@Ying Zhao,Huiling Li
#t2006
#cDiscrete Applied Mathematics
#index838400
#%192907
#%864971
#!
  
#*A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
#@Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki
#t2003
#cDiscrete Applied Mathematics
#index838401
#%610609
#%610797
#%950463
#%1059341
#!
  
#*Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit.
#@Mingjun Edward Yan,Tsunehiko Kameda
#t2006
#cDiscrete Applied Mathematics
#index838402
#%489576
#%564405
#%588685
#%596834
#%609965
#%610474
#!
  
#*On generalized greedy splitting algorithms for multiway partition problems.
#@Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki
#t2004
#cDiscrete Applied Mathematics
#index838403
#%268056
#%622428
#%1058998
#%1060378
#%3006755
#!
  
#*Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem.
#@Babacar Thiongane,Anass Nagih,Gérard Plateau
#t2006
#cDiscrete Applied Mathematics
#index838404
#%885431
#%1013845
#%1290046
#!
  
#*Parallel Machine Scheduling with Time Dependent Processing Times.
#@Chen Zhi-Long
#t1996
#cDiscrete Applied Mathematics
#index838405
#% 
#!
  
#*A competitive and cooperative approach to propositional satisfiability.
#@Katsumi Inoue,Takehide Soh,Seiji Ueda,Yoshito Sasaura,Mutsunori Banbara,Naoyuki Tamura
#t2006
#cDiscrete Applied Mathematics
#index838406
#%12398
#%117433
#%133250
#%574908
#%621778
#%744492
#%744974
#%745867
#%771155
#%994836
#%1034185
#!
  
#*On the Relations Between Arboricity and Independent Number Or Covering Number.
#@Zhongfu Zhang,Linzhong Liu,Jianxun Zhang,Jianfang Wang
#t1998
#cDiscrete Applied Mathematics
#index838407
#% 
#!
  
#*Some formulations for the group steiner tree problem.
#@Carlos Eduardo Ferreira,Fernando M. de Oliveira Filho
#t2006
#cDiscrete Applied Mathematics
#index838408
#%660877
#%741606
#%837978
#%952980
#%1013543
#%1058998
#!
  
#*A continuous approach for the concave cost supply problem via DC programming and DCA.
#@Le Thi Hoai An,Pham Dinh Tao
#t2008
#cDiscrete Applied Mathematics
#index838409
#%2892166
#!
  
#*The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II.
#@Huishan Zhou
#t1993
#cDiscrete Applied Mathematics
#index838410
#% 
#!
  
#*Domination analysis for minimum multiprocessor scheduling.
#@Gregory Gutin,Tommy R. Jensen,Anders Yeo
#t2006
#cDiscrete Applied Mathematics
#index838411
#%73
#%837020
#%837915
#%950677
#%952567
#%974556
#%1051922
#!
  
#*On Aggregating Two Linear Diophantine Equations.
#@Nan Zhu,Kevin A. Broughan
#t1998
#cDiscrete Applied Mathematics
#index838412
#% 
#!
  
#*The infection time of graphs.
#@Tassos Dimitriou,Sotiris E. Nikoletseas,Paul G. Spirakis
#t2006
#cDiscrete Applied Mathematics
#index838413
#%525
#%544360
#%614238
#%614545
#%622370
#%838132
#%988489
#%1012468
#%1061228
#!
  
#*On Constructing the Elimination Tree.
#@Younzhou Zhu,David Mutchler
#t1994
#cDiscrete Applied Mathematics
#index838414
#% 
#!
  
#*Bounded-hops power assignment in ad hoc wireless networks.
#@Gruia Calinescu,Sanjiv Kapoor,Mohammad Sarwat
#t2006
#cDiscrete Applied Mathematics
#index838415
#%267333
#%384698
#%415292
#%506373
#%622234
#%622912
#%816480
#%837402
#%932137
#%953216
#%953403
#%1015591
#%1090148
#%1092603
#%1341767
#!
  
#*Chordal Rings as Fault-Tolerant Loops.
#@Guy W. Zimmerman,Abdol-Hossein Esfahanian
#t1992
#cDiscrete Applied Mathematics
#index838416
#% 
#!
  
#*The t-median function on graphs.
#@Fred R. McMorris,Henry Martyn Mulder,Robert C. Powers
#t2006
#cDiscrete Applied Mathematics
#index838417
#% 
#!
  
#*On the complexity of the dual method for maximum balanced flows.
#@Uwe Zimmermann
#t1994
#cDiscrete Applied Mathematics
#index838418
#% 
#!
  
#*Digraph matrix partitions and trigraph homomorphisms.
#@Tomás Feder,Pavol Hell,Kim Tucker-Nally
#t2006
#cDiscrete Applied Mathematics
#index838419
#%2616
#%481202
#%610145
#%610487
#%620336
#%621948
#%836572
#%837116
#%839231
#%952930
#%1059157
#%1060815
#%1061081
#%1091066
#%1092339
#!
  
#*Subtrees of Bipartite Digraphs - The Minimum Degree Condition.
#@Irmina A. Ziolo
#t2000
#cDiscrete Applied Mathematics
#index838420
#% 
#!
  
#*The vehicle routing problem with flexible time windows and traveling times.
#@Hideki Hashimoto,Toshihide Ibaraki,Shinji Imahori,Mutsunori Yagiura
#t2006
#cDiscrete Applied Mathematics
#index838421
#%885510
#%924088
#%1288526
#%2884762
#!
  
#*Algorithm for recognizing Cartesian graph bundles.
#@Blaz Zmazek,Janez Zerovnik
#t2002
#cDiscrete Applied Mathematics
#index838422
#%612210
#%849306
#%849305
#%852617
#%854568
#!
  
#*A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.
#@Irène Charon,Olivier Hudry
#t2006
#cDiscrete Applied Mathematics
#index838423
#%407600
#%852597
#!
  
#*The obnoxious center problem on weighted cactus graphs.
#@Blaz Zmazek,Janez Zerovnik
#t2004
#cDiscrete Applied Mathematics
#index838424
#%73
#%809531
#%837310
#%932385
#%952776
#%953671
#%988337
#%1061135
#%1061836
#!
  
#*Reoptimization gaps versus model errors in online-dispatching of service units for ADAC.
#@Benjamin Hiller,Sven Oliver Krumke,Jörg Rambau
#t2006
#cDiscrete Applied Mathematics
#index838425
#%186348
#!
  
#*Locally bounded hereditary subclasses of k-colourable graphs.
#@Igor E. Zverovich
#t2001
#cDiscrete Applied Mathematics
#index838426
#% 
#!
  
#*Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
#@Scott T. Chapman,Pedro A. García-Sánchez,D. Llena,José Carlos Rosales
#t2006
#cDiscrete Applied Mathematics
#index838427
#%117264
#%563582
#%887495
#%993647
#!
  
#*Extension of Hereditary Classes with Substitutions.
#@Igor E. Zverovich
#t2003
#cDiscrete Applied Mathematics
#index838428
#%836106
#%851204
#%933205
#!
  
#*Density condensation of Boolean formulas.
#@Youichi Hanatani,Takashi Horiyama,Kazuo Iwama
#t2006
#cDiscrete Applied Mathematics
#index838429
#%211756
#%493868
#%610791
#%620394
#%771155
#%861361
#%950130
#%952955
#%972760
#!
  
#*Minimum degree algorithms for stability number.
#@Igor E. Zverovich
#t2003
#cDiscrete Applied Mathematics
#index838430
#%847927
#!
  
#*Hard coloring problems in low degree planar bipartite graphs.
#@Miroslav Chlebík,Janka Chlebíková
#t2006
#cDiscrete Applied Mathematics
#index838431
#%92875
#%836194
#%837207
#%837426
#%853215
#%852421
#%1060982
#%1061320
#!
  
#*Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes.
#@Igor E. Zverovich
#t2005
#cDiscrete Applied Mathematics
#index838432
#%836081
#%3005498
#!
  
#*On the least size of a graph with a given degree set.
#@Amitabha Tripathi,Sujith Vijay
#t2006
#cDiscrete Applied Mathematics
#index838433
#% 
#!
  
#*An approximation algorithm for the pickup and delivery vehicle routing problem on trees.
#@Naoki Katoh,Taihei Yano
#t2006
#cDiscrete Applied Mathematics
#index838434
#%812826
#!
  
#*NP-completeness results for edge modification problems.
#@Pablo Burzyn,Flavia Bonomo,Guillermo Durán
#t2006
#cDiscrete Applied Mathematics
#index838435
#%611113
#%660863
#%798033
#%837707
#%838072
#%850714
#%931558
#%952870
#%953577
#%1059009
#%1061832
#!
  
#*The complexity of detecting fixed-density clusters.
#@Klaus Holzapfel,Sven Kosub,Moritz G. Maaß,Hanjo Täubig
#t2006
#cDiscrete Applied Mathematics
#index838436
#%46606
#%131869
#%768088
#%794613
#%835951
#%837782
#%952625
#%1059273
#%3401318
#!
  
#*Hamiltonian path saturated graphs with small size.
#@Aneta Dudek,Gyula Y. Katona,A. Pawel Wojda
#t2006
#cDiscrete Applied Mathematics
#index838437
#%836057
#%852695
#%1061170
#!
  
#*How to collect balls moving in the Euclidean plane.
#@Yuichi Asahiro,Takashi Horiyama,Kazuhisa Makino,Hirotaka Ono,Toshinori Sakuma,Masafumi Yamashita
#t2006
#cDiscrete Applied Mathematics
#index838438
#%1058463
#%3005546
#!
  
#*A new trust region technique for the maximum weight clique problem.
#@Stanislav Busygin
#t2006
#cDiscrete Applied Mathematics
#index838439
#%622555
#%2892042
#%2892077
#!
  
#*Bernoulli matrix and its algebraic properties.
#@Zhizheng Zhang,Jun Wang
#t2006
#cDiscrete Applied Mathematics
#index838440
#%837501
#!
  
#*An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints.
#@Maurizio Bruglieri,Matthias Ehrgott,Horst W. Hamacher,Francesco Maffioli
#t2006
#cDiscrete Applied Mathematics
#index838441
#%210737
#%415249
#%610705
#%611025
#%611333
#%624055
#%836285
#%837782
#%861707
#%949588
#%950456
#%950929
#%950928
#%951026
#%952718
#%952719
#%952914
#%977715
#%1060076
#%1060565
#%1061754
#%1078416
#%1092762
#%3006755
#%3005546
#%111297
#!
  
#*Dyck paths and restricted permutations.
#@Toufik Mansour,Eva Yu-Ping Deng,Rosena R. X. Du
#t2006
#cDiscrete Applied Mathematics
#index838442
#%846903
#%851523
#%854267
#!
  
#*A stabilized column generation scheme for the traveling salesman subtour problem.
#@Andreas Westerlund,Maud Göthe-Lundgren,Torbjörn Larsson
#t2006
#cDiscrete Applied Mathematics
#index838443
#%610613
#%812276
#%813825
#%839403
#%851675
#%924030
#%1013384
#%1013734
#%1275195
#%1288548
#!
  
#*Hamiltonicity and colorings of arrangement graphs.
#@Stefan Felsner,Ferran Hurtado,Marc Noy,Ileana Streinu
#t2006
#cDiscrete Applied Mathematics
#index838444
#%82098
#%836749
#%930808
#%931904
#%974635
#%978212
#%1059093
#!
  
#*A Boolean measure of similarity.
#@Martin Anthony,Peter L. Hammer
#t2006
#cDiscrete Applied Mathematics
#index838445
#%109333
#%109244
#%390462
#%985121
#!
  
#*Fast algorithms for identifying maximal common connected sets of interval graphs.
#@Fabien Coulon,Mathieu Raffinot
#t2006
#cDiscrete Applied Mathematics
#index838446
#%118671
#%620339
#%933475
#%1060205
#%1089195
#%1091696
#!
  
#*Approximation algorithms for the bi-criteria weighted MAX-CUT problem.
#@Eric Angel,Evripidis Bampis,Laurent Gourvès
#t2006
#cDiscrete Applied Mathematics
#index838447
#%211553
#%609903
#%611270
#%622132
#%836285
#%950456
#%1054367
#%3003567
#!
  
#*Some results on diameters of Cayley graphs.
#@Wenjun Xiao
#t2006
#cDiscrete Applied Mathematics
#index838448
#% 
#!
  
#*Competitive algorithms for the bicriteria k-server problem.
#@Michele Flammini,Gaia Nicosia
#t2006
#cDiscrete Applied Mathematics
#index838449
#% 
#!
  
#*Subpancyclicity of line graphs and degree sums along paths.
#@Liming Xiong,Hajo Broersma
#t2006
#cDiscrete Applied Mathematics
#index838450
#%847709
#%849258
#%851768
#%854676
#%854743
#!
  
#*Coloring copoints of a planar point set.
#@Walter Morris
#t2006
#cDiscrete Applied Mathematics
#index838451
#%851456
#!
  
#*Fully dynamic recognition algorithm and certificate for directed cographs.
#@Christophe Crespelle,Christophe Paul
#t2006
#cDiscrete Applied Mathematics
#index838452
#% 
#!
  
#*A similarity transform for linear finite state machines.
#@Dimitri Kagaris
#t2006
#cDiscrete Applied Mathematics
#index838453
#%448939
#!
  
#*lambda-Coloring matrogenic graphs.
#@Tiziana Calamoneri,Rossella Petreschi
#t2006
#cDiscrete Applied Mathematics
#index838454
#% 
#!
  
#*M-equipackable graphs.
#@Yuqin Zhang,Yonghui Fan
#t2006
#cDiscrete Applied Mathematics
#index838455
#% 
#!
  
#*Orthogonal art galleries with interior walls.
#@Joan Hutchinson,André Kündgen
#t2006
#cDiscrete Applied Mathematics
#index838456
#%836541
#!
  
#*Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
#@Keizo Miyata,Shigeru Masuyama,Shin-ichi Nakayama,Liang Zhao
#t2006
#cDiscrete Applied Mathematics
#index838457
#%610941
#%836609
#%837473
#%839119
#%933718
#%933773
#%953386
#%1061052
#!
  
#*Polyhedral results for the bipartite induced subgraph problem.
#@Pierre Fouilhoux,Ali Ridha Mahjoub
#t2006
#cDiscrete Applied Mathematics
#index838458
#%976029
#%1061091
#%1061194
#%1191345
#%3007117
#!
  
#*On the characterization of the domination of a diameter-constrained network reliability model.
#@Héctor Cancela,Louis Petingi
#t2006
#cDiscrete Applied Mathematics
#index838459
#%837402
#%1024492
#!
  
#*Preface.
#@Naoki Katoh,Hiro Ito
#t2006
#cDiscrete Applied Mathematics
#index838460
#% 
#!
  
#*On error-tolerant DNA screening.
#@Weili Wu,Yaochun Huang,Xiao Huang,Yingshu Li
#t2006
#cDiscrete Applied Mathematics
#index838461
#%848056
#!
  
#*Sparse connectivity certificates via MA orderings in graphs.
#@Hiroshi Nagamochi
#t2006
#cDiscrete Applied Mathematics
#index838462
#%837756
#%953088
#%1061645
#%1090984
#!
  
#*Clique-critical graphs: Maximum size and recognition.
#@Liliana Alcón
#t2006
#cDiscrete Applied Mathematics
#index838463
#%851910
#!
  
#*On the connectivity of close to regular multipartite tournaments.
#@Lutz Volkmann,Stefan Winzen
#t2006
#cDiscrete Applied Mathematics
#index838464
#%849088
#!
  
#*The first order definability of graphs: Upper bounds for quantifier depth.
#@Oleg Pikhurko,Helmut Veith,Oleg Verbitsky
#t2006
#cDiscrete Applied Mathematics
#index838465
#%622185
#%887643
#%1052131
#%1095062
#!
  
#*On some properties of base-matroids.
#@Francesco Maffioli,Norma Zagaglia Salvi
#t2006
#cDiscrete Applied Mathematics
#index838466
#%836592
#!
  
#*Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models.
#@Philipp Friese,Jörg Rambau
#t2006
#cDiscrete Applied Mathematics
#index838467
#%186348
#%622471
#%747966
#%837098
#%1009361
#%1091092
#%1092764
#%1288679
#%1288736
#!
  
#*Some basic properties of multiple Hamiltonian covers.
#@Hans L. Fetter
#t2006
#cDiscrete Applied Mathematics
#index838468
#% 
#!
  
#*On the structure of the adjacency matrix of the line digraph of a regular digraph.
#@Simone Severini
#t2006
#cDiscrete Applied Mathematics
#index838469
#%932100
#!
  
#*Two-tuple balance of non-binary sequences with ideal two-level autocorrelation.
#@Guang Gong,Hong-Yeop Song
#t2006
#cDiscrete Applied Mathematics
#index838470
#% 
#!
  
#*Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile.
#@Guillermo Durán,Thomas M. Liebling,Martín Matamala
#t2006
#cDiscrete Applied Mathematics
#index838471
#% 
#!
  
#*Generalized metarationalities in the graph model for conflict resolution.
#@Dao-Zhi Zeng,Liping Fang,Keith W. Hipel,D. Marc Kilgour
#t2006
#cDiscrete Applied Mathematics
#index838472
#%3355645
#!
  
#*Approximating the minimum clique cover and other hard problems in subtree filament graphs.
#@J. Mark Keil,Lorna Stewart
#t2006
#cDiscrete Applied Mathematics
#index838473
#%81703
#%620872
#%620873
#%803442
#%837393
#%931337
#%931791
#%953577
#%1058566
#%1093753
#%1093896
#!
  
#*Maximizing breaks and bounding solutions to the mirrored traveling tournament problem.
#@Sebastián Urrutia,Celso C. Ribeiro
#t2006
#cDiscrete Applied Mathematics
#index838474
#%117288
#%839324
#!
  
#*New upper bounds on Lee codes.
#@Jörn Quistorff
#t2006
#cDiscrete Applied Mathematics
#index838475
#%841755
#%846998
#!
  
#*Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs.
#@Toshimasa Ishii,Masayuki Hagiwara
#t2006
#cDiscrete Applied Mathematics
#index838476
#%837756
#%952499
#%1061347
#%1061645
#!
  
#*Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences.
#@Stanislaw Gawiejnowicz,Wieslaw Kurc,Lidia Pankowska
#t2006
#cDiscrete Applied Mathematics
#index838477
#%740569
#%813636
#%838405
#%931353
#!
  
#*On graphs on n vertices having an identifying code of cardinality [log(n+1)].
#@Julien Moncel
#t2006
#cDiscrete Applied Mathematics
#index838478
#% 
#!
  
#*An analysis of the redundancy of graph invariants used in chemoinformatics.
#@Boris Hollas
#t2006
#cDiscrete Applied Mathematics
#index838479
#% 
#!
  
#*The (alpha, beta, s, t)-diameter of graphs: A particular case of conditional diameter.
#@J. A. Rodríguez
#t2006
#cDiscrete Applied Mathematics
#index838480
#% 
#!
  
#*The sandwich problem for cutsets: Clique cutset, k-star cutset.
#@Rafael B. Teixeira,Celina M. Herrera de Figueiredo
#t2006
#cDiscrete Applied Mathematics
#index838481
#% 
#!
  
#*Algorithms for clique-independent sets on subclasses of circular-arc graphs.
#@Guillermo Durán,Min Chih Lin,Sergio Mera,Jayme Luiz Szwarcfiter
#t2006
#cDiscrete Applied Mathematics
#index838482
#%929848
#%931791
#%953009
#%975421
#%1061113
#%1061166
#!
  
#*Complexity results on restricted instances of a paint shop problem for words.
#@Paul S. Bonsma,Thomas Epping,Winfried Hochstättler
#t2006
#cDiscrete Applied Mathematics
#index838483
#%836693
#%861924
#%931783
#%931781
#%949573
#%1088756
#!
  
#*Preface.
#@Philippe Chrétienne
#t2006
#cDiscrete Applied Mathematics
#index838484
#% 
#!
  
#*L(2, 1)-labelings of Cartesian products of two cycles.
#@Christopher Schwarz,Denise Sakai Troxell
#t2006
#cDiscrete Applied Mathematics
#index838485
#%837309
#%847714
#%848356
#%854494
#%1061170
#%1061385
#%1061419
#%1061777
#!
  
#*Erratum to "Reduction of symmetric configurations n" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]
#@Eckhard Steffen,Tomaz Pisanski,Marko Boben,Natasa Ravnik
#t2006
#cDiscrete Applied Mathematics
#index838486
#% 
#!
  
#*Optimal strategies for equal-sum dice games.
#@Bart De Schuymer,Hans De Meyer,Bernard De Baets
#t2006
#cDiscrete Applied Mathematics
#index838487
#% 
#!
  
#*Clutter nonidealness.
#@Gabriela R. Argiroffo,Silvia M. Bianchi,Graciela L. Nasini
#t2006
#cDiscrete Applied Mathematics
#index838488
#%406819
#%835879
#%975847
#%1013083
#%1013437
#%1061661
#!
  
#*Two equivalent measures on weighted hypergraphs.
#@Hiro Ito,Hiroshi Nagamochi
#t2006
#cDiscrete Applied Mathematics
#index838489
#%612219
#%803424
#%837145
#%3349880
#!
  
#*A combinatorial algorithm for weighted stable sets in bipartite graphs.
#@Ulrich Faigle,Gereon Frahling
#t2006
#cDiscrete Applied Mathematics
#index838490
#%953002
#!
  
#*On maximum planar induced subgraphs.
#@Luerbio Faria,Celina M. Herrera de Figueiredo,Sylvain Gravier,Candido Ferreira Xavier de Mendonça Neto,Jorge Stolfi
#t2006
#cDiscrete Applied Mathematics
#index838491
#%623296
#%836730
#%836731
#%952685
#%953602
#!
  
#*On the combinatorial structure of chromatic scheduling polytopes.
#@Javier Marenco,Annegret Wagler
#t2006
#cDiscrete Applied Mathematics
#index838492
#%838252
#!
  
#*Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks.
#@Dmitrii Lozovanu,Stefan Pickl
#t2007
#cDiscrete Applied Mathematics
#index838493
#% 
#!
  
#*An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic.
#@Jinfeng Feng,Shengjia Li,Ruijuan Li
#t2006
#cDiscrete Applied Mathematics
#index838494
#% 
#!
  
#*On non-rank facets of stable set polytopes of webs with clique number four.
#@Arnaud Pêcher,Annegret Wagler
#t2006
#cDiscrete Applied Mathematics
#index838495
#%837860
#%975813
#%1014246
#!
  
#*Existence of directedwhist tournaments with the three person property 3PDWh(v).
#@Frank E. Bennett,Gennian Ge
#t2006
#cDiscrete Applied Mathematics
#index838496
#% 
#!
  
#*A modified greedy algorithm for dispersively weighted 3-set cover.
#@Toshihiro Fujito,Tsuyoshi Okumura
#t2006
#cDiscrete Applied Mathematics
#index838497
#%610703
#%835994
#%931396
#%952721
#%953569
#!
  
#*Exploring the missing link among d-separable, d-separable and d-disjunct matrices.
#@Hong-Bin Chen,Frank K. Hwang
#t2007
#cDiscrete Applied Mathematics
#index838498
#% 
#!
  
#*Haplotyping with missing data via perfect path phylogenies.
#@Jens Gramm,Till Nierhoff,Roded Sharan,Till Tantau
#t2007
#cDiscrete Applied Mathematics
#index838499
#%558834
#%558823
#!
  
#*A competitive algorithm in searching for many edges in a hypergraph.
#@Ting Chen,Frank K. Hwang
#t2007
#cDiscrete Applied Mathematics
#index838500
#%836560
#%837251
#%838207
#!
  
#*Binary templates for comma-free DNA codes.
#@Oliver D. King,Philippe Gaborit
#t2007
#cDiscrete Applied Mathematics
#index838501
#%159150
#%1024987
#!
  
#*On the complexity of deriving position specific score matrices from positive and negative sequences.
#@Tatsuya Akutsu,Hideo Bannai,Satoru Miyano,Sascha Ott
#t2007
#cDiscrete Applied Mathematics
#index838502
#%109018
#%267239
#%558694
#%610943
#%622442
#%622635
#%798317
#%971905
#%1025983
#%1088833
#!
  
#*Maximum transversal in partial Latin squares and rainbow matchings.
#@Manouchehr Zaker
#t2007
#cDiscrete Applied Mathematics
#index838503
#%852508
#!
  
#*Tangent circle graphs and 'orders'.
#@Moncef Abbas,Marc Pirlot,Philippe Vincke
#t2007
#cDiscrete Applied Mathematics
#index838504
#%11209
#%835928
#%839333
#!
  
#*Binary trees with the largest number of subtrees.
#@László A. Székely,Hua Wang
#t2007
#cDiscrete Applied Mathematics
#index838505
#%836787
#%837274
#!
  
#*The quadratic knapsack problem - a survey.
#@David Pisinger
#t2007
#cDiscrete Applied Mathematics
#index838506
#%406854
#%851350
#%1013437
#%1013631
#%1013909
#%1014345
#%1059273
#%1275173
#!
  
#*An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study.
#@Dan Gusfield,Dean Hickerson,Satish Eddhu
#t2007
#cDiscrete Applied Mathematics
#index838507
#%120952
#%438681
#%972132
#%1087021
#%1086946
#!
  
#*On the degree of homogeneous bent functions.
#@Qingshu Meng,Huanguo Zhang,Min Yang,Jingsong Cui
#t2007
#cDiscrete Applied Mathematics
#index838508
#%192907
#%837921
#%841862
#!
  
#*On an extremal problem related to a theorem of Whitney.
#@Mohit Singh,Amitabha Tripathi
#t2007
#cDiscrete Applied Mathematics
#index838509
#% 
#!
  
#*Connecting colored point sets.
#@Oswin Aichholzer,Franz Aurenhammer,Thomas Hackl,Clemens Huemer
#t2007
#cDiscrete Applied Mathematics
#index838510
#%111114
#%932054
#%934137
#%1058342
#%1058422
#!
  
#*Corrections of proofs for Hansen and Mélot's two theorems.
#@Xueliang Li,Yongtang Shi
#t2007
#cDiscrete Applied Mathematics
#index838511
#% 
#!
  
#*Approximating earliest arrival flows with flow-dependent transit times.
#@Nadine Baumann,Ekkehard Köhler
#t2007
#cDiscrete Applied Mathematics
#index838512
#%186328
#%610527
#%610702
#%610753
#%610950
#!
  
#*Finding submasses in weighted strings with Fast Fourier Transform.
#@Nikhil Bansal,Mark Cieliebak,Zsuzsanna Lipták
#t2007
#cDiscrete Applied Mathematics
#index838513
#%610465
#%621761
#%650610
#%979475
#!
  
#*On the domination number of the cartesian product of the cycle of length n and any graph.
#@Mohamed H. El-Zahar,Soheir M. Khamis,Kh. M. Nazzal
#t2007
#cDiscrete Applied Mathematics
#index838514
#% 
#!
  
#*Finite metrics in switching classes.
#@Andrzej Ehrenfeucht,Tero Harju,Grzegorz Rozenberg
#t2007
#cDiscrete Applied Mathematics
#index838515
#%1090851
#!
  
#*Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI.
#@András Recski,Dávid Szeszlér
#t2007
#cDiscrete Applied Mathematics
#index838516
#%132052
#%467106
#%610979
#%950382
#%951474
#%1058389
#%1059883
#%3417716
#!
  
#*O(1) query time algorithm for all pairs shortest distances on permutation graphs.
#@Alan P. Sprague
#t2007
#cDiscrete Applied Mathematics
#index838517
#%147
#%3482
#%771709
#%837058
#%930452
#%930689
#%930763
#%1058424
#!
  
#*Overlaps help: Improved bounds for group testing with interval queries.
#@Ferdinando Cicalese,Peter Damaschke,Libertad Tansini,Sören Werth
#t2007
#cDiscrete Applied Mathematics
#index838518
#%544963
#!
  
#*Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.
#@Miroslav Chlebík,Janka Chlebíková
#t2007
#cDiscrete Applied Mathematics
#index838519
#%104636
#%406902
#%621855
#%623252
#%861234
#%861852
#%950618
#%953214
#%1090115
#!
  
#*Integer linear programming approaches for non-unique probe selection.
#@Gunnar W. Klau,Sven Rahmann,Alexander Schliep,Martin Vingron,Knut Reinert
#t2007
#cDiscrete Applied Mathematics
#index838520
#%121150
#%121106
#%559054
#!
  
#*Advances on sorting by reversals.
#@Eric Tannier,Anne Bergeron,Marie-France Sagot
#t2007
#cDiscrete Applied Mathematics
#index838521
#%118578
#%950590
#%951628
#%1059710
#!
  
#*Recognizing and representing proper interval graphs in parallel using merging and sorting.
#@Jørgen Bang-Jensen,Jing Huang,Louis Ibarra
#t2007
#cDiscrete Applied Mathematics
#index838522
#%147
#%2022
#%835864
#%930689
#%953243
#%953251
#%953241
#%1059009
#%1059504
#%1059454
#%1059247
#%1059786
#!
  
#*Decompositions of graphs of functions and fast iterations of lookup tables.
#@Boaz Tsaban
#t2007
#cDiscrete Applied Mathematics
#index838523
#%210758
#%817168
#%861353
#%953614
#!
  
#*Tree loop graphs.
#@Liliana Alcón,Márcia R. Cerioli,Celina M. Herrera de Figueiredo,Marisa Gutierrez,João Meidanis
#t2007
#cDiscrete Applied Mathematics
#index838524
#%211394
#!
  
#*Motif discovery by monotone scores.
#@Alberto Apostolico,Cinzia Pizzi
#t2007
#cDiscrete Applied Mathematics
#index838525
#%522
#%438637
#%558725
#%558930
#%621759
#%764438
#%961827
#%1009270
#!
  
#*Formulas for cube roots in F.
#@Omran Ahmadi,Darrel Hankerson,Alfred Menezes
#t2007
#cDiscrete Applied Mathematics
#index838526
#% 
#!
  
#*Regular-SAT: A many-valued approach to solving combinatorial problems.
#@Ramón Béjar,Felip Manyà,Alba Cabiscol,Cèsar Fernández,Carla P. Gomes
#t2007
#cDiscrete Applied Mathematics
#index838527
#%11670
#%11862
#%14638
#%14938
#%133250
#%134159
#%390752
#%439697
#%771155
#%954795
#!
  
#*Vertex-weightings for distance moments and thorny graphs.
#@Douglas J. Klein,Tomislav Doslic,Danail Bonchev
#t2007
#cDiscrete Applied Mathematics
#index838528
#% 
#!
  
#*A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
#@Henrik Björklund,Sergei G. Vorobyov
#t2007
#cDiscrete Applied Mathematics
#index838529
#%2022
#%79836
#%111308
#%619962
#%622390
#%839305
#%861765
#%887483
#%888743
#%1089419
#%1089418
#%1095429
#!
  
#*Making the components of a graph k-connected.
#@Vladimir Nikiforov,Richard H. Schelp
#t2007
#cDiscrete Applied Mathematics
#index838530
#% 
#!
  
#*Average stretch analysis of compact routing schemes.
#@Tamar Eilam,Cyril Gavoille,David Peleg
#t2007
#cDiscrete Applied Mathematics
#index838531
#%196828
#%543904
#%653728
#%653716
#%653801
#%817796
#%951285
#%952546
#%952882
#%952983
#%1058756
#%1061049
#%1061379
#%1091241
#%1091432
#!
  
#*Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
#@Ioannis Caragiannis,Aleksei V. Fishkin,Christos Kaklamanis,Evi Papaioannou
#t2007
#cDiscrete Applied Mathematics
#index838532
#%467058
#%609917
#%610469
#%610703
#%847974
#%852820
#%952711
#%953139
#%3005125
#!
  
#*A short proof of a theorem on degree sets of graphs.
#@Amitabha Tripathi,Sujith Vijay
#t2007
#cDiscrete Applied Mathematics
#index838533
#%838433
#!
  
#*Resistance distance and the normalized Laplacian spectrum.
#@Haiyan Chen,Fuji Zhang
#t2007
#cDiscrete Applied Mathematics
#index838534
#% 
#!
  
#*Complexity results in graph reconstruction.
#@Edith Hemaspaandra,Lane A. Hemaspaandra,Stanislaw P. Radziszowski,Rahul Tripathi
#t2007
#cDiscrete Applied Mathematics
#index838535
#%209948
#%861271
#%972936
#%1015721
#%1059450
#!
  
#*An approximation algorithm for dissecting a rectangle into rectangles with specified areas.
#@Hiroshi Nagamochi,Yuusuke Abe
#t2007
#cDiscrete Applied Mathematics
#index838536
#%889526
#%976565
#%1059820
#%1124647
#%1133637
#!
  
#*Reducibility number.
#@Vilas S. Kharat,B. N. Waphare,N. K. Thakare
#t2007
#cDiscrete Applied Mathematics
#index838537
#% 
#!
  
#*Preface.
#@Sorin Istrail,Pavel A. Pevzner,Ron Shamir
#t2007
#cDiscrete Applied Mathematics
#index838538
#% 
#!
  
#*Dense sets and embedding binary trees into hypercubes.
#@Tomás Dvorák
#t2007
#cDiscrete Applied Mathematics
#index838539
#%836314
#%953112
#%1060615
#!
  
#*Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model.
#@Peter Clote,Evangelos Kranakis,Danny Krizanc,Ladislav Stacho
#t2007
#cDiscrete Applied Mathematics
#index838540
#%762947
#%837164
#!
  
#*Packing directed cycles efficiently.
#@Zeev Nutov,Raphael Yuster
#t2007
#cDiscrete Applied Mathematics
#index838541
#%610796
#%610895
#%621210
#%621875
#%830834
#%837835
#%931446
#%952565
#%1052451
#%1061239
#!
  
#*A result on the total colouring of powers of cycles.
#@C. N. Campos,Célia Picinin de Mello
#t2007
#cDiscrete Applied Mathematics
#index838542
#%847932
#%851317
#%854748
#%931136
#!
  
#*Every toroidal graph without adjacent triangles is (4, 1)-choosable.
#@Baogang Xu,Haihui Zhang
#t2007
#cDiscrete Applied Mathematics
#index838543
#% 
#!
  
#*Solution techniques for the Large Set Covering Problem.
#@Philippe Galinier,Alain Hertz
#t2007
#cDiscrete Applied Mathematics
#index838544
#%744886
#%751815
#%814112
#%924135
#%979993
#%1275177
#!
  
#*The proof theoretic strength of the Steinitz exchange theorem.
#@Michael Soltys
#t2007
#cDiscrete Applied Mathematics
#index838545
#% 
#!
  
#*Axiomatic characterizations of generalized values.
#@Jean-Luc Marichal,Ivan Kojadinovic,Katsushige Fujimoto
#t2007
#cDiscrete Applied Mathematics
#index838546
#%837709
#%3449682
#!
  
#*Coloring some classes of mixed graphs.
#@B. Ries
#t2007
#cDiscrete Applied Mathematics
#index838547
#%660703
#%1196712
#!
  
#*A note on the precedence-constrained class sequencing problem.
#@José R. Correa,Samuel Fiorini,Nicolás E. Stier Moses
#t2007
#cDiscrete Applied Mathematics
#index838548
#%651101
#%838204
#%1034451
#!
  
#*Distances based on neighbourhood sequences in non-standard three-dimensional grids.
#@Robin Strand,Benedek Nagy
#t2007
#cDiscrete Applied Mathematics
#index838549
#%828046
#%638945
#%1044246
#%1033261
#%833662
#%951478
#!
  
#*The strong metric dimension of graphs and digraphs.
#@Ortrud R. Oellermann,Joel Peters-Fransen
#t2007
#cDiscrete Applied Mathematics
#index838550
#%182592
#%836396
#%1013272
#!
  
#*Automorphisms and blocking in simple games.
#@Francesc Carreras
#t2007
#cDiscrete Applied Mathematics
#index838551
#% 
#!
  
#*Editorial.
#@Jan Kratochvíl,Josep Díaz,Jirí Fiala
#t2007
#cDiscrete Applied Mathematics
#index838552
#% 
#!
  
#*Consecutive edge-coloring of the generalized theta-graph.
#@Yongde Feng,Qiongxiang Huang
#t2007
#cDiscrete Applied Mathematics
#index838553
#% 
#!
  
#*Classes of cycle bases.
#@Christian Liebchen,Romeo Rizzi
#t2007
#cDiscrete Applied Mathematics
#index838554
#%624204
#%749755
#%836744
#%950704
#%1059545
#%2871132
#!
  
#*Decomposition of bipartite graphs into special subgraphs.
#@Guantao Chen,Richard H. Schelp
#t2007
#cDiscrete Applied Mathematics
#index838555
#%837029
#!
  
#*Simple image set of linear mappings in a max-min algebra.
#@Martin Gavalec,Ján Plávka
#t2007
#cDiscrete Applied Mathematics
#index838556
#%836308
#!
  
#*Containment properties of product and power graphs.
#@Antonio Fernández,Tom Leighton,José Luis López-Presa
#t2007
#cDiscrete Applied Mathematics
#index838557
#%1124945
#%1124946
#%1125612
#!
  
#*Computational complexity of some restricted instances of 3-SAT.
#@Piotr Berman,Marek Karpinski,Alexander D. Scott
#t2007
#cDiscrete Applied Mathematics
#index838558
#%621778
#%1059851
#!
  
#*On the ranks of O'N and Ly.
#@Faryad Ali
#t2007
#cDiscrete Applied Mathematics
#index838559
#%993681
#!
  
#*A note on the computational complexity of graph vertex partition.
#@Yuanqiu Huang,Yuming Chu
#t2007
#cDiscrete Applied Mathematics
#index838560
#%836195
#%851843
#%854118
#%933023
#%950360
#%1061184
#!
  
#*Polynomial time approximation schemes and parameterized complexity.
#@Jianer Chen,Xiuzhen Huang,Iyad A. Kanj,Ge Xia
#t2007
#cDiscrete Applied Mathematics
#index838561
#%611365
#%622487
#%817910
#%861856
#%930445
#%930356
#%949569
#%949686
#%950348
#%950753
#%951514
#%971639
#%1058905
#%1059759
#!
  
#*Approximating Boolean functions by OBDDs.
#@Andre Gronemeier
#t2007
#cDiscrete Applied Mathematics
#index838562
#%622577
#%622931
#%623312
#%623064
#%934410
#%952847
#%1078408
#%1078407
#%3006037
#!
  
#*Wiener indices of balanced binary trees.
#@Sergey Bereg,Hao Wang
#t2007
#cDiscrete Applied Mathematics
#index838563
#%610628
#%836787
#%837274
#!
  
#*Restricting SBH ambiguity via restriction enzymes.
#@Steven Skiena,Sagi Snir
#t2007
#cDiscrete Applied Mathematics
#index838564
#%494370
#%558915
#%559095
#%559049
#%961968
#%962158
#%962209
#!
  
#*Protein folding in the HP model on grid lattices with diagonals.
#@Hans-Joachim Böckenhauer,Dirk Bongartz
#t2007
#cDiscrete Applied Mathematics
#index838565
#%186264
#%558827
#%558972
#%611116
#%621802
#%836377
#%924094
#%961878
#%961992
#!
  
#*On a convex operator for finite sets.
#@Branko Curgus,Krzysztof Kolodziejczyk
#t2007
#cDiscrete Applied Mathematics
#index838566
#% 
#!
  
#*Security in graphs.
#@Robert C. Brigham,Ronald D. Dutton,Stephen T. Hedetniemi
#t2007
#cDiscrete Applied Mathematics
#index838567
#%974303
#!
  
#*An extremal problem on non-full colorable graphs.
#@Changhong Lu,Mingqing Zhai
#t2007
#cDiscrete Applied Mathematics
#index838568
#%836915
#%838593
#%854494
#%1061170
#%1061385
#%1061419
#!
  
#*Approximating reversal distance for strings with bounded number of duplicates.
#@Petr Kolman,Tomasz Walen
#t2007
#cDiscrete Applied Mathematics
#index838569
#%46552
#%118820
#%185820
#%210560
#%558741
#%610308
#%622073
#%950590
#%971858
#%1061203
#%1077245
#%1086962
#!
  
#*On computable isomorphisms in efficient asymmetric pairing-based systems.
#@Nigel P. Smart,Frederik Vercauteren
#t2007
#cDiscrete Applied Mathematics
#index838570
#%83733
#%1058661
#!
  
#*Flow trees for vertex-capacitated networks.
#@Refael Hassin,Asaf Levin
#t2007
#cDiscrete Applied Mathematics
#index838571
#%853977
#%1058572
#%1061088
#!
  
#*A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies.
#@Bhalchandra D. Thatte
#t2007
#cDiscrete Applied Mathematics
#index838572
#% 
#!
  
#*Waiting times for clumps of patterns and for structured motifs in random sequences.
#@Valery T. Stefanov,Stéphane Robin,Sophie Schbath
#t2007
#cDiscrete Applied Mathematics
#index838573
#%559044
#%837989
#%962511
#!
  
#*Testing primitivity on partial words.
#@Francine Blanchet-Sadri,Arundhati R. Anavekar
#t2007
#cDiscrete Applied Mathematics
#index838574
#%2487
#%70681
#%974698
#%1089338
#%1089441
#%1089437
#%1089439
#%1089440
#!
  
#*Agent-based randomized broadcasting in large networks.
#@Robert Elsässer,Ulf Lorenz,Thomas Sauerwald
#t2007
#cDiscrete Applied Mathematics
#index838575
#%211105
#%211677
#%502757
#%622475
#%836856
#%889448
#%931554
#!
  
#*Geometric automorphism groups of graphs.
#@David Abelson,Seok-Hee Hong,Donald E. Taylor
#t2007
#cDiscrete Applied Mathematics
#index838576
#%224638
#%224969
#%415282
#%610752
#%803842
#%803840
#%837681
#%1015315
#%1090747
#%2781264
#!
  
#*An efficient condition for a graph to be Hamiltonian.
#@Shengjia Li,Ruijuan Li,Jinfeng Feng
#t2007
#cDiscrete Applied Mathematics
#index838577
#%974591
#!
  
#*Geodesic-pancyclic graphs.
#@Hung-Chang Chan,Jou-Ming Chang,Yue-Li Wang,Shi-Jinn Horng
#t2007
#cDiscrete Applied Mathematics
#index838578
#%837956
#!
  
#*On the L-discrepancy.
#@Jinsoo Oh,Byung Ro Moon
#t2007
#cDiscrete Applied Mathematics
#index838579
#% 
#!
  
#*Satisfiability of mixed Horn formulas.
#@Stefan Porschen,Ewald Speckenmeyer
#t2007
#cDiscrete Applied Mathematics
#index838580
#%741074
#%837293
#%850767
#%931986
#%932945
#%951052
#%1061520
#!
  
#*On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory.
#@Manuel de la Sen,Asier Ibeas
#t2007
#cDiscrete Applied Mathematics
#index838581
#%745870
#%837688
#%837807
#%847978
#%1152724
#%1158371
#%2871132
#!
  
#*The Sheffer group and the Riordan group.
#@Tian-Xiao He,Leetsch C. Hsu,Peter Jau-Shyong Shiue
#t2007
#cDiscrete Applied Mathematics
#index838582
#%839200
#%849294
#%853877
#%854414
#%1094584
#!
  
#*Routing sets in the integer lattice.
#@Peter Hamburger,Robert C. Vandell,Matt Walsh
#t2007
#cDiscrete Applied Mathematics
#index838583
#%848951
#!
  
#*Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks.
#@Piotr Berman,Bhaskar DasGupta,Eduardo D. Sontag
#t2007
#cDiscrete Applied Mathematics
#index838584
#%622442
#%622980
#%765948
#%798317
#!
  
#*On CCE graphs of doubly partial orders.
#@Seog-Jin Kim,Suh-Ryung Kim,Yoomi Rho
#t2007
#cDiscrete Applied Mathematics
#index838585
#%839470
#%1061355
#!
  
#*Distance-two labelings of digraphs.
#@Gerard J. Chang,Jer-Jeong Chen,David Kuo,Sheng-Chyang Liaw
#t2007
#cDiscrete Applied Mathematics
#index838586
#%837309
#%847714
#%847716
#%848356
#%854494
#%864266
#%1061170
#%1061385
#%1061419
#%1061383
#%1061777
#%1061591
#%1061864
#!
  
#*Optimal interleaving schemes for correcting two-dimensional cluster errors.
#@Wen-Qing Xu,Solomon W. Golomb
#t2007
#cDiscrete Applied Mathematics
#index838587
#%950022
#!
  
#*The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs.
#@Sarah Spence Adams,Jonathan Cass,Matthew Tesch,Denise Sakai Troxell,Cody Wheeland
#t2007
#cDiscrete Applied Mathematics
#index838588
#%837309
#%847714
#%854494
#%1061419
#%1061383
#%1061914
#!
  
#*Noncrossing Hamiltonian paths in geometric graphs.
#@Jakub Cerný,Zdenek Dvorak,Vít Jelínek,Jan Kára
#t2007
#cDiscrete Applied Mathematics
#index838589
#%225082
#%225174
#!
  
#*Scheduling orders for multiple product types to minimize total weighted completion time.
#@Joseph Y.-T. Leung,Haibing Li,Michael Pinedo
#t2007
#cDiscrete Applied Mathematics
#index838590
#%209818
#%1014115
#%1054358
#%1054397
#!
  
#*Tree-edges deletion problems with bounded diameter obstruction sets.
#@Dekel Tsur
#t2007
#cDiscrete Applied Mathematics
#index838591
#%191869
#%267424
#%622266
#%622980
#%853418
#%861892
#%887537
#%949565
#%951694
#%952663
#%952621
#!
  
#*Partially ordered knapsack and applications to scheduling.
#@Stavros G. Kolliopoulos,George Steiner
#t2007
#cDiscrete Applied Mathematics
#index838592
#%186331
#%211144
#%610258
#%836408
#%837879
#%932206
#%950753
#%952625
#%953226
#%1060205
#%1061396
#%1278849
#%1290048
#!
  
#*Extremal problems on consecutive L(2, 1)-labelling.
#@Changhong Lu,Lei Chen,Mingqing Zhai
#t2007
#cDiscrete Applied Mathematics
#index838593
#%854494
#%1061170
#%1061385
#%1061419
#!
  
#*Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index.
#@Yumei Hu,Xueliang Li,Yongtang Shi,Tianyi Xu
#t2007
#cDiscrete Applied Mathematics
#index838594
#%851835
#!
  
#*Generalized hyper-bent functions over GF(p).
#@A. M. Youssef
#t2007
#cDiscrete Applied Mathematics
#index838595
#%484
#%193308
#%193337
#%841663
#%851369
#!
  
#*Integral trees of diameter 6.
#@Ligong Wang,Hajo Broersma,Cornelis Hoede,Xueliang Li,Georg Still
#t2007
#cDiscrete Applied Mathematics
#index838596
#%838315
#%846886
#!
  
#*Computing the bipartite edge frustration of fullerene graphs.
#@Tomislav Doslic,Damir Vukicevic
#t2007
#cDiscrete Applied Mathematics
#index838597
#%2616
#%610559
#%864500
#!
  
#*On dimensional rigidity of bar-and-joint frameworks.
#@Abdo Y. Alfakih
#t2007
#cDiscrete Applied Mathematics
#index838598
#% 
#!
  
#*On the uniform edge-partition of a tree.
#@Bang Ye Wu,Hung-Lung Wang,Shih Ta Kuan,Kun-Mao Chao
#t2007
#cDiscrete Applied Mathematics
#index838599
#%522
#%836068
#%835964
#%837595
#%949788
#%951301
#%1060654
#%1089071
#!
  
#*On k-planar crossing numbers.
#@Farhad Shahrokhi,Ondrej Sýkora,László A. Székely,Imrich Vrto
#t2007
#cDiscrete Applied Mathematics
#index838600
#%224858
#%622075
#%819445
#%853176
#!
  
#*Barycentric systems and stretchability.
#@Hubert de Fraysseix,Patrice Ossona de Mendez
#t2007
#cDiscrete Applied Mathematics
#index838601
#% 
#!
  
#*A subexponential algorithm for the coloured tree partition problem.
#@Roberto Cordone
#t2007
#cDiscrete Applied Mathematics
#index838602
#%472401
#%473562
#%835964
#%836506
#%837046
#%847950
#%937008
#%949788
#!
  
#*On Sturmian graphs.
#@Chiara Epifanio,Filippo Mignosi,Jeffrey Shallit,Ilaria Venturini
#t2007
#cDiscrete Applied Mathematics
#index838603
#%118570
#%118707
#%837217
#%837317
#%933434
#%949805
#%1090274
#%1093129
#%1093486
#!
  
#*Edge-rooted forests and the alpha-invariant of cone graphs.
#@W. Kook
#t2007
#cDiscrete Applied Mathematics
#index838604
#% 
#!
  
#*Advances in graph drawing: The 11th International Symposium on Graph Drawing.
#@Giuseppe Liotta,Henk Meijer
#t2007
#cDiscrete Applied Mathematics
#index838605
#% 
#!
  
#*Graphs, partitions and Fibonacci numbers.
#@Arnold Knopfmacher,Robert F. Tichy,Stephan Wagner,Volker Ziegler
#t2007
#cDiscrete Applied Mathematics
#index838606
#%850767
#%851257
#%1061144
#%1061776
#%1061672
#!
  
#*Better upper bounds on the QOBDD size of integer multiplication.
#@Kazuyuki Amano,Akira Maruoka
#t2007
#cDiscrete Applied Mathematics
#index838607
#%104803
#%267453
#%623064
#%861502
#%862042
#%886896
#%971568
#%973127
#%1060243
#%1078408
#%1078407
#%1079257
#%1080535
#%1082618
#!
  
#*Super-simple (v, 5, 4) designs.
#@Kejun Chen,Ruizhong Wei
#t2007
#cDiscrete Applied Mathematics
#index838608
#% 
#!
  
#*Nonexistence of near-extremal formally self-dual even codes of length divisible by 8.
#@Sunghyu Han,June Bok Lee
#t2007
#cDiscrete Applied Mathematics
#index838609
#%842028
#!
  
#*Efficient algorithms for decomposing graphs under degree constraints.
#@Cristina Bazgan,Zsolt Tuza,Daniel Vanderpooten
#t2007
#cDiscrete Applied Mathematics
#index838610
#%836063
#!
  
#*Computing the minimum number of hybridization events for a consistent evolutionary history.
#@Magnus Bordewich,Charles Semple
#t2007
#cDiscrete Applied Mathematics
#index838611
#%837112
#!
  
#*Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
#@Douglas Bauer,Hajo Broersma,Nathan Kahl,Aurora Morgana,Edward F. Schmeichel,T. Surowiec
#t2007
#cDiscrete Applied Mathematics
#index838612
#%929969
#%1089163
#%1144612
#!
  
#*Queue layouts of iterated line directed graphs.
#@Toru Hasunuma
#t2007
#cDiscrete Applied Mathematics
#index838613
#%105452
#%817894
#%836094
#%931632
#%951700
#%1059039
#%1059486
#%1059484
#%1059482
#%1061463
#!
  
#*Drawing c-planar biconnected clustered graphs.
#@Hiroshi Nagamochi,Katsutoshi Kuroya
#t2007
#cDiscrete Applied Mathematics
#index838614
#%186155
#%224877
#%224941
#%481165
#%772610
#%803681
#%972981
#%1059461
#!
  
#*Achievable sets, brambles, and sparse treewidth obstructions.
#@Brian Lucena
#t2007
#cDiscrete Applied Mathematics
#index838615
#%633154
#%836442
#%977921
#%978295
#%1058651
#%1061673
#%1061748
#!
  
#*Recognizing splicing languages: Syntactic monoids and simultaneous pumping.
#@Elizabeth Goode,Dennis Pixton
#t2007
#cDiscrete Applied Mathematics
#index838616
#%159211
#%837844
#%839127
#%930127
#%1094047
#!
  
#*The multiple originator broadcasting problem in graphs.
#@Ma-Lian Chia,David Kuo,Mei-Feng Tung
#t2007
#cDiscrete Applied Mathematics
#index838617
#%1092318
#!
  
#*Characterization of P-free graphs.
#@Jiping Liu,Yuejian Peng,Cheng Zhao
#t2007
#cDiscrete Applied Mathematics
#index838618
#% 
#!
  
#*Introduction to partially ordered patterns.
#@Sergey Kitaev
#t2007
#cDiscrete Applied Mathematics
#index838619
#%848176
#%848177
#%974687
#%1092611
#%3006037
#!
  
#*The delay of circuits whose inputs have specified arrival times.
#@Dieter Rautenbach,Christian Szegedy,Jürgen Werber
#t2007
#cDiscrete Applied Mathematics
#index838620
#%3670
#%622362
#%949858
#%950701
#%950957
#%951218
#%951844
#%979562
#%1079108
#%1081175
#%1135031
#%3004463
#%3418259
#%3418375
#!
  
#*Area-efficient planar straight-line drawings of outerplanar graphs.
#@Ashim Garg,Adrian Rusu
#t2007
#cDiscrete Applied Mathematics
#index838621
#%2583
#%224654
#%224827
#%611203
#%950336
#%953134
#!
  
#*Generalization of matching extensions in graphs (II).
#@Zemin Jin,Huifang Yan,Qinglin Yu
#t2007
#cDiscrete Applied Mathematics
#index838622
#%847591
#%848382
#!
  
#*Faster deterministic wakeup in multiple access channels.
#@Gianluca De Marco,Marco Pellegrini,Giovanni Sburlati
#t2007
#cDiscrete Applied Mathematics
#index838623
#%211000
#%415651
#%543761
#%610253
#%622167
#%950526
#%1061378
#%1089543
#!
  
#*Pareto optima for total weighted completion time and maximum lateness on a single machine.
#@George Steiner,Paul Stephenson
#t2007
#cDiscrete Applied Mathematics
#index838624
#%838152
#%1054439
#!
  
#*Approximating the fixed linear crossing number.
#@Robert J. Cimikowski,Brendan Mumey
#t2007
#cDiscrete Applied Mathematics
#index838625
#%2583
#%61880
#%211311
#%623256
#%660944
#%836472
#%836691
#%885604
#%950456
#%951700
#%1080741
#%1081457
#%1081638
#!
  
#*Attacking a public key cryptosystem based on tree replacement.
#@Maria Isabel Gonzalez Vasco,David Pérez-García
#t2007
#cDiscrete Applied Mathematics
#index838626
#%120534
#%399492
#%737730
#%841757
#%934007
#%933899
#%951465
#%1091411
#!
  
#*A new characterization of dual bases in finite fields and its applications.
#@Wei Cao,Qi Sun
#t2007
#cDiscrete Applied Mathematics
#index838627
#%841993
#%1061862
#%1135439
#!
  
#*Bipartite multigraphs with expander-like properties.
#@Lars Engebretsen
#t2007
#cDiscrete Applied Mathematics
#index838628
#%611394
#%971865
#!
  
#*Digital planarity - A review.
#@Valentin E. Brimkov,David Coeurjolly,Reinhard Klette
#t2007
#cDiscrete Applied Mathematics
#index838629
#%3482
#%104946
#%153946
#%154042
#%154041
#%593637
#%833639
#%833874
#%834096
#%836224
#%836480
#%846960
#%951149
#%953734
#%1032318
#%1033241
#%1044016
#%1044848
#%1089149
#%1089349
#%1089696
#%1089697
#%1090879
#%1094125
#%3004083
#%3004189
#%3407307
#!
  
#*On the maximum cardinality search lower bound for treewidth.
#@Hans L. Bodlaender,Arie M. C. A. Koster
#t2007
#cDiscrete Applied Mathematics
#index838630
#%633154
#%660564
#%744351
#%750830
#%930380
#%975031
#%1060536
#%1061673
#!
  
#*Each maximal planar graph with exactly two separating triangles is Hamiltonian.
#@Guido Helden
#t2007
#cDiscrete Applied Mathematics
#index838631
#% 
#!
  
#*The edge-diametric theorem in Hamming spaces.
#@Christian Bey
#t2008
#cDiscrete Applied Mathematics
#index838632
#%864073
#!
  
#*The inverse protein folding problem on 2D and 3D lattices.
#@Piotr Berman,Bhaskar DasGupta,Dhruv Mubayi,Robert H. Sloan,György Turán,Yi Zhang
#t2007
#cDiscrete Applied Mathematics
#index838633
#%118665
#%186264
#%558942
#%558825
#%559090
#%611101
#%835951
#%950675
#%952625
#%952658
#%962046
#!
  
#*On packing and coloring hyperedges in a cycle.
#@Jianping Li,Lusheng Wang,Hao Zhao
#t2007
#cDiscrete Applied Mathematics
#index838634
#%46526
#%836843
#%931424
#%932454
#%950268
#%1061187
#%1061795
#%1079265
#%1124685
#%1125335
#!
  
#*Cancellation properties of products of graphs.
#@Wilfried Imrich,Sandi Klavzar,Douglas F. Rall
#t2007
#cDiscrete Applied Mathematics
#index838635
#%838557
#!
  
#*Analytic solutions for three taxon ML trees with variable rates across sites.
#@Benny Chor,Michael D. Hendy,David Penny
#t2007
#cDiscrete Applied Mathematics
#index838636
#%558800
#%1058978
#!
  
#*Algorithmic and explicit determination of the Lovász number for certain circulant graphs.
#@Valentin E. Brimkov
#t2007
#cDiscrete Applied Mathematics
#index838637
#% 
#!
  
#*On the b-continuity property of graphs.
#@Dominique Barth,Johanne Cohen,Taoufik Faik
#t2007
#cDiscrete Applied Mathematics
#index838638
#%660803
#%837221
#%930104
#%930103
#!
  
#*Peter Ladislaw Hammer: December 23, 1936 to December 27, 2006.
#@
#t2007
#cDiscrete Applied Mathematics
#index838639
#% 
#!
  
#*An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
#@Leonid Khachiyan,Endre Boros,Khaled M. Elbassioni,Vladimir Gurvich
#t2006
#cDiscrete Applied Mathematics
#index838640
#%2067
#%302520
#%545113
#%551664
#%597957
#%599810
#%620029
#%837012
#%887270
#%952955
#%1058694
#%1058693
#%1058869
#%1059106
#!
  
#*New formulations for the Kissing Number Problem.
#@Sergei Kucherenko,Pietro Belotti,Leo Liberti,Nelson Maculan
#t2007
#cDiscrete Applied Mathematics
#index838641
#%3579
#%3457951
#%3458424
#!
  
#*Bisecting a 4-connected graph with three resource sets.
#@Toshimasa Ishii,Kengo Iwata,Hiroshi Nagamochi
#t2007
#cDiscrete Applied Mathematics
#index838642
#%660994
#%852756
#%930550
#%934660
#!
  
#*Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.
#@Leonid Khachiyan,Endre Boros,Khaled M. Elbassioni,Vladimir Gurvich,Kazuhisa Makino
#t2007
#cDiscrete Applied Mathematics
#index838643
#%416005
#%812584
#!
  
#*The state of SAT.
#@Henry A. Kautz,Bart Selman
#t2007
#cDiscrete Applied Mathematics
#index838644
#%11670
#%11931
#%12023
#%12935
#%12979
#%13212
#%14890
#%15348
#%72072
#%117295
#%117433
#%117689
#%117794
#%117927
#%133250
#%134159
#%141960
#%210171
#%211579
#%281693
#%391032
#%406907
#%451423
#%621132
#%741092
#%744925
#%745090
#%745247
#%751815
#%771155
#%838224
#%878784
#%932671
#%949792
#%950043
#%950130
#%954763
#%1051749
#%1058663
#%1088609
#%3006115
#!
  
#*Orderings of uniquely colorable hypergraphs.
#@Csilla Bujtás,Zsolt Tuza
#t2007
#cDiscrete Applied Mathematics
#index838645
#%838216
#%849042
#!
  
#*A generalization of the firefighter problem on Z×Z.
#@K. L. Ng,P. Raff
#t2008
#cDiscrete Applied Mathematics
#index838646
#% 
#!
  
#*Eliminating graphs by means of parallel knock-out schemes.
#@Hajo Broersma,Fedor V. Fomin,Rastislav Kralovic,Gerhard J. Woeginger
#t2007
#cDiscrete Applied Mathematics
#index838647
#% 
#!
  
#*Paired domination on interval and circular-arc graphs.
#@T. C. Edwin Cheng,Liying Kang,C. T. Ng
#t2007
#cDiscrete Applied Mathematics
#index838648
#%933472
#%1058835
#!
  
#*On the 2-rainbow domination in graphs.
#@Bostjan Bresar,Tadeja Kraner Sumenjak
#t2007
#cDiscrete Applied Mathematics
#index838649
#% 
#!
  
#*Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.
#@Yota Otachi,Yoshio Okamoto,Koichi Yamazaki
#t2007
#cDiscrete Applied Mathematics
#index838650
#%837321
#%837424
#%837741
#%838220
#%848529
#%852277
#%852847
#%853659
#%1059992
#!
  
#*Random backtracking in backtrack search algorithms for satisfiability.
#@Inês Lynce,João P. Marques Silva
#t2007
#cDiscrete Applied Mathematics
#index838651
#% 
#!
  
#*Exploiting partial knowledge of satisfying assignments.
#@Kazuo Iwama,Suguru Tamaki
#t2007
#cDiscrete Applied Mathematics
#index838652
#%211579
#%211756
#%620394
#%621778
#%1092793
#!
  
#*On octahedral fulleroids.
#@Stanislav Jendrol,Frantisek Kardos
#t2007
#cDiscrete Applied Mathematics
#index838653
#%851632
#!
  
#*On fairness of D0L systems.
#@Anton Cerný
#t2007
#cDiscrete Applied Mathematics
#index838654
#%882726
#%931225
#%951257
#%972631
#!
  
#*The convex dimension of a graph.
#@Nir Halman,Shmuel Onn,Uriel G. Rothblum
#t2007
#cDiscrete Applied Mathematics
#index838655
#% 
#!
  
#*The stable fixtures problem - A many-to-many extension of stable roommates.
#@Robert W. Irving,Sandy Scott
#t2007
#cDiscrete Applied Mathematics
#index838656
#%836001
#%837219
#%953161
#%953436
#%1060054
#%3003855
#!
  
#*Conflict-directed A and its role in model-based embedded systems.
#@Brian C. Williams,Robert J. Ragno
#t2007
#cDiscrete Applied Mathematics
#index838657
#%14938
#%15456
#%744492
#%744921
#%745243
#%745246
#%745237
#%745247
#%745527
#%771155
#%949763
#%950135
#!
  
#*Axiomatic characterizations of the symmetric coalitional binomial semivalues.
#@José María Alonso-Meijide,Francesc Carreras,María Albina Puente
#t2007
#cDiscrete Applied Mathematics
#index838658
#%857724
#!
  
#*Least and most colored bases.
#@Francesco Maffioli,Romeo Rizzi,Stefano Benati
#t2007
#cDiscrete Applied Mathematics
#index838659
#%930405
#%932308
#%934343
#%952695
#!
  
#*The unsatisfiability threshold revisited.
#@Alexis C. Kaporis,Lefteris M. Kirousis,Yannis C. Stamatiou,Malvina Vamvakari,Michele Zito
#t2007
#cDiscrete Applied Mathematics
#index838660
#%209777
#%610406
#%1052088
#%1052137
#%1052105
#!
  
#*On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.
#@Michael J. Todd,E. Alper Yildirim
#t2007
#cDiscrete Applied Mathematics
#index838661
#%110809
#%111064
#%111308
#%111596
#%593124
#%609938
#%610197
#%621364
#%931321
#%952618
#%980008
#%1013325
#%1013841
#%1289988
#%2892181
#%2892120
#!
  
#*The harmonious coloring problem is NP-complete for interval and permutation graphs.
#@Katerina Asdre,Kyriaki Ioannidou,Stavros D. Nikolopoulos
#t2007
#cDiscrete Applied Mathematics
#index838662
#%929786
#%930006
#%930104
#%930103
#%950387
#%1095740
#!
  
#*Construction of universal one-way hash functions: Tree hashing revisited.
#@Palash Sarkar
#t2007
#cDiscrete Applied Mathematics
#index838663
#%147
#%119686
#%622804
#%842422
#!
  
#*Finite turns and the regular closure of linear context-free languages.
#@Martin Kutrib,Andreas Malcher
#t2007
#cDiscrete Applied Mathematics
#index838664
#%950533
#%1058603
#%1092203
#%3004261
#%3295977
#!
  
#*A single-copy minimal-time simulation of a torus of automata by a ring of automata.
#@Bruno Martin,Claudine Peyrat
#t2007
#cDiscrete Applied Mathematics
#index838665
#%204490
#%494452
#%1061690
#%1093263
#%1093392
#%1093395
#%1093278
#%1093581
#%1093795
#!
  
#*Flows over edge-disjoint mixed multipaths and applications.
#@Yash P. Aneja,Ramaswamy Chandrasekaran,Santosh N. Kabadi,K. P. K. Nair
#t2007
#cDiscrete Applied Mathematics
#index838666
#%835848
#%836376
#%836066
#!
  
#*On some identities for the Fibonomial coefficients via generating function.
#@Pavel Trojovský
#t2007
#cDiscrete Applied Mathematics
#index838667
#% 
#!
  
#*On the range maximum-sum segment query problem.
#@Kuan-Yu Chen,Kun-Mao Chao
#t2007
#cDiscrete Applied Mathematics
#index838668
#%73
#%522
#%438696
#%622070
#%769997
#%776734
#%930458
#%952644
#%1058858
#%1059461
#!
  
#*Vertex-minor reductions can simulate edge contractions.
#@Mamadou Moustapha Kanté
#t2007
#cDiscrete Applied Mathematics
#index838669
#%204564
#%228655
#%481148
#%621985
#%836522
#%977408
#%977711
#%977721
#%977703
#%977717
#%978691
#%978746
#%1058968
#!
  
#*Finding a minimum path cover of a distance-hereditary graph in polynomial time.
#@Ruo-Wei Hung,Maw-Shang Chang
#t2007
#cDiscrete Applied Mathematics
#index838670
#%415309
#%660576
#%836522
#%839425
#%929786
#%934559
#%949814
#%971764
#%974454
#%1090430
#%1092146
#%1093571
#%1094718
#%1095250
#%1129137
#%3307386
#!
  
#*BerkMin: A fast and robust Sat-solver.
#@Eugene Goldberg,Yakov Novikov
#t2007
#cDiscrete Applied Mathematics
#index838671
#%12979
#%72072
#%131474
#%133250
#%141962
#%141960
#%281785
#%771155
#%932500
#!
  
#*The test suite generation problem: Optimal instances and their implications.
#@Christine T. Cheng
#t2007
#cDiscrete Applied Mathematics
#index838672
#%111965
#%239126
#%361663
#%450957
#%557216
#%977179
#!
  
#*On the enumeration of certain weighted graphs.
#@Miklós Bóna,Hyeong-Kwan Ju,Ruriko Yoshida
#t2007
#cDiscrete Applied Mathematics
#index838673
#% 
#!
  
#*On a connection between the Pascal, Stirling and Vandermonde matrices.
#@Sheng-Liang Yang,Hong You
#t2007
#cDiscrete Applied Mathematics
#index838674
#% 
#!
  
#*On the connectivity of diamond-free graphs.
#@Peter Dankelmann,Angelika Hellwig,Lutz Volkmann
#t2007
#cDiscrete Applied Mathematics
#index838675
#%975528
#%1052161
#!
  
#*Matroid representation of clique complexes.
#@Kenji Kashiwabara,Yoshio Okamoto,Takeaki Uno
#t2007
#cDiscrete Applied Mathematics
#index838676
#%977195
#%978733
#!
  
#*On the number of words containing the factor (aba).
#@Ioan Tomescu
#t2007
#cDiscrete Applied Mathematics
#index838677
#%1094948
#!
  
#*Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes.
#@Wenjun Xiao,Behrooz Parhami
#t2007
#cDiscrete Applied Mathematics
#index838678
#%1058388
#%1077859
#%1125598
#%1125566
#%1125838
#!
  
#*On the packing chromatic number of Cartesian products, hexagonal lattice, and trees.
#@Bostjan Bresar,Sandi Klavzar,Douglas F. Rall
#t2007
#cDiscrete Applied Mathematics
#index838679
#%836803
#%933948
#!
  
#*New classes of facets of the cut polytope and tightness of I Bell inequalities.
#@David Avis,Tsuyoshi Ito
#t2007
#cDiscrete Applied Mathematics
#index838680
#%854863
#%1014203
#%1014515
#!
  
#*On the parallel computation of the biconnected and strongly connected co-components of graphs.
#@Stavros D. Nikolopoulos,Leonidas Palios
#t2007
#cDiscrete Applied Mathematics
#index838681
#%147
#%622293
#%770603
#%772810
#%836447
#%887598
#%931357
#%931896
#%950018
#%952833
#%1015381
#%1059512
#%1060566
#%1078043
#!
  
#*Edge-connectivity and edge-superconnectivity in sequence graphs.
#@Camino Balbuena,Josep Fàbrega,Pedro García-Vázquez
#t2007
#cDiscrete Applied Mathematics
#index838682
#%836961
#%837331
#%838049
#!
  
#*A sufficient condition for P-path graphs being r-connected.
#@Camino Balbuena,Pedro García-Vázquez
#t2007
#cDiscrete Applied Mathematics
#index838683
#% 
#!
  
#*Existence of finite test-sets for k-power-freeness of uniform morphisms.
#@Gwénaël Richomme,Francis Wlazinski
#t2007
#cDiscrete Applied Mathematics
#index838684
#%268691
#%836105
#%838009
#%838011
#%933537
#%1089336
#!
  
#*Path-kipas Ramsey numbers.
#@A. N. M. Salman,H. J. Broersma
#t2007
#cDiscrete Applied Mathematics
#index838685
#%838370
#%851213
#!
  
#*Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets.
#@Vera Kurková,Marcello Sanguineti
#t2007
#cDiscrete Applied Mathematics
#index838686
#%108607
#%949637
#%958786
#%960703
#%972131
#%985067
#%1026701
#!
  
#*Generating effective symmetry-breaking predicates for search problems.
#@Ilya Shlyakhter
#t2007
#cDiscrete Applied Mathematics
#index838687
#%14483
#%117328
#%165379
#%362270
#%440360
#%471613
#%588943
#%601190
#%771309
#%878840
#%953319
#%1059992
#%1123634
#%3002116
#!
  
#*Free multiflows in bidirected and skew-symmetric graphs.
#@Maxim A. Babenko,Alexander V. Karzanov
#t2007
#cDiscrete Applied Mathematics
#index838688
#%950463
#%972981
#%1013711
#!
  
#*Induction of M-convex functions by linking systems.
#@Yusuke Kobayashi,Kazuo Murota
#t2007
#cDiscrete Applied Mathematics
#index838689
#%838121
#%977006
#%1061627
#%1062005
#!
  
#*A survey of scheduling with controllable processing times.
#@Dvir Shabtay,George Steiner
#t2007
#cDiscrete Applied Mathematics
#index838690
#%809678
#%809636
#%813097
#%812899
#%813461
#%813947
#%813945
#%814475
#%837829
#%838384
#%839420
#%934345
#%950482
#%950483
#%951616
#%1013820
#%1014260
#%3349831
#!
  
#*The fractional weak discrepancy of a partially ordered set.
#@Alan Shuchat,Randy Shull,Ann N. Trenk
#t2007
#cDiscrete Applied Mathematics
#index838691
#%1061391
#!
  
#*Restricted 123-avoiding Baxter permutations and the Padovan numbers.
#@Toufik Mansour,Vincent Vajnovszki
#t2007
#cDiscrete Applied Mathematics
#index838692
#%847808
#%854267
#%975204
#!
  
#*Fire containment in grids of dimension three and higher.
#@Mike Develin,Stephen G. Hartke
#t2007
#cDiscrete Applied Mathematics
#index838693
#% 
#!
  
#*The butterfly decomposition of plane trees.
#@William Y. C. Chen,Nelson Y. Li,Louis W. Shapiro
#t2007
#cDiscrete Applied Mathematics
#index838694
#%847429
#%848845
#%851525
#%975541
#!
  
#*Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs.
#@Vicky Mak,Natashia Boland
#t2007
#cDiscrete Applied Mathematics
#index838695
#%812317
#%951211
#%1013648
#%1014177
#%1288713
#%1288647
#%1288741
#%3007117
#!
  
#*Characterization of double domination subdivision number of trees.
#@M. Atapour,Abdollah Khodkar,Seyed Mahmoud Sheikholeslami
#t2007
#cDiscrete Applied Mathematics
#index838696
#%974797
#!
  
#*Phase transitions of PP-complete satisfiability problems.
#@Delbert D. Bailey,Víctor Dalmau,Phokion G. Kolaitis
#t2007
#cDiscrete Applied Mathematics
#index838697
#%12892
#%13822
#%14483
#%33667
#%368316
#%621129
#%744531
#%745763
#%745867
#%954862
#%972011
#%1058843
#%1088728
#!
  
#*On the generation of bicliques of a graph.
#@Vânia M. F. Dias,Celina M. Herrera de Figueiredo,Jayme Luiz Szwarcfiter
#t2007
#cDiscrete Applied Mathematics
#index838698
#%623296
#%660863
#%835930
#%836017
#%835963
#%837816
#%931101
#%932206
#%952838
#%953079
#!
  
#*On-line arbitrarily vertex decomposable trees.
#@Mirko Hornák,Zsolt Tuza,Mariusz Wozniak
#t2007
#cDiscrete Applied Mathematics
#index838699
#% 
#!
  
#*On the hole index of L(2, 1)-labelings of r-regular graphs.
#@Sarah Spence Adams,Matthew Tesch,Denise Sakai Troxell,Bradford Westgate,Cody Wheeland
#t2007
#cDiscrete Applied Mathematics
#index838700
#%836915
#%854494
#%1061419
#!
  
#*Extremal double hexagonal chains with respect to k-matchings and k-independent sets.
#@Haizhen Ren,Fuji Zhang
#t2007
#cDiscrete Applied Mathematics
#index838701
#% 
#!
  
#*Constructing two-weight codes with prescribed groups of automorphisms.
#@Axel Kohnert
#t2007
#cDiscrete Applied Mathematics
#index838702
#%16610
#%841879
#%842498
#%854048
#!
  
#*Note on maximal split-stable subgraphs.
#@Ulrich Faigle,Bernhard Fuchs,Britta Peis
#t2007
#cDiscrete Applied Mathematics
#index838703
#%931345
#%950618
#!
  
#*Memory management optimization problems for integrated circuit simulators.
#@Timothée Bossart,Alix Munier Kordon,Francis Sourd
#t2007
#cDiscrete Applied Mathematics
#index838704
#%418988
#%611268
#%832456
#%949887
#%950227
#!
  
#*On powers of graphs of bounded NLC-width (clique-width).
#@Karol Suchan,Ioan Todinca
#t2007
#cDiscrete Applied Mathematics
#index838705
#%660576
#%836522
#%837340
#%978691
#%1058968
#!
  
#*On compact and efficient routing in certain graph classes.
#@Feodor F. Dragan,Irina Lomonosov
#t2007
#cDiscrete Applied Mathematics
#index838706
#%211394
#%543904
#%614640
#%623175
#%653783
#%790879
#%988805
#%1089658
#%1091432
#%1341809
#!
  
#*NP-completeness of generalized multi-Skolem sequences.
#@Gustav Nordh
#t2007
#cDiscrete Applied Mathematics
#index838707
#% 
#!
  
#*Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices.
#@Rui Wang,Francis C. M. Lau,Yingchao Zhao
#t2007
#cDiscrete Applied Mathematics
#index838708
#%2616
#%621540
#%1061379
#!
  
#*On finding a large number of 3D points with a small diameter.
#@Minghui Jiang
#t2007
#cDiscrete Applied Mathematics
#index838709
#%211500
#%952618
#!
  
#*A census of boundary cubic rooted planar maps.
#@Wenzhong Liu,Yanpei Liu,Yan Xu
#t2007
#cDiscrete Applied Mathematics
#index838710
#% 
#!
  
#*The signed star domination numbers of the Cartesian product graphs.
#@Changping Wang
#t2007
#cDiscrete Applied Mathematics
#index838711
#%849264
#%849140
#%851702
#%854575
#!
  
#*Maximum patterns in datasets.
#@Tibérius O. Bonates,Peter L. Hammer,Alexander Kogan
#t2008
#cDiscrete Applied Mathematics
#index838712
#%2360
#%112847
#%472624
#%561265
#%744494
#%832458
#%835934
#%837055
#%887890
#%1009242
#%1112474
#!
  
#*A factorization of the symmetric Pascal matrix involving the Fibonacci matrix.
#@Zhizheng Zhang,Xin Wang
#t2007
#cDiscrete Applied Mathematics
#index838713
#%837501
#!
  
#*Media theory: Representations and examples.
#@Sergei Ovchinnikov
#t2008
#cDiscrete Applied Mathematics
#index838714
#%836725
#%838834
#%852154
#%921740
#!
  
#*Maximum weight edge-constrained matchings.
#@Irena Rusu
#t2008
#cDiscrete Applied Mathematics
#index838715
#%268311
#%852508
#%931986
#%950770
#!
  
#*Counting disjoint 2-partitions for points in the plane.
#@F. H. Chang,J. Y. Guo,Frank K. Hwang,J. S. Lee
#t2007
#cDiscrete Applied Mathematics
#index838716
#%835824
#%835973
#%848058
#%952693
#%1013314
#%2892347
#!
  
#*General neighborhood sequences in Z.
#@András Hajdu,Lajos Hajdu,Robert Tijdeman
#t2007
#cDiscrete Applied Mathematics
#index838717
#% 
#!
  
#*Generalizing D-graphs.
#@Arthur H. Busch,Michael Ferrara,Nathan Kahl
#t2007
#cDiscrete Applied Mathematics
#index838718
#%838612
#%849114
#%1144612
#!
  
#*Constrained sequence alignment: A general model and the hardness results.
#@Yun Sheng Chung,Chin Lung Lu,Chuan Yi Tang
#t2007
#cDiscrete Applied Mathematics
#index838719
#%763885
#%766265
#%861924
#%934479
#%949573
#%1089071
#%1089549
#!
  
#*Distance distributions for graphs modeling computer networks.
#@Bruce Elenbogen,John Frederick Fink
#t2007
#cDiscrete Applied Mathematics
#index838720
#%837297
#%851643
#!
  
#*Several polynomials associated with the harmonic numbers.
#@Gi-Sang Cheon,Suk-Geun Hwang,Sang-Gu Lee
#t2007
#cDiscrete Applied Mathematics
#index838721
#%838440
#%839200
#%852098
#%854414
#!
  
#*Characterization and recognition of generalized clique-Helly graphs.
#@Mitre Costa Dourado,Fábio Protti,Jayme Luiz Szwarcfiter
#t2007
#cDiscrete Applied Mathematics
#index838722
#%621778
#%849038
#!
  
#*On the (co)girth of a connected matroid.
#@Jung Jin Cho,Yong Chen,Yu Ding
#t2007
#cDiscrete Applied Mathematics
#index838723
#%977917
#%1013634
#%1061507
#%1061645
#!
  
#*Necessary conditions for multistationarity in discrete dynamical systems.
#@Adrien Richard,Jean-Paul Comet
#t2007
#cDiscrete Applied Mathematics
#index838724
#% 
#!
  
#*(2, 1)-Total labelling of outerplanar graphs.
#@Dong Chen,Weifan Wang
#t2007
#cDiscrete Applied Mathematics
#index838725
#%852402
#%974774
#%977269
#%1061170
#%1061385
#%1061419
#%1061777
#%1061591
#%1061864
#!
  
#*Inequalities for the Grundy chromatic number of graphs.
#@Manouchehr Zaker
#t2007
#cDiscrete Applied Mathematics
#index838726
#%929890
#%1061515
#%1061521
#!
  
#*Dirichlet problem on locally finite graphs.
#@Mohammad Javaheri
#t2007
#cDiscrete Applied Mathematics
#index838727
#%975109
#!
  
#*On the edge-connectivity and restricted edge-connectivity of a product of graphs.
#@Camino Balbuena,Martín Cera,Ana Diánez,Pedro García-Vázquez,Xavier Marcote
#t2007
#cDiscrete Applied Mathematics
#index838728
#%837295
#%850616
#%931027
#%1024275
#%1079783
#%1147995
#!
  
#*Easy and hard instances of arc ranking in directed graphs.
#@Dariusz Dereniowski
#t2007
#cDiscrete Applied Mathematics
#index838729
#%610941
#%836612
#%837473
#%839119
#%853875
#%1061052
#%1061593
#!
  
#*The source location problem with local 3-vertex-connectivity requirements.
#@Toshimasa Ishii,Hitoshi Fujita,Hiroshi Nagamochi
#t2007
#cDiscrete Applied Mathematics
#index838730
#%952499
#%1088756
#!
  
#*On encodings of spanning trees.
#@Glenn H. Hurlbert
#t2007
#cDiscrete Applied Mathematics
#index838731
#% 
#!
  
#*Computation of best possible low degree expanders.
#@Stefan Hougardy,Ivo Köthnig
#t2007
#cDiscrete Applied Mathematics
#index838732
#%972974
#%1060223
#!
  
#*Hybrid one-dimensional reversible cellular automata are regular.
#@Jesse D. Bingham,Brad Bingham
#t2007
#cDiscrete Applied Mathematics
#index838733
#%838004
#%972324
#%1094816
#!
  
#*Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.
#@Vadim E. Levit,Eugen Mandrescu
#t2007
#cDiscrete Applied Mathematics
#index838734
#%837520
#%837522
#%950770
#!
  
#*Online scheduling with machine cost and rejection.
#@Judit Nagy-György,Csanád Imreh
#t2007
#cDiscrete Applied Mathematics
#index838735
#%557760
#%623119
#%741017
#%750042
#%973471
#%1059074
#%1060972
#%1094527
#!
  
#*Corrigendum to "Surmise relations between tests - mathematical considerations": [Discrete Applied Mathematics 127 (2003) 221-239].
#@Ali Ünlü,Silke Brandt,Dietrich Albert
#t2007
#cDiscrete Applied Mathematics
#index838736
#% 
#!
  
#*Reconstruction of permutations distorted by reversal errors.
#@Elena V. Konstantinova
#t2007
#cDiscrete Applied Mathematics
#index838737
#%838737
#%1058496
#!
  
#*3D-interval-filament graphs.
#@Fanica Gavril
#t2007
#cDiscrete Applied Mathematics
#index838738
#%836748
#%853386
#%931339
#%931337
#%950229
#!
  
#*Counting truth assignments of formulas of bounded tree-width or clique-width.
#@Eldar Fischer,Johann A. Makowsky,Elena V. Ravve
#t2008
#cDiscrete Applied Mathematics
#index838739
#%73
#%11721
#%209802
#%481148
#%493212
#%611068
#%623072
#%744327
#%744722
#%773730
#%831137
#%836521
#%836522
#%838205
#%853447
#%887563
#%889631
#%931986
#%950043
#%971764
#%974365
#%978691
#%984529
#%1014638
#%1059157
#%1090210
#%1090228
#%1090340
#%1093220
#%3563878
#!
  
#*Another look at graph coloring via propositional satisfiability.
#@Allen Van Gelder
#t2008
#cDiscrete Applied Mathematics
#index838740
#%11931
#%72072
#%133250
#%771155
#%838770
#%951015
#%954748
#%1090337
#!
  
#*Projective DNF formulae and their revision.
#@Robert H. Sloan,Balázs Szörényi,György Turán
#t2008
#cDiscrete Applied Mathematics
#index838741
#%108973
#%209792
#%622517
#%744971
#%861347
#%950636
#%951759
#%985070
#%1009264
#%1009531
#%1009480
#%1009836
#%1009948
#%1088808
#%3006381
#!
  
#*Generalised graph colouring by a hybrid of local search and constraint programming.
#@Steven David Prestwich
#t2008
#cDiscrete Applied Mathematics
#index838742
#%744886
#%745207
#%745527
#%747944
#%751887
#%771155
#!
  
#*On the roots of independence polynomials of almost all very well-covered graphs.
#@Vadim E. Levit,Eugen Mandrescu
#t2008
#cDiscrete Applied Mathematics
#index838743
#%852687
#%854797
#%931407
#%974861
#%975646
#%978733
#!
  
#*Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled.
#@Cristóbal Miralles,José Pedro García-Sabater,Carlos Andrés,Manuel Cardós
#t2008
#cDiscrete Applied Mathematics
#index838744
#%837792
#%2884669
#!
  
#*A semidefinite programming-based heuristic for graph coloring.
#@Igor Dukanovic,Franz Rendl
#t2008
#cDiscrete Applied Mathematics
#index838745
#%773510
#%775032
#%809914
#%818078
#%950840
#%979993
#%1013705
#%1014457
#%2892051
#!
  
#*Cyclically permutable representations of cyclic codes.
#@Derek H. Smith,Stephanie Perkins
#t2008
#cDiscrete Applied Mathematics
#index838746
#% 
#!
  
#*Crown reductions for the Minimum Weighted Vertex Cover problem.
#@Miroslav Chlebík,Janka Chlebíková
#t2008
#cDiscrete Applied Mathematics
#index838747
#%32542
#%105214
#%621855
#%836269
#%838519
#%861234
#%950463
#%952767
#%953418
#%971703
#!
  
#*Cyclic bandwidth with an edge added.
#@Wai Hong Chan,Peter Che Bor Lam,Wai Chee Shiu
#t2008
#cDiscrete Applied Mathematics
#index838748
#% 
#!
  
#*Constructive generation of very hard 3-colorability instances.
#@Kazunori Mizuno,Seiichi Nishihara
#t2008
#cDiscrete Applied Mathematics
#index838749
#%104567
#%610441
#%744713
#%745091
#%746148
#%817916
#%861170
#%1090337
#!
  
#*Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.
#@Sung-Pil Hong,Levent Tunçel
#t2008
#cDiscrete Applied Mathematics
#index838750
#%209940
#%809544
#%835877
#%838099
#%1013200
#%1013086
#%1013437
#%2892359
#%2892248
#%2892072
#!
  
#*Coloring graphs by iterated local search traversing feasible and infeasible solutions.
#@Massimiliano Caramia,Paolo Dell'Olmo
#t2008
#cDiscrete Applied Mathematics
#index838751
#%622680
#%885351
#%885421
#%953132
#%979993
#%1080207
#!
  
#*Special issue on computational methods for graph coloring and its generalizations.
#@David S. Johnson,Anuj Mehrotra,Michael A. Trick
#t2008
#cDiscrete Applied Mathematics
#index838752
#% 
#!
  
#*An adaptive memory algorithm for the k-coloring problem.
#@Philippe Galinier,Alain Hertz,Nicolas Zufferey
#t2008
#cDiscrete Applied Mathematics
#index838753
#%549905
#%775032
#%812787
#%814813
#%885413
#!
  
#*An improved ant colony optimisation heuristic for graph colouring.
#@Kathryn A. Dowsland,Jonathan M. Thompson
#t2008
#cDiscrete Applied Mathematics
#index838754
#%199322
#%3458100
#!
  
#*A cutting plane algorithm for graph coloring.
#@Isabel Méndez-Díaz,Paula Zabala
#t2008
#cDiscrete Applied Mathematics
#index838755
#%773510
#%1074418
#%3007117
#!
  
#*Efficient algorithms for finding critical subgraphs.
#@Christian Desrosiers,Philippe Galinier,Alain Hertz
#t2008
#cDiscrete Applied Mathematics
#index838756
#%773510
#%775032
#%812787
#%838544
#%838753
#%979993
#!
  
#*The circuit polynomial of the restricted rooted product G(Gamma) of graphs with a bipartite core G.
#@Vladimir R. Rosenfeld
#t2008
#cDiscrete Applied Mathematics
#index838757
#% 
#!
  
#*The complete optimal stars-clustering-tree problem.
#@Ephraim Korach,Michal Stern
#t2008
#cDiscrete Applied Mathematics
#index838758
#%2026
#%832983
#%1060515
#!
  
#*Equistable distance-hereditary graphs.
#@Ephraim Korach,Uri N. Peled,Udi Rotics
#t2008
#cDiscrete Applied Mathematics
#index838759
#%624118
#%836239
#%837382
#%837818
#%839425
#%933043
#%933175
#%974454
#%988551
#%1058996
#%1090430
#!
  
#*On polyhedra induced by point sets in space.
#@Pankaj K. Agarwal,Ferran Hurtado,Godfried T. Toussaint,Joan Trias
#t2008
#cDiscrete Applied Mathematics
#index838760
#%623133
#%803876
#%929566
#%2781259
#!
  
#*Games played by Boole and Galois.
#@Aviezri S. Fraenkel
#t2008
#cDiscrete Applied Mathematics
#index838761
#%1089450
#%1091211
#!
  
#*Editorial.
#@Irith Ben-Arroyo Hartman,Seffi Naor,Michal Penn,Uriel G. Rothblum
#t2008
#cDiscrete Applied Mathematics
#index838762
#% 
#!
  
#*The Shields-Harary numbers of K for continuous concave cost functions vanishing at 1.
#@John Holliday,Peter Johnson
#t2008
#cDiscrete Applied Mathematics
#index838763
#% 
#!
  
#*On the variance of Shannon products of graphs.
#@József Balogh,Clifford D. Smyth
#t2008
#cDiscrete Applied Mathematics
#index838764
#%975106
#%1089383
#%1091830
#!
  
#*Open problems around exact algorithms.
#@Gerhard J. Woeginger
#t2008
#cDiscrete Applied Mathematics
#index838765
#%610003
#%660954
#%861707
#%929562
#%929570
#%929995
#%949588
#%950710
#%960021
#%960157
#%993684
#%1090904
#!
  
#*Unicyclic and bicyclic graphs having minimum degree distance.
#@Alexandru Ioan Tomescu
#t2008
#cDiscrete Applied Mathematics
#index838766
#% 
#!
  
#*Time offset optimization in digital broadcasting.
#@Carlo Mannino,Fabrizio Rossi,Antonio Sassano,Stefano Smriglio
#t2008
#cDiscrete Applied Mathematics
#index838767
#%3005546
#!
  
#*Quasi-concave functions on meet-semilattices.
#@Yulia Kempner,Ilya B. Muchnik
#t2008
#cDiscrete Applied Mathematics
#index838768
#%836604
#%1118265
#!
  
#*Covering symmetric semi-monotone functions.
#@Roland Grappe,Zoltán Szigeti
#t2008
#cDiscrete Applied Mathematics
#index838769
#%79031
#%838476
#%1061347
#!
  
#*Graph coloring in the estimation of sparse derivative matrices: Instances and applications.
#@Shahadat Hossain,Trond Steihaug
#t2008
#cDiscrete Applied Mathematics
#index838770
#%1090337
#!
  
#*On the general routing polytope.
#@Gerhard Reinelt,Dirk Oliver Theis
#t2008
#cDiscrete Applied Mathematics
#index838771
#%974491
#%1014045
#%1014139
#%2891992
#!
  
#*The k-edge intersection graphs of paths in a tree.
#@Martin Charles Golumbic,Marina Lipshteyn,Michal Stern
#t2008
#cDiscrete Applied Mathematics
#index838772
#% 
#!
  
#*Longest alternating subsequences of k-ary words.
#@Toufik Mansour
#t2008
#cDiscrete Applied Mathematics
#index838773
#%846890
#!
  
#*The partition bargaining problem.
#@Uriel G. Rothblum,Yoav Tangir
#t2008
#cDiscrete Applied Mathematics
#index838774
#%65808
#%1059093
#%2892347
#%1058417
#!
  
#*Computing finest mincut partitions of a graph and application to routing problems.
#@Gerhard Reinelt,Dirk Oliver Theis,Klaus Michael Wenger
#t2008
#cDiscrete Applied Mathematics
#index838775
#%406787
#%610198
#%950841
#%952941
#%953064
#%1014138
#!
  
#*Linear relations for p-harmonic functions.
#@Hisayasu Kurata
#t2008
#cDiscrete Applied Mathematics
#index838776
#% 
#!
  
#*A note on occurrence of gapped patterns in i.i.d. sequences.
#@Vladimir Pozdnyakov
#t2008
#cDiscrete Applied Mathematics
#index838777
#%838573
#!
  
#*On the discrete version of Picone's identity.
#@S. Amghibech
#t2008
#cDiscrete Applied Mathematics
#index838778
#% 
#!
  
#*An ant-based algorithm for coloring graphs.
#@Thang Nguyen Bui,ThanhVu H. Nguyen,Chirag M. Patel,Kim-Anh T. Phan
#t2008
#cDiscrete Applied Mathematics
#index838779
#%924065
#%931564
#%1058566
#!
  
#*A polynomial time algorithm for solving a quality control station configuration problem.
#@Michal Penn,Tal Raviv
#t2008
#cDiscrete Applied Mathematics
#index838780
#% 
#!
  
#*The number of vertices whose out-arcs are pancyclic in a 2-strong tournament.
#@Ruijuan Li,Shengjia Li,Jinfeng Feng
#t2008
#cDiscrete Applied Mathematics
#index838781
#%838341
#!
  
#*The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.
#@Irith Ben-Arroyo Hartman,Seffi Naor,Michal Penn,Uriel G. Rothblum
#t2008
#cDiscrete Applied Mathematics
#index838782
#% 
#!
  
#*Preface.
#@Alistair R. Clark,Richard W. Eglese,Adam N. Letchford,Michael B. Wright
#t2008
#cDiscrete Applied Mathematics
#index838783
#% 
#!
  
#*Node-searching problem on block graphs.
#@Hsin-Hung Chou,Ming-Tat Ko,Chin-Wen Ho,Gen-Huey Chen
#t2008
#cDiscrete Applied Mathematics
#index838784
#%186323
#%837015
#%839251
#%887765
#%932186
#%951151
#%952688
#%952731
#%1061054
#%1061056
#%1092604
#%1095250
#!
  
#*Approximations of Lovász extensions and their induced interaction index.
#@Jean-Luc Marichal,Pierre Mathonet
#t2008
#cDiscrete Applied Mathematics
#index838785
#% 
#!
  
#*Ratewise-optimal non-sequential search strategies under constraints on the tests.
#@Rudolf Ahlswede
#t2008
#cDiscrete Applied Mathematics
#index838786
#%932078
#!
  
#*On the asymmetric representatives formulation for the vertex coloring problem.
#@Manoel B. Campêlo,Victor A. Campos,Ricardo C. Corrêa
#t2008
#cDiscrete Applied Mathematics
#index838787
#%930308
#!
  
#*An upper bound on the independence number of benzenoid systems.
#@Ryan Pepper
#t2008
#cDiscrete Applied Mathematics
#index838788
#% 
#!
  
#*Cluster structures and collections of Galois closed entity subsets.
#@Mohammed Benayade,Jean Diatta
#t2008
#cDiscrete Applied Mathematics
#index838789
#%361771
#%745668
#%836108
#%854352
#%1044355
#%1112484
#!
  
#*Multi-group support vector machines with measurement costs: A biobjective approach.
#@Emilio Carrizosa,Belen Martin-Barragan,Dolores Romero Morales
#t2008
#cDiscrete Applied Mathematics
#index838790
#%517090
#%618990
#%812767
#%839567
#%971962
#%984946
#%1009397
#%1009356
#%1009642
#%1009706
#%1013425
#%1045472
#%1275179
#!
  
#*On the correlation of binary sequences.
#@Rudolf Ahlswede,Julien Cassaigne,András Sárközy
#t2008
#cDiscrete Applied Mathematics
#index838791
#%484
#!
  
#*On the stable b-matching problem in multigraphs.
#@Viera Borbel'ová,Katarína Cechlárová
#t2008
#cDiscrete Applied Mathematics
#index838792
#%298130
#%821051
#%836363
#%838656
#%953161
#%1059624
#%1060054
#%1077243
#%3003855
#!
  
#*Multiple packing in sum-type metric spaces.
#@Rudolf Ahlswede,Vladimir Blinovsky
#t2008
#cDiscrete Applied Mathematics
#index838793
#%974701
#!
  
#*Stochastic applications of media theory: Random walks on weak orders or partial orders.
#@Jean-Claude Falmagne,Yung-Fong Hsu,Fabio Leite,Michel Regenwetter
#t2008
#cDiscrete Applied Mathematics
#index838794
#%836725
#%838714
#%838834
#%852154
#%921740
#!
  
#*Proper generating trees and their internal path length.
#@Donatella Merlini
#t2008
#cDiscrete Applied Mathematics
#index838795
#%837668
#%837670
#%839200
#%846890
#%848544
#%854267
#%854414
#%1094584
#!
  
#*Preface.
#@Rudolf Ahlswede
#t2008
#cDiscrete Applied Mathematics
#index838796
#% 
#!
  
#*Spatial classification.
#@Edwin Diday
#t2008
#cDiscrete Applied Mathematics
#index838797
#%836108
#%836623
#%893166
#%1112484
#!
  
#*A distributional study of the path edge-covering numbers for random trees.
#@Alois Panholzer
#t2008
#cDiscrete Applied Mathematics
#index838798
#%70692
#%864660
#%3617151
#!
  
#*Lower bounds on the pathwidth of some grid-like graphs.
#@John Ellis,Robert Warren
#t2008
#cDiscrete Applied Mathematics
#index838799
#%832456
#%932186
#%950952
#%977921
#%1092604
#!
  
#*Preface.
#@Martin Anthony,Endre Boros,Alexander Kogan
#t2008
#cDiscrete Applied Mathematics
#index838800
#% 
#!
  
#*Reconstruction of a graph from 2-vicinities of its vertices.
#@Vladimir I. Levenshtein,Elena V. Konstantinova,Eugene Konstantinov,Sergey Molodtsov
#t2008
#cDiscrete Applied Mathematics
#index838801
#%73
#%976914
#!
  
#*Filling of a given boundary by p-gons and related problems.
#@Mathieu Dutour Sikiric,Michel Deza,Mikhail Shtogrin
#t2008
#cDiscrete Applied Mathematics
#index838802
#%830867
#%952785
#!
  
#*Periodicity and repetitions in parameterized strings.
#@Alberto Apostolico,Raffaele Giancarlo
#t2008
#cDiscrete Applied Mathematics
#index838803
#%522
#%70681
#%609947
#%929565
#%971430
#%971345
#%1058504
#%1058352
#%1058396
#!
  
#*Recursive constructions of N-polynomials over GF(2).
#@Melsik K. Kyuregyan
#t2008
#cDiscrete Applied Mathematics
#index838804
#% 
#!
  
#*Structure of the eigenspace of a Monge matrix in max-plus algebra.
#@Martin Gavalec,Ján Plávka
#t2008
#cDiscrete Applied Mathematics
#index838805
#%836303
#!
  
#*On the strong p-Helly property.
#@Mitre Costa Dourado,Fábio Protti,Jayme Luiz Szwarcfiter
#t2008
#cDiscrete Applied Mathematics
#index838806
#%934683
#!
  
#*Systems of sets such that each set properly intersects at most one other set - Application to cluster analysis.
#@P. Bertrand
#t2008
#cDiscrete Applied Mathematics
#index838807
#%851638
#%864088
#!
  
#*Weighted lattice polynomials of independent random variables.
#@Jean-Luc Marichal
#t2008
#cDiscrete Applied Mathematics
#index838808
#% 
#!
  
#*The six classes of trees with the largest algebraic connectivity.
#@Xi-Ying Yuan,Jia-Yu Shao,Li Zhang
#t2008
#cDiscrete Applied Mathematics
#index838809
#% 
#!
  
#*Bounds on a graph's security number.
#@Ronald D. Dutton,Robert Lee,Robert C. Brigham
#t2008
#cDiscrete Applied Mathematics
#index838810
#%838567
#%974303
#!
  
#*Spanning forests and the golden ratio.
#@Pavel Chebotarev
#t2008
#cDiscrete Applied Mathematics
#index838811
#%1113906
#!
  
#*General theory of information transfer: Updated.
#@Rudolf Ahlswede
#t2008
#cDiscrete Applied Mathematics
#index838812
#%623312
#%644562
#%886972
#%1064442
#!
  
#*On hereditary clique-Helly self-clique graphs.
#@Francisco Larrión,Miguel A. Pizaña
#t2008
#cDiscrete Applied Mathematics
#index838813
#%847296
#%851543
#!
  
#*Large convex cones in hypercubes.
#@Zoltán Füredi,Miklós Ruszinkó
#t2008
#cDiscrete Applied Mathematics
#index838814
#%852743
#%975104
#!
  
#*Geodeticity of the contour of chordal graphs.
#@José Cáceres,M. Carmen Hernando,Mercè Mora,Ignacio M. Pelayo,María Luz Puertas,Carlos Seara
#t2008
#cDiscrete Applied Mathematics
#index838815
#%847249
#!
  
#*An all-substrings common subsequence algorithm.
#@Carlos Eduardo Rodrigues Alves,E. N. Cáceres,Siang Wun Song
#t2008
#cDiscrete Applied Mathematics
#index838816
#%522
#%407919
#%614041
#%772807
#%932705
#%953288
#%1060393
#%1125392
#!
  
#*On the computational complexity of partial covers of Theta graphs.
#@Jirí Fiala,Jan Kratochvíl,Attila Pór
#t2008
#cDiscrete Applied Mathematics
#index838817
#%660801
#%976737
#%988298
#%1061419
#!
  
#*Coding for a multiple access OR channel: A survey.
#@Sándor Györi
#t2008
#cDiscrete Applied Mathematics
#index838818
#%623120
#%837329
#%1059943
#%1105426
#%1107342
#!
  
#*Planar graph bipartization in linear time.
#@Samuel Fiorini,Nadia Hardy,Bruce A. Reed,Adrian Vetta
#t2008
#cDiscrete Applied Mathematics
#index838819
#%610926
#%650636
#%950704
#%952621
#%976706
#%977725
#%977711
#%1058651
#%1061011
#!
  
#*Mutual exclusion scheduling with interval graphs or related classes. Part II.
#@Frédéric Gardi
#t2008
#cDiscrete Applied Mathematics
#index838820
#%660828
#%836552
#%848106
#%852565
#%853584
#%888370
#%960011
#%977063
#%1089092
#%1089501
#%1091696
#!
  
#*The 22 minimal dichotomy decompositions of the K-distance.
#@Bernard Fichet
#t2008
#cDiscrete Applied Mathematics
#index838821
#% 
#!
  
#*Minimum degree conditions for H-linked graphs.
#@Alexandr V. Kostochka,Gexin Yu
#t2008
#cDiscrete Applied Mathematics
#index838822
#%831309
#%865088
#!
  
#*Three Hoppy path problems and ternary paths.
#@Eva Yu-Ping Deng,Toufik Mansour
#t2008
#cDiscrete Applied Mathematics
#index838823
#%846890
#!
  
#*Functional dependencies distorted by errors.
#@János Demetrovics,Gyula O. H. Katona,Dezsö Miklós
#t2008
#cDiscrete Applied Mathematics
#index838824
#%212581
#!
  
#*Optimal clustering of multipartite graphs.
#@Irène Charon,Olivier Hudry
#t2008
#cDiscrete Applied Mathematics
#index838825
#%741094
#!
  
#*Preface.
#@Olivier Hudry,Melvin F. Janowitz,Sergei Ovchinnikov
#t2008
#cDiscrete Applied Mathematics
#index838826
#% 
#!
  
#*Comparing bacterial genomes from linear orders of patterns.
#@Frédéric Guyon,Alain Guénoche
#t2008
#cDiscrete Applied Mathematics
#index838827
#%522
#%118478
#%118817
#%377961
#%559108
#%772807
#%950590
#%951082
#%951134
#%623255
#!
  
#*Wilson's theorem for consensus functions on hierarchies.
#@Robert C. Powers,J. M. White
#t2008
#cDiscrete Applied Mathematics
#index838828
#%837901
#!
  
#*Skew partitions in perfect graphs.
#@Bruce A. Reed
#t2008
#cDiscrete Applied Mathematics
#index838829
#%481202
#%854339
#%952930
#%975210
#!
  
#*Heyting algebras with Boolean operators for rough sets and information retrieval applications.
#@Eric SanJuan
#t2008
#cDiscrete Applied Mathematics
#index838830
#%87
#%595699
#%973156
#%1090672
#!
  
#*On the complexity of constrained VC-classes.
#@Joel Ratsaby
#t2008
#cDiscrete Applied Mathematics
#index838831
#%1094168
#!
  
#*Minimal polynomials of the modified de Bruijn sequences.
#@Gohar M. M. Kyureghyan
#t2008
#cDiscrete Applied Mathematics
#index838832
#%841708
#!
  
#*A framework for incremental generation of closed itemsets.
#@Petko Valtchev,Rokia Missaoui,Robert Godin
#t2008
#cDiscrete Applied Mathematics
#index838833
#%2067
#%140535
#%299718
#%472349
#%472400
#%473388
#%473554
#%598135
#%620029
#%641841
#%838833
#%849066
#%938951
#%938919
#%1009294
#%1059106
#%1063467
#%1091524
#!
  
#*Algorithms for media.
#@David Eppstein,Jean-Claude Falmagne
#t2008
#cDiscrete Applied Mathematics
#index838834
#%610228
#%741142
#%818043
#%835975
#%836725
#%838714
#%852154
#%864418
#%921740
#%929902
#%950422
#%1059120
#%3005077
#!
  
#*P-equicoverable graphs - Research on H-equicoverable graphs.
#@Yuqin Zhang
#t2008
#cDiscrete Applied Mathematics
#index838835
#% 
#!
  
#*Extended resolution simulates binary decision diagrams.
#@Nicolas Peltier
#t2008
#cDiscrete Applied Mathematics
#index838836
#%38819
#%83711
#%621778
#%771155
#%832306
#%836987
#%837447
#%951454
#%994623
#!
  
#*Size of downsets in the pushing order and a problem of Berlekamp.
#@Ulrich Tamm
#t2008
#cDiscrete Applied Mathematics
#index838837
#%864073
#%974315
#!
  
#*A new family of expansive graphs.
#@Martín Matamala,José Zamora
#t2008
#cDiscrete Applied Mathematics
#index838838
#%848294
#!
  
#*On bags and bugs.
#@Pierre Hansen,Dragan Stevanovic
#t2008
#cDiscrete Applied Mathematics
#index838839
#%813608
#%847194
#%974633
#!
  
#*Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs.
#@Flavia Bonomo,Maria Chudnovsky,Guillermo Durán
#t2008
#cDiscrete Applied Mathematics
#index838840
#%798033
#%850548
#%929848
#%951018
#%975179
#%977063
#%977067
#%1061166
#!
  
#*Fractionally total colouring G.
#@Conor Meagher,Bruce A. Reed
#t2008
#cDiscrete Applied Mathematics
#index838841
#% 
#!
  
#*Comprehensive vs. comprehensible classifiers in logical analysis of data.
#@Gabriela Alexe,Sorin Alexe,Peter L. Hammer,Alexander Kogan
#t2008
#cDiscrete Applied Mathematics
#index838842
#%835930
#%835934
#%837055
#%1013425
#%1112474
#!
  
#*Aspects of discrete mathematics and probability in the theory of machine learning.
#@Martin Anthony
#t2008
#cDiscrete Applied Mathematics
#index838843
#%108607
#%108736
#%108740
#%501847
#%887725
#%888180
#%949637
#%949807
#%972336
#%984928
#!
  
#*A one-dimensional bin packing problem with shelf divisions.
#@E. C. Xavier,Flávio Keidi Miyazawa
#t2008
#cDiscrete Applied Mathematics
#index838844
#%814679
#%1094572
#%1095281
#!
  
#*On perfect binary codes.
#@Faina I. Solov'eva
#t2008
#cDiscrete Applied Mathematics
#index838845
#%837671
#%837968
#%838230
#%841669
#%842055
#%842338
#%842337
#%842341
#%848962
#%977463
#%1061296
#%1061706
#%1061676
#!
  
#*Super-simple Steiner pentagon systems.
#@R. Julian R. Abel,Frank E. Bennett
#t2008
#cDiscrete Applied Mathematics
#index838846
#%838608
#%842017
#%846748
#%853314
#!
  
#*Edge-splittings preserving local edge-connectivity of graphs.
#@Zoltán Szigeti
#t2008
#cDiscrete Applied Mathematics
#index838847
#%853238
#%1061078
#%1061347
#!
  
#*Non-separating cocircuits in matroids.
#@Manoel Lemos,T. R. B. Melo
#t2008
#cDiscrete Applied Mathematics
#index838848
#%831273
#%977177
#!
  
#*Searching with lies under error cost constraints.
#@Rudolf Ahlswede,Ferdinando Cicalese,Christian Deppe
#t2008
#cDiscrete Applied Mathematics
#index838849
#%186048
#%798025
#%1090104
#%1093958
#!
  
#*Expected rank and randomness in rooted graphs.
#@David Eisenstat,Jennifer Feder,Greg Francos,Gary Gordon,Amanda Redlich
#t2008
#cDiscrete Applied Mathematics
#index838850
#%835999
#!
  
#*Batch processing with interval graph compatibilities between tasks.
#@Gerd Finke,Vincent Jost,Maurice Queyranne,András Sebö
#t2008
#cDiscrete Applied Mathematics
#index838851
#%853584
#%888370
#%1089501
#!
  
#*Binary clustering.
#@Jean-Pierre Barthélemy,François Brucker
#t2008
#cDiscrete Applied Mathematics
#index838852
#%864088
#!
  
#*Approximation algorithms for problems in scheduling with set-ups.
#@Srikrishnan Divakaran,Michael E. Saks
#t2008
#cDiscrete Applied Mathematics
#index838853
#%211061
#%812084
#%3005125
#!
  
#*The stable marriage problem with master preference lists.
#@Robert W. Irving,David Manlove,Sandy Scott
#t2008
#cDiscrete Applied Mathematics
#index838854
#%620416
#%837219
#%1059624
#%1059424
#%1061508
#%1091727
#%1093295
#%3003855
#!
  
#*The zoo of tree spanner problems.
#@Christian Liebchen,Gregor Wünsch
#t2008
#cDiscrete Applied Mathematics
#index838855
#%46485
#%610436
#%621917
#%818074
#%836744
#%838298
#%930534
#%931276
#%931627
#%1058311
#%1059545
#%1060654
#%1061140
#%1089657
#%2871132
#!
  
#*Degree constrained subgraphs.
#@Louigi Addario-Berry,Ketan Dalal,Bruce A. Reed
#t2008
#cDiscrete Applied Mathematics
#index838856
#%798741
#%974259
#%977900
#!
  
#*T-shift synchronization codes.
#@Rudolf Ahlswede,Bernhard Balkenhol,Christian Deppe,Haik Mashurian,T. Partner
#t2008
#cDiscrete Applied Mathematics
#index838857
#% 
#!
  
#*Levon H. Khachatrian: 1954-2002.
#@Harout K. Aydinian
#t2008
#cDiscrete Applied Mathematics
#index838858
#% 
#!
  
#*On classes of minimal circular-imperfect graphs.
#@Arnaud Pêcher,Annegret Wagler
#t2008
#cDiscrete Applied Mathematics
#index838859
#%849138
#%1014248
#!
  
#*Preface.
#@Paulo Feofiloff,Celina M. Herrera de Figueiredo,Yoshiko Wakabayashi
#t2008
#cDiscrete Applied Mathematics
#index838860
#% 
#!
  
#*Sphere-separable partitions of multi-parameter elements.
#@Boaz Golany,Frank K. Hwang,Uriel G. Rothblum
#t2008
#cDiscrete Applied Mathematics
#index838861
#%835824
#%835973
#%848058
#%851235
#%976352
#%1013241
#%1013314
#%2892347
#!
  
#*A generalization of the Lee distance and error correcting codes.
#@S. Nishimura,T. Hiramatsu
#t2008
#cDiscrete Applied Mathematics
#index838862
#% 
#!
  
#*A survey on proper codes.
#@Rossitza Dodunekova,Stefan M. Dodunekov,E. Nikolova
#t2008
#cDiscrete Applied Mathematics
#index838863
#%841753
#%841974
#%891172
#!
  
#*Minimal comparability completions of arbitrary graphs.
#@Pinar Heggernes,Federico Mancini,Charis Papadopoulos
#t2008
#cDiscrete Applied Mathematics
#index838864
#%931558
#%1060701
#!
  
#*Scheduling malleable tasks with interdependent processing rates: Comments and observations.
#@Edmund K. Burke,Moshe Dror,James B. Orlin
#t2008
#cDiscrete Applied Mathematics
#index838865
#%408181
#%614647
#%941899
#%1126023
#%1126025
#!
  
#*Feedback vertex set on AT-free graphs.
#@Dieter Kratsch,Haiko Müller,Ioan Todinca
#t2008
#cDiscrete Applied Mathematics
#index838866
#%932532
#%932547
#%953220
#%1061125
#%1061063
#%1061230
#%1089659
#!
  
#*On the existence of sports schedules with multiple venues.
#@Yoshiko Ikebe,Akihisa Tamura
#t2008
#cDiscrete Applied Mathematics
#index838867
#%117288
#%813958
#%838250
#%839324
#%851286
#!
  
#*Strategies of loop recombination in ciliates.
#@Robert Brijder,Hendrik Jan Hoogeboom,Michael Muskulus
#t2008
#cDiscrete Applied Mathematics
#index838868
#%821747
#%1014698
#%1089695
#%1090791
#!
  
#*Super-connected edge transitive graphs.
#@Zhao Zhang,Jixiang Meng
#t2008
#cDiscrete Applied Mathematics
#index838869
#%837660
#%854207
#%854755
#%864542
#!
  
#*Existence of directed triplewhist tournaments with the three person property 3PDTWh(v).
#@R. Julian R. Abel,Frank E. Bennett,Gennian Ge
#t2008
#cDiscrete Applied Mathematics
#index838870
#%836168
#%864053
#%979244
#!
  
#*Vertex and edge PI indices of Cartesian product graphs.
#@M. H. Khalifeh,H. Yousefi-Azari,A. R. Ashrafi
#t2008
#cDiscrete Applied Mathematics
#index838871
#%854513
#!
  
#*The extent to which triangular sub-patterns explain minimum rank.
#@Charles R. Johnson,Joshua A. Link
#t2008
#cDiscrete Applied Mathematics
#index838872
#% 
#!
  
#*Vertex coloring acyclic digraphs and their corresponding hypergraphs.
#@Geir Agnarsson,Ágúst S. Egilsson,Magnús M. Halldórsson
#t2008
#cDiscrete Applied Mathematics
#index838873
#%2296
#%1060967
#!
  
#*Hosoya polynomials under gated amalgamations.
#@Shoujun Xu,Heping Zhang
#t2008
#cDiscrete Applied Mathematics
#index838874
#%851809
#%852369
#%853078
#%864173
#%864216
#!
  
#*Solving some NP-complete problems using split decomposition.
#@Michaël Rao
#t2008
#cDiscrete Applied Mathematics
#index838875
#%70760
#%660576
#%836522
#%837340
#%839425
#%851455
#%950362
#%952621
#%952832
#%953577
#%971764
#%1025594
#!
  
#*The general sigma all-ones problem for trees.
#@Xueliang Li,Chao Wang,Xiaoyan Zhang
#t2008
#cDiscrete Applied Mathematics
#index838876
#% 
#!
  
#*A clique algorithm for standard quadratic programming.
#@Andrea Scozzari,Fabio Tardella
#t2008
#cDiscrete Applied Mathematics
#index838877
#%837870
#%1025737
#!
  
#*On multicolour noncomplete Ramsey graphs of star graphs.
#@Sachin Gautam,Ashish Kumar Srivastava,Amitabha Tripathi
#t2008
#cDiscrete Applied Mathematics
#index838878
#% 
#!
  
#*Generating non-jumping numbers recursively.
#@Yuejian Peng,Cheng Zhao
#t2008
#cDiscrete Applied Mathematics
#index838879
#%831227
#%975694
#%2921417
#!
  
#*Models and quantifier elimination for quantified Horn formulas.
#@Uwe Bubeck,Hans Kleine Büning
#t2008
#cDiscrete Applied Mathematics
#index838880
#%3670
#%12165
#%887427
#!
  
#*A general model for cyclic machine scheduling problems.
#@Peter Brucker,Thomas Kampmeyer
#t2008
#cDiscrete Applied Mathematics
#index838881
#%837234
#%839106
#%951436
#%1054402
#%1289940
#!
  
#*None of the coronoid systems can be isometrically embedded into a hypercube.
#@Heping Zhang,Shoujun Xu
#t2008
#cDiscrete Applied Mathematics
#index838882
#% 
#!
  
#*Ultrametrics, Banach's fixed point theorem and the Riordan group.
#@Ana Luzón,Manuel A. Morón
#t2008
#cDiscrete Applied Mathematics
#index838883
#%837668
#%837670
#%839200
#%848544
#%853877
#%854414
#%976315
#%1094584
#!
  
#*Polarity of chordal graphs.
#@Tinaz Ekim,Pavol Hell,Juraj Stacho,Dominique de Werra
#t2008
#cDiscrete Applied Mathematics
#index838884
#%621948
#%837116
#%1060536
#%1091066
#!
  
#*Large gaps in one-dimensional cutting stock problems.
#@J. Rietz,S. Dempe
#t2008
#cDiscrete Applied Mathematics
#index838885
#%2616
#%838015
#%1013161
#!
  
#*Characterizations of maximum fractional (g, f)-factors of graphs.
#@Guizhen Liu,Lanju Zhang
#t2008
#cDiscrete Applied Mathematics
#index838886
#%839444
#%852999
#!
  
#*Facet defining inequalities among graph invariants: The system GraPHedron.
#@Hadrien Mélot
#t2008
#cDiscrete Applied Mathematics
#index838887
#%111067
#%803946
#%847194
#%851126
#!
  
#*A network approach for specially structured linear programs arising in 0-1 quadratic optimization.
#@Warren P. Adams,Paul T. Hadavas
#t2008
#cDiscrete Applied Mathematics
#index838888
#%835851
#%836271
#%838097
#%851350
#%1013822
#%1090775
#!
  
#*Violator spaces: Structure and algorithms.
#@Bernd Gärtner,Jirka Matousek,Leo Rüst,Petr Skovron
#t2008
#cDiscrete Applied Mathematics
#index838889
#%110524
#%211376
#%610159
#%610581
#%619962
#%620277
#%620810
#%622390
#%798497
#%843841
#%950051
#%952742
#!
  
#*Digraph searching, directed vertex separation and directed pathwidth.
#@Boting Yang,Yi Cao
#t2008
#cDiscrete Applied Mathematics
#index838890
#%611130
#%611581
#%836817
#%838193
#%887765
#%932186
#%950952
#%951151
#%952688
#%976458
#%977921
#%979169
#%1061343
#%1092604
#!
  
#*The convexity spectra of graphs.
#@Li-Da Tong,Pei-Lan Yen,Alastair Farrugia
#t2008
#cDiscrete Applied Mathematics
#index838891
#%836397
#%836736
#!
  
#*Labelling planar graphs without 4-cycles with a condition on distance two.
#@Weifan Wang,Leizhen Cai
#t2008
#cDiscrete Applied Mathematics
#index838892
#%609835
#%976845
#%977269
#%1060967
#%1061170
#%1061385
#%1061419
#%1061777
#%1061591
#%1061864
#%3480281
#%3480322
#!
  
#*Edge-bipancyclicity of a hypercube with faulty vertices and edges.
#@Sun-Yuan Hsieh,Tzu-Hsiung Shen
#t2008
#cDiscrete Applied Mathematics
#index838893
#%932527
#%933776
#%934171
#%1034073
#%1034824
#%1078237
#%1094980
#!
  
#*On single-machine scheduling without intermediate delays.
#@Philippe Chrétienne
#t2008
#cDiscrete Applied Mathematics
#index838894
#%814270
#%836028
#!
  
#*G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs.
#@Alain Bretto,Luc Gillibert
#t2008
#cDiscrete Applied Mathematics
#index838895
#%16638
#%449010
#%848300
#%864742
#%994829
#!
  
#*New bounds on binary identifying codes.
#@Geoffrey Exoo,Tero Laihonen,Sanna M. Ranto
#t2008
#cDiscrete Applied Mathematics
#index838896
#%842072
#%846967
#%976294
#%1059501
#%1105167
#!
  
#*A pseudo-Boolean consensus approach to nonlinear 0-1 optimization.
#@Bruno Simeone
#t2008
#cDiscrete Applied Mathematics
#index838897
#%621778
#%836813
#%839475
#!
  
#*Constrained versions of Sauer's lemma.
#@Joel Ratsaby
#t2008
#cDiscrete Applied Mathematics
#index838898
#%111148
#%854602
#!
  
#*Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system.
#@Shan Zhou,Heping Zhang,Ivan Gutman
#t2008
#cDiscrete Applied Mathematics
#index838899
#%838381
#%838391
#%838389
#%839122
#%839243
#!
  
#*Recalling Leo.
#@Vladimir Gurvich
#t2008
#cDiscrete Applied Mathematics
#index838900
#% 
#!
  
#*The colourful feasibility problem.
#@Antoine Deza,Sui Huang,Tamon Stephen,Tamás Terlaky
#t2008
#cDiscrete Applied Mathematics
#index838901
#% 
#!
  
#*Edge ranking and searching in partial orders.
#@Dariusz Dereniowski
#t2008
#cDiscrete Applied Mathematics
#index838902
#%610941
#%836612
#%837473
#%881655
#%953386
#%1058568
#!
  
#*Expected number of breakpoints after t random reversals in genomes with duplicate genes.
#@Niklas Eriksen
#t2008
#cDiscrete Applied Mathematics
#index838903
#%438430
#%559069
#%650495
#%950590
#%1061151
#%1061065
#%1086962
#%1087067
#%1091582
#%623255
#!
  
#*Minimizing a monotone concave function with laminar covering constraints.
#@Mariko Sakashita,Kazuhisa Makino,Satoru Fujishige
#t2008
#cDiscrete Applied Mathematics
#index838904
#%933063
#%952499
#%973099
#%1060116
#%1061347
#%3005546
#!
  
#*Random-order bin packing.
#@Edward G. Coffman Jr.,János Csirik,Lajos Rónyai,Ambrus Zsbán
#t2008
#cDiscrete Applied Mathematics
#index838905
#%610876
#%622099
#!
  
#*Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
#@Leonid Khachiyan,Endre Boros,Khaled M. Elbassioni,Vladimir Gurvich
#t2008
#cDiscrete Applied Mathematics
#index838906
#%2067
#%545113
#%551664
#%597957
#%836263
#%837012
#%887270
#%952955
#%1058694
#%1058693
#%1058869
#%1059106
#%1061507
#%1089353
#!
  
#*Impact of memory size on graph exploration capability.
#@Pierre Fraigniaud,David Ilcinkas,Andrzej Pelc
#t2008
#cDiscrete Applied Mathematics
#index838907
#%210103
#%210154
#%610413
#%622331
#%839432
#%887049
#%887166
#%887447
#%931757
#%952781
#%952849
#%953462
#%971417
#%1009277
#%1058315
#%1058516
#%1092719
#!
  
#*A sharp lower bound of the Randic index of cacti with r pendants.
#@Anhua Lin,Rong Luo,Xiaoya Zha
#t2008
#cDiscrete Applied Mathematics
#index838908
#% 
#!
  
#*Center location problems on tree graphs with subtree-shaped customers.
#@Justo Puerto,Arie Tamir,Juan A. Mesa,Dionisio Pérez-Brito
#t2008
#cDiscrete Applied Mathematics
#index838909
#%481153
#%610534
#%930255
#%950099
#%951147
#%971514
#%1013238
#%1014111
#%1059461
#%3612495
#!
  
#*Stability of two player game structures.
#@Andreas Polyméris
#t2008
#cDiscrete Applied Mathematics
#index838910
#%837012
#%952955
#!
  
#*Variable space search for graph coloring.
#@Alain Hertz,Matthieu Plumettaz,Nicolas Zufferey
#t2008
#cDiscrete Applied Mathematics
#index838911
#%773510
#%775032
#%812787
#%813609
#%813608
#%814813
#%838753
#%979993
#!
  
#*Using solution properties within an enumerative search to solve a sports league scheduling problem.
#@Jean-Philippe Hamiez,Jin-Kao Hao
#t2008
#cDiscrete Applied Mathematics
#index838912
#%11862
#%12979
#%117328
#%166635
#%548069
#%837052
#%838250
#!
  
#*Partition into cliques for cubic graphs: Planar case, complexity and approximation.
#@Márcia R. Cerioli,L. Faria,T. O. Ferreira,Carlos A. J. Martinhon,Fábio Protti,Bruce A. Reed
#t2008
#cDiscrete Applied Mathematics
#index838913
#%622487
#%816476
#%931564
#%1058566
#%1059580
#!
  
#*Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs.
#@Andrej Taranenko,Aleksander Vesel
#t2008
#cDiscrete Applied Mathematics
#index838914
#%838393
#%838389
#%839122
#%848186
#%854708
#!
  
#*Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))).
#@Francesco Belardo,Enzo Maria Li Marzi,Slobodan K. Simic
#t2008
#cDiscrete Applied Mathematics
#index838915
#% 
#!
  
#*Semidefinite programming and arithmetic circuit evaluation.
#@Sergey P. Tarasov,Mikhail N. Vyalyi
#t2008
#cDiscrete Applied Mathematics
#index838916
#%269002
#%622442
#%623208
#%741522
#%798317
#%1014129
#%1058980
#%1342032
#%3005167
#!
  
#*The extremal values of the Wiener index of a tree with given degree sequence.
#@Hua Wang
#t2008
#cDiscrete Applied Mathematics
#index838917
#%836787
#%1061984
#!
  
#*An algorithm for the difference between set covers.
#@Deborah S. Franzblau,George Xenakis
#t2008
#cDiscrete Applied Mathematics
#index838918
#%3482
#%621652
#%3004663
#!
  
#*Scientific contributions of Leo Khachiyan (a short overview).
#@Endre Boros,Vladimir Gurvich
#t2008
#cDiscrete Applied Mathematics
#index838919
#%186310
#%211137
#%493243
#%610881
#%620029
#%751378
#%836263
#%837012
#%838640
#%838643
#%838906
#%839505
#%843572
#%852493
#%934768
#%952955
#%960155
#%960235
#%1013841
#%1016282
#%1058694
#%1058693
#%1061507
#%1095732
#%1095806
#%2892292
#!
  
#*Polar cographs.
#@Tinaz Ekim,Nadimpalli V. R. Mahadev,Dominique de Werra
#t2008
#cDiscrete Applied Mathematics
#index838920
#% 
#!
  
#*On the complexity of monotone dualization and generating minimal hypergraph transversals.
#@Khaled M. Elbassioni
#t2008
#cDiscrete Applied Mathematics
#index838921
#%92952
#%109196
#%186128
#%268842
#%415677
#%545113
#%610445
#%621914
#%623964
#%818064
#%817943
#%836263
#%837012
#%887270
#%931986
#%933856
#%934768
#%950383
#%952955
#%953384
#%972334
#%1009445
#%1058693
#%1059107
#%1059106
#%1060052
#%1061507
#%1089353
#%1125156
#!
  
#*Distance with generalized neighbourhood sequences in n D and infinity D.
#@Benedek Nagy
#t2008
#cDiscrete Applied Mathematics
#index838922
#% 
#!
  
#*On the restricted homomorphism problem.
#@Richard C. Brewster,Timothy Graves
#t2008
#cDiscrete Applied Mathematics
#index838923
#%849138
#%852631
#%977355
#%1059157
#%1062035
#%1093730
#%1144516
#!
  
#*Embedding graphs as isometric medians.
#@Peter Dankelmann,Gert Sabidussi
#t2008
#cDiscrete Applied Mathematics
#index838924
#% 
#!
  
#*Identities via Bell matrix and Fibonacci matrix.
#@Weiping Wang,Tianming Wang
#t2008
#cDiscrete Applied Mathematics
#index838925
#%837501
#%838440
#!
  
#*On the minimal energy ordering of trees with perfect matchings.
#@Ji-Ming Guo
#t2008
#cDiscrete Applied Mathematics
#index838926
#%836861
#!
  
#*Problems related to a de Bruijn-Erdös theorem.
#@Xiaomin Chen,Vasek Chvátal
#t2008
#cDiscrete Applied Mathematics
#index838927
#% 
#!
  
#*An algorithm for constructing magic squares.
#@Yangkok Kim,Jaechil Yoo
#t2008
#cDiscrete Applied Mathematics
#index838928
#% 
#!
  
#*The Newton Bracketing method for the minimization of convex functions subject to affine constraints.
#@Adi Ben-Israel,Yuri Levin
#t2008
#cDiscrete Applied Mathematics
#index838929
#%813354
#%3458456
#!
  
#*On routing in VLSI design and communication networks.
#@Tamás Terlaky,Anthony Vannelli,Hu Zhang
#t2008
#cDiscrete Applied Mathematics
#index838930
#%210342
#%210890
#%610796
#%611165
#%621643
#%624086
#%798622
#%813114
#%814234
#%972455
#%972793
#%1013757
#%1013756
#%1014417
#%1061424
#%1122026
#%1275131
#%2892312
#%3006755
#!
  
#*A generalization of Fibonacci and Lucas matrices.
#@Predrag S. Stanimirovic,Jovana Nikolov,Ivan Stanimirovic
#t2008
#cDiscrete Applied Mathematics
#index838931
#%837501
#%838440
#!
  
#*An application of the Turán theorem to domination in graphs.
#@Erfang Shan,T. C. Edwin Cheng,Liying Kang
#t2008
#cDiscrete Applied Mathematics
#index838932
#% 
#!
  
#*Biprobabilistic values for bicooperative games.
#@Jesús Mario Bilbao,J. R. Fernández,N. Jiménez,J. J. López
#t2008
#cDiscrete Applied Mathematics
#index838933
#%857084
#%3449669
#!
  
#*Self-duality of bounded monotone boolean functions and related problems.
#@Daya Ram Gaur,Ramesh Krishnamurti
#t2008
#cDiscrete Applied Mathematics
#index838934
#%12615
#%415787
#%469050
#%545113
#%620029
#%621914
#%817943
#%854660
#%887270
#%950383
#%952955
#%1009445
#%1058695
#%1059106
#%1124706
#%1125156
#!
  
#*Equivalence of permutation polytopes corresponding to strictly supermodular functions.
#@Frank K. Hwang,J. S. Lee,Uriel G. Rothblum
#t2008
#cDiscrete Applied Mathematics
#index838935
#%838935
#%1014115
#!
  
#*Cost thresholds for dynamic resource location.
#@D. Jacob Wildstrom
#t2008
#cDiscrete Applied Mathematics
#index838936
#%952797
#%1089157
#!
  
#*Remembering Leo Khachiyan.
#@Vasek Chvátal
#t2008
#cDiscrete Applied Mathematics
#index838937
#% 
#!
  
#*Number-theoretic interpretation and construction of a digital circle.
#@Partha Bhowmick,Bhargab B. Bhattacharya
#t2008
#cDiscrete Applied Mathematics
#index838938
#%770309
#%833848
#%834559
#%834431
#%834560
#%834824
#%835046
#%836479
#%837317
#%1033394
#%1044204
#%1044945
#%1045431
#%1046358
#%1082170
#%1093487
#%1118895
#%1119363
#%1133865
#%3169635
#!
  
#*On the complexity of the multicut problem in bounded tree-width graphs and digraphs.
#@Cédric Bentz
#t2008
#cDiscrete Applied Mathematics
#index838939
#%78997
#%104482
#%610680
#%621730
#%952687
#%953214
#%976458
#%1058998
#%1059290
#!
  
#*Minimum cost homomorphisms to semicomplete multipartite digraphs.
#@Gregory Gutin,Arash Rafiey,Anders Yeo
#t2008
#cDiscrete Applied Mathematics
#index838940
#%824613
#%837019
#%837018
#%839231
#%865459
#%1061081
#!
  
#*On cyclic edge-connectivity of fullerenes.
#@Klavdija Kutnar,Dragan Marusic
#t2008
#cDiscrete Applied Mathematics
#index838941
#%848687
#%851632
#%852385
#%864500
#%1060986
#%1061416
#!
  
#*Constructions of optimal GDRP(n, lambda;v)'s of type lambdaµ.
#@Jie Yan,Jianxing Yin
#t2008
#cDiscrete Applied Mathematics
#index838942
#% 
#!
  
#*On the existence of maximal elements: An impossibility theorem.
#@Nikolai S. Kukushkin
#t2008
#cDiscrete Applied Mathematics
#index838943
#% 
#!
  
#*A distance approximating trees.
#@Vojtech Bálint
#t2008
#cDiscrete Applied Mathematics
#index838944
#%620729
#%864315
#%952771
#%1061140
#%1190766
#!
  
#*Some results on the ordering of the Laplacian spectral radii of unicyclic graphs.
#@Ying Liu,Jia-Yu Shao,Xi-Ying Yuan
#t2008
#cDiscrete Applied Mathematics
#index838945
#%1061422
#%2990621
#!
  
#*Some decision and counting problems of the Duquenne-Guigues basis of implications.
#@Sergei O. Kuznetsov,Sergei A. Obiedkov
#t2008
#cDiscrete Applied Mathematics
#index838946
#%160
#%289855
#%620029
#!
  
#*Foreword.
#@Dominique de Werra,Endre Boros,Jacques Carlier,Alain Hertz,Marino Widmer
#t2008
#cDiscrete Applied Mathematics
#index838947
#% 
#!
  
#*Computational aspects of monotone dualization: A brief survey.
#@Thomas Eiter,Kazuhisa Makino,Georg Gottlob
#t2008
#cDiscrete Applied Mathematics
#index838948
#%92952
#%105195
#%109196
#%186127
#%268842
#%302520
#%469050
#%545113
#%620190
#%621914
#%744999
#%751378
#%751483
#%817943
#%836263
#%836682
#%837012
#%845960
#%852493
#%887270
#%887751
#%924253
#%931986
#%932589
#%933856
#%934484
#%950849
#%952955
#%953384
#%1003432
#%1009237
#%1009233
#%1009445
#%1058695
#%1058694
#%1058693
#%1059107
#%1059106
#%1060052
#%1089353
#%1090422
#%1342036
#!
  
#*An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
#@Toshihide Ibaraki,Shinji Imahori,Koji Nonobe,Kensuke Sobue,Takeaki Uno,Mutsunori Yagiura
#t2008
#cDiscrete Applied Mathematics
#index838949
#%268352
#%813588
#%838421
#%885354
#%924088
#%1061490
#%1288560
#%1288545
#%1288534
#%1288526
#!
  
#*Analysis on the strip-based projection model for discrete tomography.
#@Jiehua Zhu,Xiezhang Li,Yangbo Ye,Ge Wang
#t2008
#cDiscrete Applied Mathematics
#index838950
#%836513
#%836797
#%838136
#%846901
#%1061017
#%1091677
#!
  
#*Some identities on the Catalan, Motzkin and Schröder numbers.
#@Eva Yu-Ping Deng,Wei-Jun Yan
#t2008
#cDiscrete Applied Mathematics
#index838951
#% 
#!
  
#*The 0-1 inverse maximum stable set problem.
#@Yerim Chung,Marc Demange
#t2008
#cDiscrete Applied Mathematics
#index838952
#%210576
#%934601
#%1058566
#%1090836
#!
  
#*Bell polynomials and k-generalized Dyck paths.
#@Toufik Mansour,Yidong Sun
#t2008
#cDiscrete Applied Mathematics
#index838953
#%851524
#%852336
#%864075
#!
  
#*A note on the signed edge domination number in graphs.
#@Xueliang Fu,Yuansheng Yang,Baoqi Jiang
#t2008
#cDiscrete Applied Mathematics
#index838954
#% 
#!
  
#*Parabolic target space and primal-dual interior-point methods.
#@Yu. Nesterov
#t2008
#cDiscrete Applied Mathematics
#index838955
#%3005017
#!
  
#*Cyclic games and linear programming.
#@Sergei G. Vorobyov
#t2008
#cDiscrete Applied Mathematics
#index838956
#%111308
#%610814
#%619962
#%621754
#%622390
#%838529
#%839305
#%861765
#%887483
#%1013505
#%1013811
#%1013819
#%1016282
#%1059529
#%1061446
#%1089419
#%1089418
#%1095429
#!
  
#*On finding augmenting graphs.
#@Vadim V. Lozin,Martin Milanic
#t2008
#cDiscrete Applied Mathematics
#index838957
#%610703
#%835920
#%836211
#%835924
#%836917
#%931685
#%978695
#!
  
#*Finding Hamiltonian circuits in quasi-adjoint graphs.
#@Jacek Blazewicz,Marta Kasprzak,Benjamin Leroy-Beaulieu,Dominique de Werra
#t2008
#cDiscrete Applied Mathematics
#index838958
#%836162
#%854237
#%1059012
#%1089453
#!
  
#*A construction of d-disjunct matrices in a dual space of symplectic space.
#@Geng-sheng Zhang,Bo-li Li,Xiao-lei Sun,Feng-xia Li
#t2008
#cDiscrete Applied Mathematics
#index838959
#% 
#!
  
#*Formulas for approximating pseudo-Boolean random variables.
#@Guoli Ding,Robert F. Lax,Jianhua Chen,Peter P. Chen
#t2008
#cDiscrete Applied Mathematics
#index838960
#%1013094
#%1021420
#!
  
#*On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3.
#@Shigeto Nishimura
#t2008
#cDiscrete Applied Mathematics
#index838961
#%847507
#!
  
#*Graph parameters measuring neighbourhoods in graphs - Bounds and applications.
#@Frank Gurski
#t2008
#cDiscrete Applied Mathematics
#index838962
#%186416
#%268616
#%594633
#%621985
#%832456
#%836713
#%839341
#%1059718
#%1060429
#%1091656
#!
  
#*Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number.
#@Mustapha Aouchiche,Gunnar Brinkmann,Pierre Hansen
#t2008
#cDiscrete Applied Mathematics
#index838963
#%813608
#%847194
#%853975
#%975532
#!
  
#*Patterns of simple gene assembly in ciliates.
#@Tero Harju,Ion Petre,Vladimir Rogojin,Grzegorz Rozenberg
#t2008
#cDiscrete Applied Mathematics
#index838964
#%66335
#%118578
#%118817
#%558741
#%622245
#%882669
#%1059710
#%3296031
#!
  
#*Counting and enumerating aggregate classifiers.
#@Jan Adem,Yves Crama,Willy Gochet,Frits C. R. Spieksma
#t2008
#cDiscrete Applied Mathematics
#index838965
#%751483
#%836133
#%854660
#%1009242
#%1009890
#%1078112
#%1112474
#%1124706
#%1125156
#!
  
#*Analysis of Low Hamming Weight Products.
#@Jung Hee Cheon,HongTae Kim
#t2008
#cDiscrete Applied Mathematics
#index838966
#%120485
#%120560
#%837167
#%1012365
#!
  
#*Rotation symmetric Boolean functions - Count and cryptographic properties.
#@Pantelimon Stanica,Subhamoy Maitra
#t2008
#cDiscrete Applied Mathematics
#index838967
#%16601
#%193423
#%399389
#%837921
#%841862
#!
  
#*Convex drawings of graphs with non-convex boundary constraints.
#@Seok-Hee Hong,Hiroshi Nagamochi
#t2008
#cDiscrete Applied Mathematics
#index838968
#%2583
#%3482
#%110871
#%611249
#%824626
#!
  
#*Sums of squares based approximation algorithms for MAX-SAT.
#@Hans van Maaren,Linda van Norden,M. J. H. Heule
#t2008
#cDiscrete Applied Mathematics
#index838969
#%211095
#%406902
#%611394
#%950456
#%950618
#%1013375
#%2892352
#!
  
#*Reverse 2-median problem on trees.
#@Rainer E. Burkard,Elisabeth Gassner,Johannes Hatzl
#t2008
#cDiscrete Applied Mathematics
#index838970
#%952950
#%1024753
#%1090674
#%3457862
#!
  
#*On chromatic and flow polynomial unique graphs.
#@Yinghua Duan,Haidong Wu,Qinglin Yu
#t2008
#cDiscrete Applied Mathematics
#index838971
#%848480
#%864183
#%883450
#%1091744
#!
  
#*An improvement on the complexity of factoring read-once Boolean functions.
#@Martin Charles Golumbic,Aviad Mintz,Udi Rotics
#t2008
#cDiscrete Applied Mathematics
#index838972
#%132281
#%282177
#%837012
#%837033
#%837700
#%949538
#!
  
#*Identical part production in cyclic robotic cells: Concepts, overview and open questions.
#@Nadia Brauner
#t2008
#cDiscrete Applied Mathematics
#index838973
#%835900
#%1054396
#%1054441
#%3005546
#!
  
#*Equivalences and the complete hierarchy of intersection graphs of paths in a tree.
#@Martin Charles Golumbic,Marina Lipshteyn,Michal Stern
#t2008
#cDiscrete Applied Mathematics
#index838974
#%838772
#!
  
#*Constructions for normal graphs and some consequences.
#@Annegret Wagler
#t2008
#cDiscrete Applied Mathematics
#index838975
#%838159
#%975847
#%1061581
#!
  
#*On the crossing numbers of Ksquare C and Ksquare P.
#@Zheng Wenping,Lin Xiaohui,Yang Yuansheng,Deng Chengrui
#t2008
#cDiscrete Applied Mathematics
#index838976
#% 
#!
  
#*Signed star k-subdomination numbers in graphs.
#@R. Saei,Seyed Mahmoud Sheikholeslami
#t2008
#cDiscrete Applied Mathematics
#index838977
#%838711
#%849264
#!
  
#*A simple criterion on degree sequences of graphs.
#@Amitabha Tripathi,Himanshu Tyagi
#t2008
#cDiscrete Applied Mathematics
#index838978
#%838533
#!
  
#*Non-deterministic ideal operators: An adequate tool for formalization in Data Bases.
#@Pablo Cordero,Angel Mora,Inman P. de Guzmán,Manuel Enciso
#t2008
#cDiscrete Applied Mathematics
#index838979
#%114
#%191
#%145134
#%176455
#%304145
#%545018
#%741792
#%745009
#%751557
#%836355
#%836605
#%836604
#%845960
#%1112376
#!
  
#*Applications of algebra to cryptography.
#@Maria Isabel Gonzalez Vasco,Rainer Steinwandt
#t2008
#cDiscrete Applied Mathematics
#index838980
#% 
#!
  
#*The median function on graphs with bounded profiles.
#@Kannan Balakrishnan,Manoj Changat,Sandi Klavzar
#t2008
#cDiscrete Applied Mathematics
#index838981
#%837496
#%837740
#%837636
#%837640
#%849193
#%932201
#%1061075
#!
  
#*Integer version of the multipath flow network synthesis problem.
#@Santosh N. Kabadi,Ramaswamy Chandrasekaran,K. P. K. Nair,Yash P. Aneja
#t2008
#cDiscrete Applied Mathematics
#index838982
#%836376
#%838666
#!
  
#*Efficient algorithms for Roman domination on some classes of graphs.
#@Mathieu Liedloff,Ton Kloks,Jiping Liu,Sheng-Lung Peng
#t2008
#cDiscrete Applied Mathematics
#index838983
#%186325
#%267665
#%384731
#%660501
#%836522
#%836821
#%837033
#%837427
#%847914
#%1061230
#!
  
#*On a relation between the domination number and a strongly connected bidirection of an undirected graph.
#@Martin Lätsch,Britta Peis
#t2008
#cDiscrete Applied Mathematics
#index838984
#% 
#!
  
#*On hamiltonian colorings for some graphs.
#@Yufa Shen,Wenjie He,Xue Li,Donghong He,Xiaojing Yang
#t2008
#cDiscrete Applied Mathematics
#index838985
#% 
#!
  
#*A clique-difference encoding scheme for labelled k-path graphs.
#@Paulo Renato da Costa Pereira,Lilian Markenzon,Oswaldo Vernet
#t2008
#cDiscrete Applied Mathematics
#index838986
#%1091696
#!
  
#*A new formulation for the Traveling Deliveryman Problem.
#@Isabel Méndez-Díaz,Paula Zabala,Abilio Lucena
#t2008
#cDiscrete Applied Mathematics
#index838987
#%268475
#%406991
#%609872
#%621291
#%621464
#%951516
#%1059341
#%1091092
#%1092764
#!
  
#*Jordan canonical form of Pascal-type matrices via sequences of binomial type.
#@Sheng-liang Yang
#t2008
#cDiscrete Applied Mathematics
#index838988
#% 
#!
  
#*Applications to cryptography of twisting commutative algebraic groups.
#@Alice Silverberg
#t2008
#cDiscrete Applied Mathematics
#index838989
#%50748
#%50851
#%51187
#%120424
#%192977
#%581040
#%1060844
#%3255745
#!
  
#*On the coverings of the d-cube for d<=6.
#@M. Reza Emamy-Khansary,Martin Ziegler
#t2008
#cDiscrete Applied Mathematics
#index838990
#% 
#!
  
#*On RSA moduli with almost half of the bits prescribed.
#@Sidney W. Graham,Igor Shparlinski
#t2008
#cDiscrete Applied Mathematics
#index838991
#%842561
#%976877
#!
  
#*The stack loading and unloading problem.
#@Federico Malucelli,Stefano Pallottino,Daniele Pretolani
#t2008
#cDiscrete Applied Mathematics
#index838992
#%813360
#%835976
#%1288592
#!
  
#*Counting preimages of TCP reordering patterns.
#@Anders Hansson,Gabriel Istrate
#t2008
#cDiscrete Applied Mathematics
#index838993
#%1121875
#%678897
#%3002637
#!
  
#*Discrete approximations to real-valued leaf sequencing problems in radiation therapy.
#@Athula Gunawardena,Robert R. Meyer
#t2008
#cDiscrete Applied Mathematics
#index838994
#%835981
#!
  
#*Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders.
#@W. C. Shiu
#t2008
#cDiscrete Applied Mathematics
#index838995
#% 
#!
  
#*The profile of the Cartesian product of graphs.
#@David Kuo,Jing-Ho Yan
#t2008
#cDiscrete Applied Mathematics
#index838996
#%772133
#%932369
#%1059884
#!
  
#*Strong structural properties of unidirectional star graphs.
#@Eddie Cheng,Marc J. Lipman,László Lipták
#t2008
#cDiscrete Applied Mathematics
#index838997
#%105138
#%574902
#%836493
#%837660
#%930810
#!
  
#*Closest 4-leaf power is fixed-parameter tractable.
#@Michael Dom,Jiong Guo,Falk Hüffner,Rolf Niedermeier
#t2008
#cDiscrete Applied Mathematics
#index838998
#%741094
#%837737
#%838073
#%929689
#%952772
#%953170
#%953423
#%971684
#%979540
#%1009272
#%1015519
#%1061638
#%1077279
#%1094988
#!
  
#*Minimization of circuit registers: Retiming revisited.
#@Bruno Gaujal,Jean Mairesse
#t2008
#cDiscrete Applied Mathematics
#index838999
#%950848
#%1059302
#%3003516
#!
  
#*Efficient edge domination in regular graphs.
#@Domingos Moreira Cardoso,J. Orestes Cerdeira,Charles Delorme,Pedro C. Silva
#t2008
#cDiscrete Applied Mathematics
#index839000
#%836956
#%837591
#%837589
#%854441
#%931480
#!
  
#*Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra.
#@Marc Bezem,Robert Nieuwenhuis,Enric Rodríguez-Carbonell
#t2008
#cDiscrete Applied Mathematics
#index839001
#% 
#!
  
#*Efficient solutions to the braid isotopy problem.
#@Patrick Dehornoy
#t2008
#cDiscrete Applied Mathematics
#index839002
#%953473
#!
  
#*Two-dimensional minimax Latin hypercube designs.
#@Edwin R. van Dam
#t2008
#cDiscrete Applied Mathematics
#index839003
#%3482
#%1289690
#!
  
#*The connectivity of a graph and its complement.
#@Angelika Hellwig,Lutz Volkmann
#t2008
#cDiscrete Applied Mathematics
#index839004
#% 
#!
  
#*Boundary value problems on weighted networks.
#@Enrique Bendito,Angeles Carmona,Andrés M. Encinas
#t2008
#cDiscrete Applied Mathematics
#index839005
#%839275
#!
  
#*An efficient algorithm for the three-guard problem.
#@Xuehou Tan
#t2008
#cDiscrete Applied Mathematics
#index839006
#%610422
#%803507
#%803676
#%843177
#%934849
#%1060513
#!
  
#*On the cycling operation in braid groups.
#@Juan González-Meneses,Volker Gebhardt
#t2008
#cDiscrete Applied Mathematics
#index839007
#% 
#!
  
#*The minimum degree distance of graphs of given order and size.
#@Orest Bucicovschi,Sebastian M. Cioaba
#t2008
#cDiscrete Applied Mathematics
#index839008
#%838594
#%838766
#%1144408
#!
  
#*FPTAS for half-products minimization with scheduling applications.
#@Erdal Erel,Jay B. Ghosh
#t2008
#cDiscrete Applied Mathematics
#index839009
#%837440
#%837308
#%838384
#%950753
#%951514
#%1275161
#!
  
#*Approximation algorithms for group prize-collecting and location-routing problems.
#@Hagai Glicksman,Michal Penn
#t2008
#cDiscrete Applied Mathematics
#index839010
#%610476
#%622234
#%660877
#%798116
#%952980
#%1013384
#%1024806
#%1059341
#!
  
#*Diameter-sufficient conditions for a graph to be super-restricted connected.
#@Camino Balbuena,Yuqing Lin,Mirka Miller
#t2008
#cDiscrete Applied Mathematics
#index839011
#%178357
#%849145
#%931027
#!
  
#*2-piercings via graph theory.
#@Rudi Pendavingh,Quintijn Puite,Gerhard J. Woeginger
#t2008
#cDiscrete Applied Mathematics
#index839012
#% 
#!
  
#*The Hosoya polynomial decomposition for catacondensed benzenoid graphs.
#@Shoujun Xu,Heping Zhang
#t2008
#cDiscrete Applied Mathematics
#index839013
#%837297
#%838874
#!
  
#*Weighted fusion graphs: Merging properties and watersheds.
#@Jean Cousty,Michel Couprie,Laurent Najman,Gilles Bertrand
#t2008
#cDiscrete Applied Mathematics
#index839014
#%834104
#%834578
#%834811
#%837761
#%947490
#%949610
#%1031541
#%1032534
#%1033267
#%1060544
#%1339232
#%1339247
#!
  
#*Balanced decomposition of a vertex-colored graph.
#@Shinya Fujita,Tomoki Nakamigawa
#t2008
#cDiscrete Applied Mathematics
#index839015
#%865088
#!
  
#*Group theoretic properties of Rijndael-like ciphers.
#@Rüdiger Sparr,Ralph Wernsdorf
#t2008
#cDiscrete Applied Mathematics
#index839016
#%484
#%50801
#%51026
#%120280
#%193174
#%217294
#%985984
#%3002082
#%3255655
#!
  
#*The complexity of a minimum reload cost diameter problem.
#@Giulia Galbiati
#t2008
#cDiscrete Applied Mathematics
#index839017
#%838276
#!
  
#*Redundancies of correction capability optimized Reed-Muller codes.
#@Maria Bras-Amorós,Michael E. O'Sullivan
#t2008
#cDiscrete Applied Mathematics
#index839018
#%16684
#%16911
#%853501
#!
  
#*Constant memory routing in quasi-planar and quasi-polyhedral graphs.
#@Evangelos Kranakis,Tim Mott,Ladislav Stacho
#t2008
#cDiscrete Applied Mathematics
#index839019
#%110670
#%506352
#%544195
#%1141106
#!
  
#*The minimum spanning strong subdigraph problem is fixed parameter tractable.
#@Jørgen Bang-Jensen,Anders Yeo
#t2008
#cDiscrete Applied Mathematics
#index839020
#%611337
#%660948
#%837416
#%949945
#%952591
#%952994
#%974469
#%974650
#%1059764
#%1061087
#%1062115
#!
  
#*Graph theoretic approach to parallel gene assembly.
#@Tero Harju,Chang Li,Ion Petre
#t2008
#cDiscrete Applied Mathematics
#index839021
#%66335
#%797965
#%821747
#%838868
#%974787
#%1021453
#%1070169
#%1089695
#!
  
#*Routing to reduce the cost of wavelength conversion.
#@Thomas Erlebach,Stamatis Stefanakos
#t2008
#cDiscrete Applied Mathematics
#index839022
#%611355
#%620202
#%836843
#%953220
#%1088756
#%1089001
#!
  
#*Efficiency in exponential time for domination-type problems.
#@Ingo Schiermeyer
#t2008
#cDiscrete Applied Mathematics
#index839023
#%610441
#%610443
#%817916
#%818008
#%867310
#%933120
#%1090785
#%3480180
#!
  
#*On diagnosability of large multiprocessor networks.
#@Rudolf Ahlswede,Harout K. Aydinian
#t2008
#cDiscrete Applied Mathematics
#index839024
#%832185
#%838320
#%851250
#%952701
#%1080150
#%1081459
#%1081633
#%1081741
#!
  
#*Preemptive scheduling and antichain polyhedra.
#@Alain Quilliot
#t2008
#cDiscrete Applied Mathematics
#index839025
#%744297
#%772122
#%837929
#%951230
#!
  
#*On L(d, 1)-labeling of Cartesian product of a cycle and a path.
#@Shih-Hu Chiang,Jing-Ho Yan
#t2008
#cDiscrete Applied Mathematics
#index839026
#%837309
#%838586
#%847714
#%848356
#%854494
#%864266
#%1061170
#%1061385
#%1061419
#%1061652
#%1061383
#%1061777
#!
  
#*An efficient distributed algorithm for canonical labeling on directed split-stars.
#@Fu-Hsing Wang
#t2008
#cDiscrete Applied Mathematics
#index839027
#%769541
#%836427
#%989943
#%1024675
#%1112620
#%1124970
#!
  
#*A method for efficiently computing the number of codewords of fixed weights in linear codes.
#@Iliya Bouyukliev,Valentin Bakoev
#t2008
#cDiscrete Applied Mathematics
#index839028
#% 
#!
  
#*The competition numbers of complete tripartite graphs.
#@Suh-Ryung Kim,Yoshio Sano
#t2008
#cDiscrete Applied Mathematics
#index839029
#% 
#!
  
#*Parameterized algorithmics for linear arrangement problems.
#@Henning Fernau
#t2008
#cDiscrete Applied Mathematics
#index839030
#%111383
#%132459
#%224878
#%268897
#%446391
#%832456
#%836972
#%952547
#%953372
#%979944
#%1083408
#%3418548
#%3418019
#!
  
#*The Independence Number for De Bruijn networks and Kautz networks.
#@Zhi-Guo Deng,Bao-Gen Xu
#t2008
#cDiscrete Applied Mathematics
#index839031
#%854089
#%930808
#%988491
#%1077859
#%1078237
#%1081717
#%1124776
#!
  
#*On a conjecture of Erdös, Graham and Spencer, II.
#@Jin-Hui Fang,Yong-Gao Chen
#t2008
#cDiscrete Applied Mathematics
#index839032
#% 
#!
  
#*Semi-preemptive routing on trees.
#@Sven Oliver Krumke,Dirk Räbiger,Rainer Schrader
#t2008
#cDiscrete Applied Mathematics
#index839033
#%210342
#%211553
#%621393
#%836997
#%837098
#%952948
#%1058463
#%1059213
#!
  
#*Preface for CTW2005 special issue.
#@Ulrich Faigle,Bert Randerath,Rainer Schrader
#t2008
#cDiscrete Applied Mathematics
#index839034
#% 
#!
  
#*Randomized strategies for the plurality problem.
#@Daniel Král,Jiri Sgall,Tomás Tichý
#t2008
#cDiscrete Applied Mathematics
#index839035
#%493590
#%831280
#%882421
#%929617
#%929619
#%931554
#%1058325
#%1088659
#!
  
#*Pairings for cryptographers.
#@Steven D. Galbraith,Kenneth G. Paterson,Nigel P. Smart
#t2008
#cDiscrete Applied Mathematics
#index839036
#%42711
#%83733
#%838570
#%842591
#%911277
#%985909
#!
  
#*A distance-labelling problem for hypercubes.
#@Sanming Zhou
#t2008
#cDiscrete Applied Mathematics
#index839037
#%17856
#%933117
#%977425
#%1061385
#%1061419
#%1061886
#%1095398
#!
  
#*Symmetry in complex networks.
#@Ben D. MacArthur,Rubén J. Sánchez-García,James W. Anderson
#t2008
#cDiscrete Applied Mathematics
#index839038
#%975620
#%1122774
#!
  
#*Topological sweep of the complete graph.
#@Eynat Rafalin,Diane L. Souvaine
#t2008
#cDiscrete Applied Mathematics
#index839039
#%38704
#%110683
#%111431
#%610132
#%768131
#%774732
#%775233
#%803482
#%803540
#%837765
#%853399
#%949991
#%971843
#%1059093
#%1078186
#%1156038
#!
  
#*An improved algorithm for the longest induced path problem on k-chordal graphs.
#@Tetsuya Ishizeki,Yota Otachi,Koichi Yamazaki
#t2008
#cDiscrete Applied Mathematics
#index839040
#%2022
#%268601
#%836196
#%931339
#%933950
#%1061113
#%1061165
#!
  
#*A covering problem that is easy for trees but -complete for trivalent graphs.
#@Rolf Bardeli,Michael Clausen,Andreas Ribbrock
#t2008
#cDiscrete Applied Mathematics
#index839041
#% 
#!
  
#*On quintic quasi-cyclic codes.
#@Anne Desideri Bracco,Ann Marie Natividad,Patrick Solé
#t2008
#cDiscrete Applied Mathematics
#index839042
#%842132
#!
  
#*Minimal arithmetic thickness connecting discrete planes.
#@Damien Jamet,Jean-Luc Toutant
#t2009
#cDiscrete Applied Mathematics
#index839043
#%833639
#%836224
#%838629
#%1089697
#%1091457
#!
  
#*A topological sampling theorem for Robust boundary reconstruction and image segmentation.
#@Hans Meine,Ullrich Köthe,Peer Stelldinger
#t2009
#cDiscrete Applied Mathematics
#index839044
#%833678
#%1031204
#%1033267
#%1119099
#%1339385
#%1339439
#%3077397
#!
  
#*2-extendability of toroidal polyhexes and Klein-bottle polyhexes.
#@Dong Ye,Heping Zhang
#t2009
#cDiscrete Applied Mathematics
#index839045
#%622722
#%837313
#%851333
#%932376
#%975334
#%977004
#%3480340
#!
  
#*Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix.
#@Hong-Bin Chen,Yongxi Cheng,Qian He,Chongchong Zhong
#t2009
#cDiscrete Applied Mathematics
#index839046
#% 
#!
  
#*Layouts for mobility management in wireless ATM networks.
#@Michele Flammini,Alfredo Navarra
#t2009
#cDiscrete Applied Mathematics
#index839047
#%336612
#%382629
#%543992
#%612202
#%653733
#%836924
#%1012627
#%1060487
#%1089221
#%1122172
#%1141092
#%1141067
#%1141355
#%1141331
#!
  
#*Balancing modular transfer lines with serial-parallel activation of spindle heads at stations.
#@Alexandre Dolgui,I. Ihnatsenka
#t2009
#cDiscrete Applied Mathematics
#index839048
#% 
#!
  
#*Feature controlled adaptive difference operators.
#@Peter Veelaert,Kristof Teelen
#t2009
#cDiscrete Applied Mathematics
#index839049
#%834061
#%1031464
#%1031585
#!
  
#*Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension.
#@Valentin E. Brimkov
#t2009
#cDiscrete Applied Mathematics
#index839050
#%153946
#%153948
#%803818
#%806941
#%833639
#%834111
#%835183
#%836224
#%838629
#%930924
#%951246
#%1044016
#%1089149
#%1089696
#%1089697
#%1333862
#%3004083
#!
  
#*A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case.
#@Vladimir Kats,Eugene Levner
#t2009
#cDiscrete Applied Mathematics
#index839051
#%835900
#%1054441
#%1054427
#!
  
#*The Ramsey number for a cycle of length six versus a clique of order eight.
#@Yaojun Chen,T. C. Edwin Cheng,Ran Xu
#t2009
#cDiscrete Applied Mathematics
#index839052
#%3480217
#!
  
#*Representation of graphs by OBDDs.
#@Robin Nunkesser,Philipp Woelfel
#t2009
#cDiscrete Applied Mathematics
#index839053
#%622407
#%878912
#%889441
#%977584
#%1078407
#%1089675
#!
  
#*Transforming a graph into a 1-balanced graph.
#@Lavanya Kannan,Arthur M. Hobbs,Hong-Jian Lai,Hongyuan Lai
#t2009
#cDiscrete Applied Mathematics
#index839054
#%836358
#%930505
#%1059429
#!
  
#*On strong unimodality of multivariate discrete distributions.
#@Ersoy Subasi,Munevver Mine Subasi,András Prékopa
#t2009
#cDiscrete Applied Mathematics
#index839055
#% 
#!
  
#*Preface.
#@László G. Nyúl,Kálmán Palágyi
#t2009
#cDiscrete Applied Mathematics
#index839056
#% 
#!
  
#*A polynomial-time algorithm for the paired-domination problem on permutation graphs.
#@T. C. Edwin Cheng,Liying Kang,Erfang Shan
#t2009
#cDiscrete Applied Mathematics
#index839057
#%588342
#%838648
#%883233
#%929827
#%932563
#%934715
#%953149
#%1060701
#%1092447
#%836391
#!
  
#*On Ramsey numbers of fans.
#@Qizhong Lin,Yusheng Li
#t2009
#cDiscrete Applied Mathematics
#index839058
#%838370
#!
  
#*The box-TDI system associated with 2-edge connected spanning subgraphs.
#@Xujin Chen,Guoli Ding,Wenan Zang
#t2009
#cDiscrete Applied Mathematics
#index839059
#%852538
#%1013655
#%1013977
#%1014000
#!
  
#*Note on non-separating and removable cycles in highly connected graphs.
#@Shinya Fujita,Ken-ichi Kawarabayashi
#t2009
#cDiscrete Applied Mathematics
#index839060
#%831057
#%975466
#%975910
#%977161
#!
  
#*Periodic schedules for linear precedence constraints.
#@Claire Hanen,Alix Munier Kordon
#t2009
#cDiscrete Applied Mathematics
#index839061
#%2022
#%837745
#%878874
#%1080378
#%1166098
#!
  
#*Dichotomy for bounded degree H-colouring.
#@Mark H. Siggers
#t2009
#cDiscrete Applied Mathematics
#index839062
#%494273
#%622761
#%830912
#%1144500
#!
  
#*Order statistics and estimating cardinalities of massive data sets.
#@Frédéric Giroire
#t2009
#cDiscrete Applied Mathematics
#index839063
#%210565
#%299762
#%398861
#%557748
#%598752
#%642592
#%1118740
#%1122910
#!
  
#*Coloring the square of the Kneser graph and the Schrijver graph .
#@Jun-Yo Chen,Ko-Wei Lih,Jiaojiao Wu
#t2009
#cDiscrete Applied Mathematics
#index839064
#% 
#!
  
#*Generic iterative subset algorithms for discrete tomography.
#@Kees Joost Batenburg,Jan Sijbers
#t2009
#cDiscrete Applied Mathematics
#index839065
#%851477
#%953002
#%1061277
#%1095490
#%1339132
#%2892320
#%3005546
#!
  
#*Forwarding index of cube-connected cycles.
#@Jun Yan,Jun-Ming Xu,Chao Yang
#t2009
#cDiscrete Applied Mathematics
#index839066
#%775237
#%836923
#%836904
#%838069
#%839343
#%934514
#%1024687
#%1061775
#%1078477
#%1104914
#!
  
#*On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2.
#@Hyeonjin Kim,Sung-Mo Park,Sang Geun Hahn
#t2009
#cDiscrete Applied Mathematics
#index839067
#%838508
#%838967
#!
  
#*Graph structural properties of non-Yutsis graphs allowing fast recognition.
#@Robert E. L. Aldred,Dries Van Dyck,Gunnar Brinkmann,Veerle Fack,Brendan D. McKay
#t2009
#cDiscrete Applied Mathematics
#index839068
#% 
#!
  
#*On the combinatorial structure of a class of shortened Hamming codes and their dual-codes.
#@M. Esmaeili,A. Zaghian
#t2009
#cDiscrete Applied Mathematics
#index839069
#% 
#!
  
#*On the tiling by translation problem.
#@Srecko Brlek,Xavier Provençal,Jean-Marc Fedou
#t2009
#cDiscrete Applied Mathematics
#index839070
#%522
#%833678
#%972133
#!
  
#*Global defensive k-alliances in graphs.
#@Juan Alberto Rodríguez-Velazquez,Jose Maria Sigarreta
#t2009
#cDiscrete Applied Mathematics
#index839071
#% 
#!
  
#*The complexity of nonrepetitive coloring.
#@Dániel Marx,Marcus Schaefer
#t2009
#cDiscrete Applied Mathematics
#index839072
#%861707
#%949588
#%1051748
#%1090359
#!
  
#*Discrete-Euclidean operations.
#@Gaëlle Largeteau-Skapin,Eric Andres
#t2009
#cDiscrete Applied Mathematics
#index839073
#%153946
#%153948
#%153944
#%593637
#%639811
#%833834
#%929927
#%1133588
#%3003051
#!
  
#*Offensive r-alliances in graphs.
#@Henning Fernau,Juan Alberto Rodríguez-Velazquez,Jose Maria Sigarreta
#t2009
#cDiscrete Applied Mathematics
#index839074
#% 
#!
  
#*On the global offensive alliance number of a graph.
#@Jose Maria Sigarreta,Juan Alberto Rodríguez-Velazquez
#t2009
#cDiscrete Applied Mathematics
#index839075
#% 
#!
  
#*Fall colouring of bipartite graphs and cartesian products of graphs.
#@Renu Laskar,Jeremy Lyle
#t2009
#cDiscrete Applied Mathematics
#index839076
#%837221
#%1025609
#!
  
#*On the matching polynomial of subdivision graphs.
#@Weigen Yan,Yeong-Nan Yeh
#t2009
#cDiscrete Applied Mathematics
#index839077
#%798404
#%839310
#!
  
#*Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
#@Cristina G. Fernandes,Orlando Lee,Yoshiko Wakabayashi
#t2009
#cDiscrete Applied Mathematics
#index839078
#%839345
#%887537
#%951384
#%952621
#%976420
#%1060543
#%1090228
#!
  
#*A note on list improper coloring of plane graphs.
#@Wei Dong,Baogang Xu
#t2009
#cDiscrete Applied Mathematics
#index839079
#%848948
#!
  
#*Mutual exclusion scheduling with interval graphs or related classes, Part I.
#@Frédéric Gardi
#t2009
#cDiscrete Applied Mathematics
#index839080
#%38457
#%186221
#%660828
#%813096
#%836552
#%848106
#%852565
#%888370
#%930689
#%932555
#%960011
#%1059009
#%1061020
#%1079517
#%1089092
#%1089501
#%1091696
#%1196586
#!
  
#*Chain homotopies for object topological representations.
#@Rocío González-Díaz,María José Jiménez,Belén Medrano,Pedro Real
#t2009
#cDiscrete Applied Mathematics
#index839081
#%610467
#%836965
#%993759
#!
  
#*On randomized broadcasting in Star graphs.
#@Robert Elsässer,Ulf Lorenz,Thomas Sauerwald
#t2009
#cDiscrete Applied Mathematics
#index839082
#%211105
#%411338
#%543863
#%838069
#%838090
#%931554
#%971445
#%989664
#%1077859
#%1079226
#%1124904
#%1125489
#%1125770
#!
  
#*Quasi-median hulls in Hamming space are Steiner hulls.
#@Hans-Jürgen Bandelt,Arne Röhl
#t2009
#cDiscrete Applied Mathematics
#index839083
#%522
#%660441
#%836018
#%1061820
#!
  
#*Simploidals sets: Definitions, operations and comparison with simplicial sets.
#@Samuel Peltier,Laurent Fuchs,Pascal Lienhardt
#t2009
#cDiscrete Applied Mathematics
#index839084
#%345947
#%836965
#%1119031
#!
  
#*A generalized preimage for the digital analytical hyperplane recognition.
#@Martine Dexet,Eric Andres
#t2009
#cDiscrete Applied Mathematics
#index839085
#%154042
#%833639
#%833717
#%833834
#%836480
#%837317
#%838629
#%947608
#%1044848
#!
  
#*A comment to: Two classes of edge domination in graphs.
#@S. Jahanbekam
#t2009
#cDiscrete Applied Mathematics
#index839086
#% 
#!
  
#*The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks.
#@F. H. Chang,Hung-Lin Fu,Frank K. Hwang,B. C. Lin
#t2009
#cDiscrete Applied Mathematics
#index839087
#%848643
#!
  
#*Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model.
#@Ji-Cherng Lin,Ming-Yi Chiu
#t2009
#cDiscrete Applied Mathematics
#index839088
#%567266
#%617069
#%673336
#%771309
#%841320
#%931800
#%972237
#%1058729
#%1078395
#!
  
#*Critically indecomposable graphs.
#@Chandan K. Dubey,Shashank K. Mehta
#t2009
#cDiscrete Applied Mathematics
#index839089
#%660579
#%852147
#%853639
#%1090851
#%1090857
#!
  
#*Forwarding and optical indices of a graph.
#@Adrian Kosowski
#t2009
#cDiscrete Applied Mathematics
#index839090
#%267364
#%268059
#%614044
#%622955
#%660980
#%836066
#%838179
#%839343
#%1061775
#%1096113
#%1104914
#!
  
#*Minimum decomposition of a digital surface into digital plane segments is NP-hard.
#@Isabelle Sivignon,David Coeurjolly
#t2009
#cDiscrete Applied Mathematics
#index839091
#%110824
#%750598
#%833639
#%836759
#%837317
#%838629
#%947614
#%3004083
#!
  
#*The hierarchical product of graphs.
#@Lali Barrière,Francesc Comellas,Cristina Dalfó,Miguel Angel Fiol
#t2009
#cDiscrete Applied Mathematics
#index839092
#%836832
#!
  
#*Listing minimal edge-covers of intersecting families with applications to connectivity problems.
#@Zeev Nutov
#t2009
#cDiscrete Applied Mathematics
#index839093
#%931986
#%1060449
#!
  
#*The generalized assignment problem with flexible jobs.
#@Chase Rainwater,Joseph Geunes,H. Edwin Romeijn
#t2009
#cDiscrete Applied Mathematics
#index839094
#%837971
#%862447
#%1013590
#%1289645
#%1290061
#%2884315
#%2884556
#!
  
#*Disjoint paths in symmetric digraphs.
#@Aubin Jarry,Stéphane Pérennes
#t2009
#cDiscrete Applied Mathematics
#index839095
#%622606
#%838291
#%951299
#%951591
#%977721
#%1061542
#!
  
#*A new lower bound for the single row facility layout problem.
#@André R. S. Amaral
#t2009
#cDiscrete Applied Mathematics
#index839096
#%813928
#%3007117
#!
  
#*Highly connected random geometric graphs.
#@Paul N. Balister,Béla Bollobás,Amites Sarkar,Mark Walters
#t2009
#cDiscrete Applied Mathematics
#index839097
#%1141499
#!
  
#*On extremal unicyclic molecular graphs with maximal Hosoya index.
#@Jianping Ou
#t2009
#cDiscrete Applied Mathematics
#index839098
#%836861
#%837111
#!
  
#*Idle regulation in non-clairvoyant scheduling of parallel jobs.
#@Andrei Tchernykh,Denis Trystram,Carlos A. Brizuela,Isaac D. Scherson
#t2009
#cDiscrete Applied Mathematics
#index839099
#%42157
#%197268
#%250846
#%255075
#%471046
#%471082
#%471113
#%471120
#%471052
#%471109
#%471101
#%471155
#%471105
#%471107
#%613225
#%988731
#%1060451
#%1117568
#%1128188
#!
  
#*On a new code, [2-1, n, 2].
#@M. Basu,Md. M. Rahaman,Satya Bagchi
#t2009
#cDiscrete Applied Mathematics
#index839100
#% 
#!
  
#*A convoy scheduling problem.
#@J. Bovet,C. Constantin,Dominique de Werra
#t1991
#cDiscrete Applied Mathematics
#index839101
#% 
#!
  
#*Certain Boolean equations.
#@D. Bankovic
#t1992
#cDiscrete Applied Mathematics
#index839102
#% 
#!
  
#*Some recent results on niche graphs.
#@Stephen Bowser,Charles Cable
#t1991
#cDiscrete Applied Mathematics
#index839103
#% 
#!
  
#*Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems.
#@Marek Libura
#t1991
#cDiscrete Applied Mathematics
#index839104
#% 
#!
  
#*Lopsided Lovász Local Lemma and Latin transversals.
#@Paul Erdös,Joel Spencer
#t1991
#cDiscrete Applied Mathematics
#index839105
#% 
#!
  
#*The basic cyclic scheduling problem with deadlines.
#@Philippe Chrétienne
#t1991
#cDiscrete Applied Mathematics
#index839106
#% 
#!
  
#*A note on isomorphic simulation of automata by networks of two-state automata.
#@Zoltán Ésik
#t1991
#cDiscrete Applied Mathematics
#index839107
#% 
#!
  
#*Corrigendum.
#@Hosam M. Mahmoud,Boris Pittel
#t1991
#cDiscrete Applied Mathematics
#index839108
#% 
#!
  
#*A generalization of the zero-one principle for sorting algorithms.
#@Dorothea Wagner,Frank Wagner
#t1991
#cDiscrete Applied Mathematics
#index839109
#% 
#!
  
#*Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones.
#@F. K. Hwang,S. Papastavridis
#t1991
#cDiscrete Applied Mathematics
#index839110
#% 
#!
  
#*On the use of augmenting chains in chain packings.
#@Dominique de Werra,F. S. Roberts
#t1991
#cDiscrete Applied Mathematics
#index839111
#% 
#!
  
#*Threshold spectra via the Ehrenfeucht game.
#@Joel Spencer
#t1991
#cDiscrete Applied Mathematics
#index839112
#% 
#!
  
#*Cut-threshold graphs.
#@Peter L. Hammer,Frédéric Maffray,Maurice Queyranne
#t1991
#cDiscrete Applied Mathematics
#index839113
#% 
#!
  
#*A deletion game on hypergraphs.
#@Aviezri S. Fraenkel,Edward R. Scheinerman
#t1991
#cDiscrete Applied Mathematics
#index839114
#% 
#!
  
#*Acknowledgement.
#@Peter L. Hammer,Pierre Hansen,Fred S. Roberts
#t1991
#cDiscrete Applied Mathematics
#index839115
#% 
#!
  
#*A difficulty in particular Shannon-like games.
#@Yohei Yamasaki
#t1991
#cDiscrete Applied Mathematics
#index839116
#% 
#!
  
#*Approximation algorithms for hitting objects with straight lines.
#@Refael Hassin,Nimrod Megiddo
#t1991
#cDiscrete Applied Mathematics
#index839117
#% 
#!
  
#*Lattice bandwidth of random graphs.
#@Colin McDiarmid,Zevi Miller
#t1991
#cDiscrete Applied Mathematics
#index839118
#% 
#!
  
#*On an edge ranking problem of trees and graphs.
#@Ananth V. Iyer,H. Donald Ratliff,Gopalakrishnan Vijayan
#t1991
#cDiscrete Applied Mathematics
#index839119
#% 
#!
  
#*Connectivity of generalized prisms over G.
#@B. L. Piazza,Richard D. Ringeisen
#t1991
#cDiscrete Applied Mathematics
#index839120
#% 
#!
  
#*A note on compact graphs.
#@Gottfried Tinhofer
#t1991
#cDiscrete Applied Mathematics
#index839121
#% 
#!
  
#*When each hexagon of a hexagonal system covers it.
#@Fuji Zhang,Rong-si Chen
#t1991
#cDiscrete Applied Mathematics
#index839122
#% 
#!
  
#*The relationship between the threshold dimension of split graphs and various dimensional parameters.
#@Margaret B. Cozzens,Mark D. Halsey
#t1991
#cDiscrete Applied Mathematics
#index839123
#% 
#!
  
#*NP-completeness of edge-colouring some restricted graphs.
#@Leizhen Cai,John A. Ellis
#t1991
#cDiscrete Applied Mathematics
#index839124
#% 
#!
  
#*The continuous center set of a network.
#@Pierre Hansen,Martine Labbé,Brigitte Nicolas
#t1991
#cDiscrete Applied Mathematics
#index839125
#% 
#!
  
#*Parallel machines scheduling with nonsimultaneous machine available time.
#@Chung-Yee Lee
#t1991
#cDiscrete Applied Mathematics
#index839126
#% 
#!
  
#*Splicing semigroups of dominoes and DNA.
#@Karel Culik II,Tero Harju
#t1991
#cDiscrete Applied Mathematics
#index839127
#% 
#!
  
#*Computing external farthest neighbors for a simple polygon.
#@Pankaj K. Agarwal,Alok Aggarwal,Boris Aronov,S. Rao Kosaraju,Baruch Schieber,Subhash Suri
#t1991
#cDiscrete Applied Mathematics
#index839128
#% 
#!
  
#*The relationship between two algorithms for decisions via sophisticated majority voting with an agenda.
#@K. B. Reid
#t1991
#cDiscrete Applied Mathematics
#index839129
#% 
#!
  
#*Distances in a rigid unit-distance graph in the plane.
#@Hiroshi Maehara
#t1991
#cDiscrete Applied Mathematics
#index839130
#% 
#!
  
#*Combinatorial face enumeration in arrangements and oriented matroids.
#@Komei Fukuda,Shigemasa Saito,Akihisa Tamura
#t1991
#cDiscrete Applied Mathematics
#index839131
#% 
#!
  
#*Preface.
#@David Avis
#t1991
#cDiscrete Applied Mathematics
#index839132
#% 
#!
  
#*An efficient algorithm for finding a two-pair, and its applications.
#@Srinivasa Rao Arikati,C. Pandu Rangan
#t1991
#cDiscrete Applied Mathematics
#index839133
#% 
#!
  
#*Problems, problems, problems.
#@William O. J. Moser
#t1991
#cDiscrete Applied Mathematics
#index839134
#% 
#!
  
#*Uniqueness of currents in infinite resistive networks.
#@Paolo M. Soardi,Wolfgang Woess
#t1991
#cDiscrete Applied Mathematics
#index839135
#% 
#!
  
#*Ordered stabbing of pairwise disjoint convex sets in linear time.
#@Peter Egyed,Rephael Wenger
#t1991
#cDiscrete Applied Mathematics
#index839136
#% 
#!
  
#*Synthetic description of a semiorder.
#@Marc Pirlot
#t1991
#cDiscrete Applied Mathematics
#index839137
#% 
#!
  
#*Convex hulls of samples from spherically symmetric distributions.
#@Rex A. Dwyer
#t1991
#cDiscrete Applied Mathematics
#index839138
#% 
#!
  
#*Bounding the number of k-faces in arrangements of hyperplanes.
#@Komei Fukuda,Shigemasa Saito,Akihisa Tamura,Takeshi Tokuyama
#t1991
#cDiscrete Applied Mathematics
#index839139
#% 
#!
  
#*Higher dimensional restricted lattice paths with diagonal steps.
#@Shashidhar Kaparthi,H. Raghav Rao
#t1991
#cDiscrete Applied Mathematics
#index839140
#% 
#!
  
#*Matrice de ramification des arbres binaires.
#@Jean-Guy Penaud
#t1991
#cDiscrete Applied Mathematics
#index839141
#% 
#!
  
#*Constructing the relative neighborhood graph in 3-dimensional Euclidean space.
#@Jerzy W. Jaromczyk,Miroslaw Kowaluk
#t1991
#cDiscrete Applied Mathematics
#index839142
#% 
#!
  
#*Addendum.
#@F. Cheah,Derek G. Corneil
#t1991
#cDiscrete Applied Mathematics
#index839143
#% 
#!
  
#*Some aspects of the semi-perfect elimination.
#@Stephan Olariu
#t1991
#cDiscrete Applied Mathematics
#index839144
#% 
#!
  
#*Intersection of algebraic space curves.
#@Shreeram S. Abhyankar,Srinivasan Chandrasekar,Vijaya Chandru
#t1991
#cDiscrete Applied Mathematics
#index839145
#% 
#!
  
#*The threshold order of a Boolean function.
#@Chi Wang,A. C. Williams
#t1991
#cDiscrete Applied Mathematics
#index839146
#% 
#!
  
#*Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam.
#@Alejandro A. Schäffer
#t1991
#cDiscrete Applied Mathematics
#index839147
#% 
#!
  
#*Tighter bound for MULTIFIT scheduling on uniform processors.
#@Bo Chen
#t1991
#cDiscrete Applied Mathematics
#index839148
#% 
#!
  
#*The complexity of point configurations.
#@Jacob E. Goodman,Richard Pollack
#t1991
#cDiscrete Applied Mathematics
#index839149
#% 
#!
  
#*Trace monoids with some invertible generators: two decision problems.
#@Celia Wrathall
#t1991
#cDiscrete Applied Mathematics
#index839150
#% 
#!
  
#*Defining families of trees with E0L grammars.
#@Thomas Ottmann,Derick Wood
#t1991
#cDiscrete Applied Mathematics
#index839151
#% 
#!
  
#*Efficiently solvable special cases of bottleneck travelling salesman problems.
#@Rainer E. Burkard,W. Sandholzer
#t1991
#cDiscrete Applied Mathematics
#index839152
#% 
#!
  
#*(i, j) competition graphs.
#@Kim A. S. Hefner,Kathryn F. Jones,Suh-Ryung Kim,J. Richard Lundgren,Fred S. Roberts
#t1991
#cDiscrete Applied Mathematics
#index839153
#% 
#!
  
#*Grammatical codes of trees.
#@Andrzej Ehrenfeucht,Grzegorz Rozenberg
#t1991
#cDiscrete Applied Mathematics
#index839154
#% 
#!
  
#*Cellular automata, omegaomega-regular sets, and sofic systems.
#@Karel Culik II,Sheng Yu
#t1991
#cDiscrete Applied Mathematics
#index839155
#% 
#!
  
#*Representations of bicircular matroids.
#@Collette R. Coullard,John G. Del Greco,Donald K. Wagner
#t1991
#cDiscrete Applied Mathematics
#index839156
#% 
#!
  
#*Preface.
#@Arto Salomaa
#t1991
#cDiscrete Applied Mathematics
#index839157
#% 
#!
  
#*Transformation completeness properties of SVPC transformation sets.
#@Shen-Chuan Tai,M. W. Du,Richard C. T. Lee
#t1991
#cDiscrete Applied Mathematics
#index839158
#% 
#!
  
#*Erratum.
#@Bruno Simeone,Dominique de Werra,Maurice Cochand
#t1991
#cDiscrete Applied Mathematics
#index839159
#% 
#!
  
#*Weavings, sections and projections of spherical polyhedra.
#@Walter Whiteley
#t1991
#cDiscrete Applied Mathematics
#index839160
#% 
#!
  
#*Efficient polynomial algorithms for distributive lattices.
#@Jean Paul Bordat
#t1991
#cDiscrete Applied Mathematics
#index839161
#% 
#!
  
#*Classes of bipartite graphs related to chordal graphs.
#@Andreas Brandstädt
#t1991
#cDiscrete Applied Mathematics
#index839162
#% 
#!
  
#*On the power of synchronization in parallel computations.
#@Juraj Hromkovic,Juhani Karhumäki,Branislav Rovan,Anna Slobodová
#t1991
#cDiscrete Applied Mathematics
#index839163
#% 
#!
  
#*Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs.
#@Zhang Fu-ji,Guo Xiao-feng
#t1991
#cDiscrete Applied Mathematics
#index839164
#% 
#!
  
#*Power languages and density.
#@Valtteri Niemi
#t1991
#cDiscrete Applied Mathematics
#index839165
#% 
#!
  
#*Decidability problems for unary output sequential transducers.
#@Tero Harju,H. C. M. Kleijn
#t1991
#cDiscrete Applied Mathematics
#index839166
#% 
#!
  
#*Classification of normalized cluster methods in an order theoretic model.
#@Forrest B. Baulieu
#t1991
#cDiscrete Applied Mathematics
#index839167
#% 
#!
  
#*On generalized zeta functions of formal languages and series.
#@Juha Honkala
#t1991
#cDiscrete Applied Mathematics
#index839168
#% 
#!
  
#*Algebraic-geometric codes and asymptotic problems.
#@Michael A. Tsfasman
#t1991
#cDiscrete Applied Mathematics
#index839169
#% 
#!
  
#*La queste del saint Gr(AL): A computational approach to local algebra.
#@Teo Mora
#t1991
#cDiscrete Applied Mathematics
#index839170
#% 
#!
  
#*Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference.
#@Ryuji Kohno,Hideki Imai
#t1991
#cDiscrete Applied Mathematics
#index839171
#% 
#!
  
#*The covering radius of doubled 2-designs in 2O.
#@Patrick Solé,Arif Ghafoor
#t1991
#cDiscrete Applied Mathematics
#index839172
#% 
#!
  
#*Equations for the projective closure and effective Nullstellensatz.
#@Leandro Caniglia,André Galligo,Joos Heintz
#t1991
#cDiscrete Applied Mathematics
#index839173
#% 
#!
  
#*A semi-systolic decoder for the PDSC-73 error-correcting code.
#@Kevin Karplus,Habib Krit
#t1991
#cDiscrete Applied Mathematics
#index839174
#% 
#!
  
#*Self-dual codes and Hadamard matrices.
#@Vladimir D. Tonchev
#t1991
#cDiscrete Applied Mathematics
#index839175
#% 
#!
  
#*Efficient q-ary immutable codes.
#@Renato M. Capocelli,Luisa Gargano,Ugo Vaccaro
#t1991
#cDiscrete Applied Mathematics
#index839176
#% 
#!
  
#*On Bayer's deformation and the associativity formula.
#@Walter Spangher
#t1991
#cDiscrete Applied Mathematics
#index839177
#% 
#!
  
#*The parameters of subcodes of algebraic-geometric codes over prime subfields.
#@Alexei N. Skorobogatov
#t1991
#cDiscrete Applied Mathematics
#index839178
#% 
#!
  
#*Computing the conductor of an integral extension.
#@Pasqualina Conti,Carlo Traverso
#t1991
#cDiscrete Applied Mathematics
#index839179
#% 
#!
  
#*Block coded modulation and concatenated coding schemes for error control on fading channels.
#@Branka Vucetic,Shu Lin
#t1991
#cDiscrete Applied Mathematics
#index839180
#% 
#!
  
#*A note on the covering radius of optimum codes.
#@Mahesh C. Bhandari,M. S. Garg
#t1991
#cDiscrete Applied Mathematics
#index839181
#% 
#!
  
#*The membership problem for unmixed polynomial ideals is solvable in single exponential time.
#@Alicia Dickenstein,Noaï Fitchas,Marc Giusti,Carmen Sessa
#t1991
#cDiscrete Applied Mathematics
#index839182
#% 
#!
  
#*Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6.
#@Arne Dür
#t1991
#cDiscrete Applied Mathematics
#index839183
#% 
#!
  
#*New approaches to reduced-complexity decoding.
#@John T. Coffey,Rodney M. Goodman,Patrick G. Farrell
#t1991
#cDiscrete Applied Mathematics
#index839184
#% 
#!
  
#*A new method for solving algebraic systems of positive dimension.
#@Daniel Lazard
#t1991
#cDiscrete Applied Mathematics
#index839185
#% 
#!
  
#*Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring.
#@Shojiro Sakata
#t1991
#cDiscrete Applied Mathematics
#index839186
#% 
#!
  
#*Preface.
#@H. F. Mattson Jr.,Teo Mora
#t1991
#cDiscrete Applied Mathematics
#index839187
#% 
#!
  
#*Threshold functions for local properties of graphs: triangles.
#@L. H. Clark,Roger C. Entringer,László A. Székely
#t1991
#cDiscrete Applied Mathematics
#index839188
#% 
#!
  
#*On doing Todd-Coxeter coset enumeration in parallel.
#@Selim G. Akl,G. Labonté,M. Leeder,Ke Qiu
#t1991
#cDiscrete Applied Mathematics
#index839189
#% 
#!
  
#*On a unique tree representation for P-extendible graphs.
#@Beverly Jamison,Stephan Olariu
#t1991
#cDiscrete Applied Mathematics
#index839190
#% 
#!
  
#*q-functional equations and some partition identities.
#@A. K. Agarwal
#t1991
#cDiscrete Applied Mathematics
#index839191
#% 
#!
  
#*Constructive complexity.
#@Karl R. Abrahamson,Michael R. Fellows,Michael A. Langston,Bernard M. E. Moret
#t1991
#cDiscrete Applied Mathematics
#index839192
#% 
#!
  
#*Computation of the expected number of leaves in a tree having a given automorphism, and related topics.
#@François Bergeron,Gilbert Labelle,Pierre Leroux
#t1991
#cDiscrete Applied Mathematics
#index839193
#% 
#!
  
#*Generalized flags in finite Abelian p-groups.
#@Lynne M. Butler
#t1991
#cDiscrete Applied Mathematics
#index839194
#% 
#!
  
#*The Mapmaker's dilemma.
#@Richard Beigel,William I. Gasarch
#t1991
#cDiscrete Applied Mathematics
#index839195
#% 
#!
  
#*Semigroup automaton structure by homomorphism and domain partition.
#@Bruce Greenblatt,William R. Edwards Jr.
#t1991
#cDiscrete Applied Mathematics
#index839196
#% 
#!
  
#*Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice.
#@Takayuki Hibi
#t1991
#cDiscrete Applied Mathematics
#index839197
#% 
#!
  
#*An introduction to randomized algorithms.
#@Richard M. Karp
#t1991
#cDiscrete Applied Mathematics
#index839198
#% 
#!
  
#*Some applications of algebra to combinatorics.
#@Richard P. Stanley
#t1991
#cDiscrete Applied Mathematics
#index839199
#% 
#!
  
#*The Riordan group.
#@Louis W. Shapiro,Seyoum Getu,Wen-Jin Woan,Leon C. Woodson
#t1991
#cDiscrete Applied Mathematics
#index839200
#% 
#!
  
#*The maximum number of winning 2-sets.
#@Douglas B. West
#t1991
#cDiscrete Applied Mathematics
#index839201
#% 
#!
  
#*Brick tabloids and the connection matrices between bases of symmetric functions.
#@Ömer Egecioglu,Jeffrey B. Remmel
#t1991
#cDiscrete Applied Mathematics
#index839202
#% 
#!
  
#*Improved bounds for harmonic-based bin packing algorithms.
#@Michael B. Richey
#t1991
#cDiscrete Applied Mathematics
#index839203
#% 
#!
  
#*Preface.
#@Rodica Simion
#t1991
#cDiscrete Applied Mathematics
#index839204
#% 
#!
  
#*Online algorithms for a dual version of bin packing.
#@János Csirik,V. Totik
#t1988
#cDiscrete Applied Mathematics
#index839205
#% 
#!
  
#*Combinatorial aspects of construction of competition Dutch Professional Football Leagues.
#@Jan A. M. Schreuder
#t1992
#cDiscrete Applied Mathematics
#index839206
#% 
#!
  
#*Construction of university faculty timetables using logic programming techniques.
#@R. Fahrion,G. Dollansky
#t1992
#cDiscrete Applied Mathematics
#index839207
#% 
#!
  
#*Two metrics in a graph theory modeling of organic chemistry.
#@Vladimír Baláz,Vladimir Kvasnicka,Jiri Pospichal
#t1992
#cDiscrete Applied Mathematics
#index839208
#% 
#!
  
#*Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid.
#@Wenjie He,Wenchen He,Suling Xie
#t1992
#cDiscrete Applied Mathematics
#index839209
#% 
#!
  
#*Exchanges procedures for timetabling problems.
#@Jacques A. Ferland,Alain Lavoie
#t1992
#cDiscrete Applied Mathematics
#index839210
#% 
#!
  
#*Optimal strategies for some team games.
#@Naoki Katoh,Junji Koyanagi,Masamitsu Ohnishi,Toshihide Ibaraki
#t1992
#cDiscrete Applied Mathematics
#index839211
#% 
#!
  
#*Linear sections of the general linear group: A geometric approach.
#@Charles T. Ryan
#t1992
#cDiscrete Applied Mathematics
#index839212
#% 
#!
  
#*An application of discrete mathematics in the design of an open pit mine.
#@Lou Caccetta,L. M. Giannini
#t1988
#cDiscrete Applied Mathematics
#index839213
#% 
#!
  
#*Calculating growth rates and moments for additive cellular automata.
#@Stephen J. Willson
#t1992
#cDiscrete Applied Mathematics
#index839214
#% 
#!
  
#*A tree representation for P-sparse graphs.
#@Beverly Jamison,Stephan Olariu
#t1992
#cDiscrete Applied Mathematics
#index839215
#% 
#!
  
#*A greedy reduction algorithm for setup optimization.
#@Ulrich Faigle,Rainer Schrader
#t1992
#cDiscrete Applied Mathematics
#index839216
#% 
#!
  
#*Foreword.
#@Dominique de Werra,Alain Hertz
#t1992
#cDiscrete Applied Mathematics
#index839217
#% 
#!
  
#*Computing independent sets in graphs with large girth.
#@Owen J. Murphy
#t1992
#cDiscrete Applied Mathematics
#index839218
#% 
#!
  
#*Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource.
#@Dominique de Werra,Jacek Blazewicz
#t1992
#cDiscrete Applied Mathematics
#index839219
#% 
#!
  
#*On a class of completable partial edge-colourings.
#@Alexander Rosa
#t1992
#cDiscrete Applied Mathematics
#index839220
#% 
#!
  
#*A fully polynomial time approximation scheme for minimum cost-reliability ratio problems.
#@Naoki Katoh
#t1992
#cDiscrete Applied Mathematics
#index839221
#% 
#!
  
#*Alternating Hamiltonian circuits in edge-coloured bipartite graphs.
#@Anthony J. W. Hilton
#t1992
#cDiscrete Applied Mathematics
#index839222
#% 
#!
  
#*A matching algorithm for regular bipartite graphs.
#@Judit Csima,László Lovász
#t1992
#cDiscrete Applied Mathematics
#index839223
#% 
#!
  
#*Distances in cocomparability graphs and their powers.
#@Peter Damaschke
#t1992
#cDiscrete Applied Mathematics
#index839224
#% 
#!
  
#*On the tree packing problem.
#@Shigeru Masuyama
#t1992
#cDiscrete Applied Mathematics
#index839225
#% 
#!
  
#*Computerised decision aid for timetabling - a case analysis.
#@Arabinda Tripathy
#t1992
#cDiscrete Applied Mathematics
#index839226
#% 
#!
  
#*Finding a feasible course schedule using Tabu search.
#@Alain Hertz
#t1992
#cDiscrete Applied Mathematics
#index839227
#% 
#!
  
#*Modelling and solving an acyclic multi-period timetabling problem.
#@Mirjana Cangalovic,Jan A. M. Schreuder
#t1992
#cDiscrete Applied Mathematics
#index839228
#% 
#!
  
#*An e-approximation scheme for combinatorial optimization problems with minimum variance criterion.
#@Naoki Katoh
#t1992
#cDiscrete Applied Mathematics
#index839229
#% 
#!
  
#*Legendre sums and codes related to QR codes.
#@Tor Helleseth
#t1992
#cDiscrete Applied Mathematics
#index839230
#% 
#!
  
#*Polynomial graph-colorings.
#@Wolfgang Gutjahr,Emo Welzl,Gerhard J. Woeginger
#t1992
#cDiscrete Applied Mathematics
#index839231
#% 
#!
  
#*An O(n) algorithm for the maximum cycle mean of an n×n bivalent matrix.
#@P. Butkovic,R. A. Cuninghame-Green
#t1992
#cDiscrete Applied Mathematics
#index839232
#% 
#!
  
#*Optimal linear labelings and eigenvalues of graphs.
#@Martin Juvan,Bojan Mohar
#t1992
#cDiscrete Applied Mathematics
#index839233
#% 
#!
  
#*The point-to-point delivery and connection problems: complexity and algorithms.
#@Chung-Lun Li,S. Thomas McCormick,David Simchi-Levi
#t1992
#cDiscrete Applied Mathematics
#index839234
#% 
#!
  
#*An O(n log n) algorithm for a maxmin location problem.
#@C. Pandu Rangan,Ramesh Govindan
#t1992
#cDiscrete Applied Mathematics
#index839235
#% 
#!
  
#*Negative circuits for flows and submodular flows.
#@Uwe Zimmermann
#t1992
#cDiscrete Applied Mathematics
#index839236
#% 
#!
  
#*A solvable class of quadratic 0-1 programming.
#@Srimat T. Chakradhar,Michael L. Bushnell
#t1992
#cDiscrete Applied Mathematics
#index839237
#% 
#!
  
#*Some results concerning the complexity of restricted colorings of graphs.
#@Marek Kubale
#t1992
#cDiscrete Applied Mathematics
#index839238
#% 
#!
  
#*The maximum number of complementary facets of a simplicial polytope.
#@Walter D. Morris Jr.
#t1992
#cDiscrete Applied Mathematics
#index839239
#% 
#!
  
#*Edge colouring line graphs of unicyclic graphs.
#@Leizhen Cai,John A. Ellis
#t1992
#cDiscrete Applied Mathematics
#index839240
#% 
#!
  
#*Indexing functions and time lower bounds for sorting on a mesh-connected computer.
#@Yijie Han,Yoshihide Igarashi,Miroslaw Truszczynski
#t1992
#cDiscrete Applied Mathematics
#index839241
#% 
#!
  
#*Stability number and chromatic number of tolerance graphs.
#@Giri Narasimhan,Rachel Manber
#t1992
#cDiscrete Applied Mathematics
#index839242
#% 
#!
  
#*Generalized hexagonal systems with each hexagon being resonant.
#@Zhang Fu-ji,Maolin Zheng
#t1992
#cDiscrete Applied Mathematics
#index839243
#% 
#!
  
#*Sparse broadcast graphs.
#@Jean-Claude Bermond,Pavol Hell,Arthur L. Liestman,Joseph G. Peters
#t1992
#cDiscrete Applied Mathematics
#index839244
#% 
#!
  
#*Search problems for two irregular coins with incomplete feedback: the underweight model.
#@Luisa Gargano,János Körner,Ugo Vaccaro
#t1992
#cDiscrete Applied Mathematics
#index839245
#% 
#!
  
#*A binary search problem on graphs.
#@Reinhard Franzkeit
#t1992
#cDiscrete Applied Mathematics
#index839246
#% 
#!
  
#*A simple proof of the multiplicativity of directed cycles of prime power length.
#@Xuding Zhu
#t1992
#cDiscrete Applied Mathematics
#index839247
#% 
#!
  
#*An improved algorithm for quantitative group testing.
#@Luisa Gargano,V. Montouri,G. Setaro,Ugo Vaccaro
#t1992
#cDiscrete Applied Mathematics
#index839248
#% 
#!
  
#*New clique and independent set algorithms for circle graphs.
#@Alberto Apostolico,Mikhail J. Atallah,Susanne E. Hambrusch
#t1992
#cDiscrete Applied Mathematics
#index839249
#% 
#!
  
#*Addendum to the threshold order of a Boolean function.
#@Chi Wang,A. C. Williams
#t1992
#cDiscrete Applied Mathematics
#index839250
#% 
#!
  
#*Narrowness, pathwidth, and their application in natural language processing.
#@András Kornai,Zsolt Tuza
#t1992
#cDiscrete Applied Mathematics
#index839251
#% 
#!
  
#*The complexity of some graph colouring problems.
#@Keith Edwards
#t1992
#cDiscrete Applied Mathematics
#index839252
#% 
#!
  
#*A domain monotonicity theorem for graphs and Hamiltonicity.
#@Bojan Mohar
#t1992
#cDiscrete Applied Mathematics
#index839253
#% 
#!
  
#*Scheduling with release dates on a single machine to minimize total weighted completion time.
#@Hocine Belouadah,Marc E. Posner,Chris N. Potts
#t1992
#cDiscrete Applied Mathematics
#index839254
#% 
#!
  
#*A linear-time algorithm for finding Hamiltonian cycles in tournaments.
#@Yannis Manoussakis
#t1992
#cDiscrete Applied Mathematics
#index839255
#% 
#!
  
#*Compatible 2-factors.
#@Jan Kratochvíl,Svatopluk Poljak
#t1992
#cDiscrete Applied Mathematics
#index839256
#% 
#!
  
#*Finite isomorphically complete systems.
#@Ferenc Gécseg,Balázs Imreh
#t1992
#cDiscrete Applied Mathematics
#index839257
#% 
#!
  
#*Generating permutations with given ups and downs.
#@Dominique Roelants van Baronaigien,Frank Ruskey
#t1992
#cDiscrete Applied Mathematics
#index839258
#% 
#!
  
#*An optimal algorithm for finding dominating cycles in circular-arc graphs.
#@J. Mark Keil,Doug Schaefer
#t1992
#cDiscrete Applied Mathematics
#index839259
#% 
#!
  
#*Holes in random graphs.
#@Tomasz Luczak
#t1991
#cDiscrete Applied Mathematics
#index839260
#% 
#!
  
#*Optimal normal bases in GF(p).
#@Ronald C. Mullin,I. M. Onyszchuk,Scott A. Vanstone,R. M. Wilson
#t1989
#cDiscrete Applied Mathematics
#index839261
#% 
#!
  
#*Construction of infinite de Bruijn arrays.
#@Antal Iványi
#t1989
#cDiscrete Applied Mathematics
#index839262
#% 
#!
  
#*On a class of functions attaining their maximum at the vertices of a polyhedron.
#@Fabio Tardella
#t1989
#cDiscrete Applied Mathematics
#index839263
#% 
#!
  
#*To vote or not to vote: What is the quota?
#@Ron Holzman
#t1989
#cDiscrete Applied Mathematics
#index839264
#% 
#!
  
#*The complexity of generalized clique covering.
#@Derek G. Corneil,Jean Fonlupt
#t1989
#cDiscrete Applied Mathematics
#index839265
#% 
#!
  
#*On sheffer symmetric functions in three-valued logic.
#@Ivan Stojmenovic
#t1989
#cDiscrete Applied Mathematics
#index839266
#% 
#!
  
#*Regeneration in IL systems.
#@Alica Kelemenová
#t1988
#cDiscrete Applied Mathematics
#index839267
#% 
#!
  
#*Acyclic k-connected subgraphs for distributed alternate routing in communications networks.
#@Moshe Segal,Donald M. Topkis
#t1989
#cDiscrete Applied Mathematics
#index839268
#% 
#!
  
#*Labeling algorithms for domination problems in sun-free chordal graphs.
#@Gerard J. Chang
#t1988
#cDiscrete Applied Mathematics
#index839269
#% 
#!
  
#*A note on odd/even cycles.
#@Anna Lubiw
#t1988
#cDiscrete Applied Mathematics
#index839270
#% 
#!
  
#*Scheduling sports competitions with a given distribution of times.
#@D. C. Blest,D. G. Fitzgerald
#t1988
#cDiscrete Applied Mathematics
#index839271
#% 
#!
  
#*Pick-and-choose heuristics for partial set covering.
#@Peter C. Fishburn,William V. Gehrlein
#t1989
#cDiscrete Applied Mathematics
#index839272
#% 
#!
  
#*Tight and loose value automorphisms.
#@Fred S. Roberts,Zangwill Rosenbaum
#t1988
#cDiscrete Applied Mathematics
#index839273
#% 
#!
  
#*Online variable-sized bin packing.
#@Nancy G. Kinnersley,Michael A. Langston
#t1989
#cDiscrete Applied Mathematics
#index839274
#% 
#!
  
#*Discrete Dirichlet integral formula.
#@Takashi Kayano,Maretsugu Yamasaki
#t1988
#cDiscrete Applied Mathematics
#index839275
#% 
#!
  
#*Probabilistic performance of a heuristic for the satisfiability problem.
#@John Franco,Yuan Chuan Ho
#t1988
#cDiscrete Applied Mathematics
#index839276
#% 
#!
  
#*Avoiding-sequences with minimum sum.
#@Dean S. Clark,James T. Lewis
#t1989
#cDiscrete Applied Mathematics
#index839277
#% 
#!
  
#*A graph theoretical approach to equivalence of multistage interconnection networks.
#@Jean Claude Bermaud,Jean-Michel Fourneau,Alain Jean-Marie
#t1989
#cDiscrete Applied Mathematics
#index839278
#% 
#!
  
#*The binding number of Halin graphs.
#@Miroslawa Skowronska
#t1988
#cDiscrete Applied Mathematics
#index839279
#% 
#!
  
#*On the unit interval number of a graph.
#@Thomas Andreae
#t1988
#cDiscrete Applied Mathematics
#index839280
#% 
#!
  
#*Strong tree-cographs are birkhoff graphs.
#@Gottfried Tinhofer
#t1989
#cDiscrete Applied Mathematics
#index839281
#% 
#!
  
#*Combinatorial dynamical system theory: General framework and controllability criteria.
#@Kazuo Murota
#t1989
#cDiscrete Applied Mathematics
#index839282
#% 
#!
  
#*Least-cost partition algorithms.
#@Thomas J. Marlowe Jr.,M. C. Paull
#t1989
#cDiscrete Applied Mathematics
#index839283
#% 
#!
  
#*Bifurcation structure of a discrete neuronal equation.
#@Michel Cosnard,Eric Goles Ch.,Driss Moumida
#t1988
#cDiscrete Applied Mathematics
#index839284
#% 
#!
  
#*Key storage in secure networks.
#@Chris J. Mitchell,Fred Piper
#t1988
#cDiscrete Applied Mathematics
#index839285
#% 
#!
  
#*Matchings and cycle covers in random digraphs.
#@John Gimbel,Edgar M. Palmer
#t1991
#cDiscrete Applied Mathematics
#index839286
#% 
#!
  
#*An extremal problem for edge domination insensitive graphs.
#@Ronald D. Dutton,Robert C. Brigham
#t1988
#cDiscrete Applied Mathematics
#index839287
#% 
#!
  
#*Scheduling two irregular polygons.
#@Peter Brucker,Wolfgang Meyer
#t1988
#cDiscrete Applied Mathematics
#index839288
#% 
#!
  
#*Broadcasting with random faults.
#@Daniel Bienstock
#t1988
#cDiscrete Applied Mathematics
#index839289
#% 
#!
  
#*A qualitative analysis of .
#@Terrence Bone,Clark Jeffries,Victor Klee
#t1988
#cDiscrete Applied Mathematics
#index839290
#% 
#!
  
#*Local optimization on graphs.
#@Donna Crystal Llewellyn,Craig A. Tovey,Michael A. Trick
#t1989
#cDiscrete Applied Mathematics
#index839291
#% 
#!
  
#*Multiprocessor scheduling: combining LPT and MULTIFIT.
#@Chung-Yee Lee,J. David Massey
#t1988
#cDiscrete Applied Mathematics
#index839292
#% 
#!
  
#*A new distance metric on strings computable in linear time.
#@Andrzej Ehrenfeucht,David Haussler
#t1988
#cDiscrete Applied Mathematics
#index839293
#% 
#!
  
#*On signed digraphs with all cycles negative.
#@Guy Chaty
#t1988
#cDiscrete Applied Mathematics
#index839294
#% 
#!
  
#*Can the catenation of two weakly sparse languages be dense?
#@Sheng Yu
#t1988
#cDiscrete Applied Mathematics
#index839295
#% 
#!
  
#*A correction to a result in linear programming.
#@Katta G. Murty
#t1988
#cDiscrete Applied Mathematics
#index839296
#% 
#!
  
#*Erratum.
#@Panos M. Pardalos,J. Ben Rosen
#t1988
#cDiscrete Applied Mathematics
#index839297
#% 
#!
  
#*On common edges in optimal solutions to traveling salesman and other optimization problems.
#@Marek Chrobak,Svatopluk Poljak
#t1988
#cDiscrete Applied Mathematics
#index839298
#% 
#!
  
#*A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids.
#@Oskar Goecke
#t1988
#cDiscrete Applied Mathematics
#index839299
#% 
#!
  
#*A unified approach for price directive decomposition procedures in integer programming.
#@Søren Holm,Jørgen Tind
#t1988
#cDiscrete Applied Mathematics
#index839300
#% 
#!
  
#*On finding most uniform spanning trees.
#@Zvi Galil,Baruch Schieber
#t1988
#cDiscrete Applied Mathematics
#index839301
#% 
#!
  
#*Cycles generated by sequential iterations.
#@Maurice Tchuente
#t1988
#cDiscrete Applied Mathematics
#index839302
#% 
#!
  
#*Maximal chordal subgraphs.
#@Perino M. Dearing,Douglas R. Shier,D. D. Warner
#t1988
#cDiscrete Applied Mathematics
#index839303
#% 
#!
  
#*Addendum.
#@F. T. Tseng,K. Truemper
#t1988
#cDiscrete Applied Mathematics
#index839304
#% 
#!
  
#*Completely unimodal numberings of a simple polytope.
#@Kathy Williamson Hoke
#t1988
#cDiscrete Applied Mathematics
#index839305
#% 
#!
  
#*Enumeration of irreducible binary words.
#@Yuji Kobayashi
#t1988
#cDiscrete Applied Mathematics
#index839306
#% 
#!
  
#*On the security of p-party protocols.
#@Luquan Pan
#t1988
#cDiscrete Applied Mathematics
#index839307
#% 
#!
  
#*Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs.
#@Hanif D. Sherali,Danny C. Myers
#t1988
#cDiscrete Applied Mathematics
#index839308
#% 
#!
  
#*The period of the Fibonacci random number generator.
#@J. D. Parker
#t1988
#cDiscrete Applied Mathematics
#index839309
#% 
#!
  
#*Matching polynomials of two classes of graphs.
#@Zhang Fu-ji,Zhou Ming-kun
#t1988
#cDiscrete Applied Mathematics
#index839310
#% 
#!
  
#*On the joint distribution of the insertion path length and the number of comparisons in search trees.
#@Hosam M. Mahmoud,Boris Pittel
#t1988
#cDiscrete Applied Mathematics
#index839311
#% 
#!
  
#*The strong chromatic number of partial triple systems.
#@Charles J. Colbourn,Dieter Jungnickel,Alexander Rosa
#t1988
#cDiscrete Applied Mathematics
#index839312
#% 
#!
  
#*Broadcasting in one dimension.
#@Pavol Hell,Arthur L. Liestman
#t1988
#cDiscrete Applied Mathematics
#index839313
#% 
#!
  
#*A note on regular classes in special Thue systems.
#@W. Bucher
#t1988
#cDiscrete Applied Mathematics
#index839314
#% 
#!
  
#*A new reduction method in integer programming.
#@Harold Greenberg
#t1988
#cDiscrete Applied Mathematics
#index839315
#% 
#!
  
#*A defect property of codes with unbounded delays.
#@Juha Honkala
#t1988
#cDiscrete Applied Mathematics
#index839316
#% 
#!
  
#*End vertices in interval graphs.
#@John Gimbel
#t1988
#cDiscrete Applied Mathematics
#index839317
#% 
#!
  
#*An intersection problem for finite automata.
#@Michael Saks,Rick Statman
#t1988
#cDiscrete Applied Mathematics
#index839318
#% 
#!
  
#*Letter to the editor.
#@Qi Ning
#t1988
#cDiscrete Applied Mathematics
#index839319
#% 
#!
  
#*Lower bounds on two-terminal network reliability.
#@Timothy B. Brecht,Charles J. Colbourn
#t1988
#cDiscrete Applied Mathematics
#index839320
#% 
#!
  
#*Anomalous behavior in bin packing algorithms.
#@Frank D. Murgolo
#t1988
#cDiscrete Applied Mathematics
#index839321
#% 
#!
  
#*On the index of maximum density for irreducible Boolean matrices.
#@Shao Jia Yu,Li Qiao
#t1988
#cDiscrete Applied Mathematics
#index839322
#% 
#!
  
#*A cryptanalytic observation concerning systems based on language theory.
#@Jarkko Kari
#t1988
#cDiscrete Applied Mathematics
#index839323
#% 
#!
  
#*Some models of graphs for scheduling sports competitions.
#@Dominique de Werra
#t1988
#cDiscrete Applied Mathematics
#index839324
#% 
#!
  
#*Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images.
#@Christian Ronse
#t1988
#cDiscrete Applied Mathematics
#index839325
#% 
#!
  
#*Strict 2-threshold graphs.
#@Nadimpalli V. R. Mahadev,Uri N. Peled
#t1988
#cDiscrete Applied Mathematics
#index839326
#% 
#!
  
#*m-Recognizability of sets closed under certain affine functions.
#@David A. Klarner
#t1988
#cDiscrete Applied Mathematics
#index839327
#% 
#!
  
#*One-pass batching algorithms for the one-machine problem.
#@Denis Naddef,Cipriano Santos
#t1988
#cDiscrete Applied Mathematics
#index839328
#% 
#!
  
#*Minimizing bumps for posets of width two.
#@Nejib Zaguia
#t1988
#cDiscrete Applied Mathematics
#index839329
#% 
#!
  
#*Finding a minimum independent dominating set in a permutation graph.
#@Mikhail J. Atallah,Glenn K. Manacher,Jorge Urrutia
#t1988
#cDiscrete Applied Mathematics
#index839330
#% 
#!
  
#*The complexity of a periodic sequence over GF(p).
#@Shenquan Xie
#t1988
#cDiscrete Applied Mathematics
#index839331
#% 
#!
  
#*Parametrization of knowledge structures.
#@Jean-Paul Doignon,Jean-Claude Falmagne
#t1988
#cDiscrete Applied Mathematics
#index839332
#% 
#!
  
#*Trapezoid graphs and their coloring.
#@Ido Dagan,Martin Charles Golumbic,Ron Y. Pinter
#t1988
#cDiscrete Applied Mathematics
#index839333
#% 
#!
  
#*Classification of P.
#@Masahiro Miyakawa,Ivan Stojmenovic
#t1989
#cDiscrete Applied Mathematics
#index839334
#% 
#!
  
#*A ternary search problem on graphs.
#@Thomas Andreae
#t1989
#cDiscrete Applied Mathematics
#index839335
#% 
#!
  
#*Representability of functions.
#@Robert G. Jeroslow
#t1989
#cDiscrete Applied Mathematics
#index839336
#% 
#!
  
#*Extremal broadcasting problems.
#@Roger Labahn
#t1989
#cDiscrete Applied Mathematics
#index839337
#% 
#!
  
#*Polynomial algorithms for restricted Euclidean p-centre problems.
#@Larry Aupperle,J. Mark Keil
#t1989
#cDiscrete Applied Mathematics
#index839338
#% 
#!
  
#*An algorithm for single machine sequencing with release dates to minimize maximum cost.
#@Stanislaw Zdrzalka,Józef Grabowski
#t1989
#cDiscrete Applied Mathematics
#index839339
#% 
#!
  
#*On the generation of powers by OS schemes.
#@W. Bucher
#t1989
#cDiscrete Applied Mathematics
#index839340
#% 
#!
  
#*On minimizing width in linear layouts.
#@Fillia Makedon,Ivan Hal Sudborough
#t1989
#cDiscrete Applied Mathematics
#index839341
#% 
#!
  
#*Structure of decoders for multivalued encodings.
#@Renato M. Capocelli,Ugo Vaccaro
#t1989
#cDiscrete Applied Mathematics
#index839342
#% 
#!
  
#*On forwarding indices of networks.
#@Marie-Claude Heydemann,J. C. Meyer,Dominique Sotteau
#t1989
#cDiscrete Applied Mathematics
#index839343
#% 
#!
  
#*The diophantine problem of Frobenius: A close bound.
#@Hugo Krawczyk,Azaria Paz
#t1989
#cDiscrete Applied Mathematics
#index839344
#% 
#!
  
#*Linear time algorithms for NP-hard problems restricted to partial k-trees.
#@Stefan Arnborg,Andrzej Proskurowski
#t1989
#cDiscrete Applied Mathematics
#index839345
#% 
#!
  
#*A maxmin problem on finite automata.
#@Jean-Marc Champarnaud,Jean-Eric Pin
#t1989
#cDiscrete Applied Mathematics
#index839346
#% 
#!
  
#*On positive and negative atoms of Cayley digraphs.
#@Gilles Zémor
#t1989
#cDiscrete Applied Mathematics
#index839347
#% 
#!
  
#*Facets of the three-index assignment polytope.
#@Egon Balas,Matthew J. Saltzman
#t1989
#cDiscrete Applied Mathematics
#index839348
#% 
#!
  
#*Niche graphs.
#@Charles Cable,Kathryn F. Jones,J. Richard Lundgren,Suzanne M. Seager
#t1989
#cDiscrete Applied Mathematics
#index839349
#% 
#!
  
#*The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions.
#@M. Reza Emamy-Khansary
#t1989
#cDiscrete Applied Mathematics
#index839350
#% 
#!
  
#*The structure of bases in bicircular matroids.
#@Randy Shull,James B. Orlin,Alan Shuchat,Marianne L. Gardner
#t1989
#cDiscrete Applied Mathematics
#index839351
#% 
#!
  
#*On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns.
#@Peter Butkovic,Ján Plávka
#t1989
#cDiscrete Applied Mathematics
#index839352
#% 
#!
  
#*Codes and matrices in studies on designs.
#@Marshall Hall Jr.
#t1989
#cDiscrete Applied Mathematics
#index839353
#% 
#!
  
#*Elementary proofs of (relatively) recent characterizations of Eulerian graphs.
#@Herbert Fleischner
#t1989
#cDiscrete Applied Mathematics
#index839354
#% 
#!
  
#*Enumeration of factors in the Thue-Morse word.
#@Srecko Brlek
#t1989
#cDiscrete Applied Mathematics
#index839355
#% 
#!
  
#*Algorithms for sequential generation of combinatorial structures.
#@François Bergeron
#t1989
#cDiscrete Applied Mathematics
#index839356
#% 
#!
  
#*Dyck paths of knight moves.
#@Jacques Labelle,Yeong-Nan Yeh
#t1989
#cDiscrete Applied Mathematics
#index839357
#% 
#!
  
#*Maximal partial clones determined by the areflexive relations.
#@Lucien Haddad,Ivo G. Rosenberg
#t1989
#cDiscrete Applied Mathematics
#index839358
#% 
#!
  
#*Fixpoint strategies for deductive databases.
#@Irène Guessarian
#t1989
#cDiscrete Applied Mathematics
#index839359
#% 
#!
  
#*Preface.
#@Gena Hahn,Ivo G. Rosenberg
#t1989
#cDiscrete Applied Mathematics
#index839360
#% 
#!
  
#*Coding for write-unidirectional memories and conflict resolution.
#@Gérard D. Cohen,Gábor Simonyi
#t1989
#cDiscrete Applied Mathematics
#index839361
#% 
#!
  
#*König-Egerváry graphs, 2-bicritical graphs and fractional matchings.
#@Jean-Marie Bourjolly,William R. Pulleyblank
#t1989
#cDiscrete Applied Mathematics
#index839362
#% 
#!
  
#*TC operations and Latin bricks.
#@Simone Hazan
#t1989
#cDiscrete Applied Mathematics
#index839363
#% 
#!
  
#*Average sizes of suffix trees and DAWGs.
#@Anselm Blumer,Andrzej Ehrenfeucht,David Haussler
#t1989
#cDiscrete Applied Mathematics
#index839364
#% 
#!
  
#*Fault-tolerant routings in Kautz and de Bruijn networks.
#@Nathalie Homobono,Claudine Peyrat
#t1989
#cDiscrete Applied Mathematics
#index839365
#% 
#!
  
#*Anti-commutative languages and n-codes.
#@Masami Ito,Helmut Jürgensen,Huei-Jan Shyr,Gabriel Thierrin
#t1989
#cDiscrete Applied Mathematics
#index839366
#% 
#!
  
#*Induced matchings.
#@Kathie Cameron
#t1989
#cDiscrete Applied Mathematics
#index839367
#% 
#!
  
#*Factorisations courtes dans un groupe fini.
#@Yahya Ould Hamidoune
#t1989
#cDiscrete Applied Mathematics
#index839368
#% 
#!
  
#*Matchings and -matroids.
#@André Bouchet
#t1989
#cDiscrete Applied Mathematics
#index839369
#% 
#!
  
#*An algebraic point of view of the data structures of database systems.
#@Dan A. Simovici,Corina Reischer
#t1989
#cDiscrete Applied Mathematics
#index839370
#% 
#!
  
#*Finite automata for languages of combinatorial interest: An order theoretical point of view.
#@Rodica Simion
#t1989
#cDiscrete Applied Mathematics
#index839371
#% 
#!
  
#*Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données.
#@Didier Arquès
#t1989
#cDiscrete Applied Mathematics
#index839372
#% 
#!
  
#*Learning faster than promised by the Vapnik-Chervonenkis dimension.
#@Anselm Blumer,Nick Littlestone
#t1989
#cDiscrete Applied Mathematics
#index839373
#% 
#!
  
#*Concurrency measure in commutation monoids.
#@Nasser Saheb
#t1989
#cDiscrete Applied Mathematics
#index839374
#% 
#!
  
#*Extensions de réseaux de connexité donnée.
#@Jean-Claude König
#t1989
#cDiscrete Applied Mathematics
#index839375
#% 
#!
  
#*A new color change to improve the coloring of a graph.
#@Claude Berge
#t1989
#cDiscrete Applied Mathematics
#index839376
#% 
#!
  
#*Scheduling periodic events.
#@A. Vince
#t1989
#cDiscrete Applied Mathematics
#index839377
#% 
#!
  
#*Optimal and near-optimal broadcast in random graphs.
#@Edward R. Scheinerman,John C. Wierman
#t1989
#cDiscrete Applied Mathematics
#index839378
#% 
#!
  
#*On the variance of the external path length in a symmetric digital trie.
#@Peter Kirschenhofer,Helmut Prodinger,Wojciech Szpankowski
#t1989
#cDiscrete Applied Mathematics
#index839379
#% 
#!
  
#*Preface.
#@Uri N. Peled
#t1989
#cDiscrete Applied Mathematics
#index839380
#% 
#!
  
#*Knots in random walks.
#@Nicholas Pippenger
#t1989
#cDiscrete Applied Mathematics
#index839381
#% 
#!
  
#*A Tutte polynomial for signed graphs.
#@Louis H. Kauffman
#t1989
#cDiscrete Applied Mathematics
#index839382
#% 
#!
  
#*On a conjecture of Graham and Lovász about distance matrices.
#@Karen L. Collins
#t1989
#cDiscrete Applied Mathematics
#index839383
#% 
#!
  
#*Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs.
#@Vijay V. Vazirani,Mihalis Yannakakis
#t1989
#cDiscrete Applied Mathematics
#index839384
#% 
#!
  
#*Some Cayley graphs for simple groups.
#@William M. Kantor
#t1989
#cDiscrete Applied Mathematics
#index839385
#% 
#!
  
#*A new complete language for DSPACE(log n).
#@Jian-er Chen
#t1989
#cDiscrete Applied Mathematics
#index839386
#% 
#!
  
#*On the orderability problem for PLA folding.
#@S. S. Ravi
#t1989
#cDiscrete Applied Mathematics
#index839387
#% 
#!
  
#*Epidemiography with various growth functions.
#@Aviezri S. Fraenkel,Mordechai Lorberbom
#t1989
#cDiscrete Applied Mathematics
#index839388
#% 
#!
  
#*Better understanding of batcher's merging networks.
#@Yehoshua Perl
#t1989
#cDiscrete Applied Mathematics
#index839389
#% 
#!
  
#*Ramsey-type theorems.
#@Paul Erdös,András Hajnal
#t1989
#cDiscrete Applied Mathematics
#index839390
#% 
#!
  
#*Low complexity normal bases.
#@David W. Ash,Ian F. Blake,Scott A. Vanstone
#t1989
#cDiscrete Applied Mathematics
#index839391
#% 
#!
  
#*The steepest descent gravitational method for linear programming.
#@Soo Y. Chang,Katta G. Murty
#t1989
#cDiscrete Applied Mathematics
#index839392
#% 
#!
  
#*The absolute center of a unicyclic network.
#@Pentti Hämäläinen
#t1989
#cDiscrete Applied Mathematics
#index839393
#% 
#!
  
#*Detecting leftmost maximal periodicities.
#@Michael G. Main
#t1989
#cDiscrete Applied Mathematics
#index839394
#% 
#!
  
#*Patterns in trees.
#@Nachum Dershowitz,Shmuel Zaks
#t1989
#cDiscrete Applied Mathematics
#index839395
#% 
#!
  
#*An O(n) algorithm to color proper circular arcs.
#@Wei Kuan Shih,Wen-Lian Hsu
#t1989
#cDiscrete Applied Mathematics
#index839396
#% 
#!
  
#*Polyadic codes.
#@Richard A. Brualdi,Vera Pless
#t1989
#cDiscrete Applied Mathematics
#index839397
#% 
#!
  
#*Generalized latin squares I.
#@Xiaojun Shen,Y. Z. Cai,C. L. Liu,Clyde P. Kruskal
#t1989
#cDiscrete Applied Mathematics
#index839398
#% 
#!
  
#*Coherent algebras and the graph isomorphism problem.
#@Shmuel Friedland
#t1989
#cDiscrete Applied Mathematics
#index839399
#% 
#!
  
#*On spanning subgraphs of 4-connected planar graphs.
#@Moshe Rosenfeld
#t1989
#cDiscrete Applied Mathematics
#index839400
#% 
#!
  
#*Asymptotic number of symmetries in locally restricted trees.
#@J. W. Kennedy,K. A. McKeon,Edgar M. Palmer,Robert W. Robinson
#t1990
#cDiscrete Applied Mathematics
#index839401
#% 
#!
  
#*Size of context in regenerative IL systems.
#@Alica Kelemenová
#t1990
#cDiscrete Applied Mathematics
#index839402
#% 
#!
  
#*The selective travelling salesman problem.
#@Gilbert Laporte,Silvano Martello
#t1990
#cDiscrete Applied Mathematics
#index839403
#% 
#!
  
#*On the r, s-SAT satisfiability problem and a conjecture of Tovey.
#@Olivier Dubois
#t1990
#cDiscrete Applied Mathematics
#index839404
#% 
#!
  
#*A constrained sports scheduling problem.
#@Dominique de Werra,L. Jacot-Descombes,P. Masson
#t1990
#cDiscrete Applied Mathematics
#index839405
#% 
#!
  
#*Combinatorial optimisation algorithms for a CAD workstation.
#@W. L. Price,F. W. Woodhams
#t1990
#cDiscrete Applied Mathematics
#index839406
#% 
#!
  
#*On minimum matrix representation of closure operations.
#@Frank E. Bennett,Lisheng Wu
#t1990
#cDiscrete Applied Mathematics
#index839407
#% 
#!
  
#*The effect of two cycles on the complexity of colourings by directed graphs.
#@Jørgen Bang-Jensen,Pavol Hell
#t1990
#cDiscrete Applied Mathematics
#index839408
#% 
#!
  
#*The optimal procedures for quantitative group testing.
#@Fred H. Hao
#t1990
#cDiscrete Applied Mathematics
#index839409
#% 
#!
  
#*The complexity of finding two disjoint paths with min-max objective function.
#@Chung-Lun Li,S. Thomas McCormick,David Simchi-Levi
#t1990
#cDiscrete Applied Mathematics
#index839410
#% 
#!
  
#*On totally dual integral systems.
#@Santosh N. Kabadi,Ramaswamy Chandrasekaran
#t1990
#cDiscrete Applied Mathematics
#index839411
#% 
#!
  
#*On an optimization problem with nested constraints.
#@Martin E. Dyer,Alan M. Frieze
#t1990
#cDiscrete Applied Mathematics
#index839412
#% 
#!
  
#*Resource constrained assignment problems.
#@Ronny Aboudi,Kurt Jørnsten
#t1990
#cDiscrete Applied Mathematics
#index839413
#% 
#!
  
#*Formulating the single machine sequencing problem with release dates as a mixed integer program.
#@Martin E. Dyer,Laurence A. Wolsey
#t1990
#cDiscrete Applied Mathematics
#index839414
#% 
#!
  
#*A survey of algorithms for the single machine total weighted tardiness scheduling problem.
#@T. S. Abdul-Razaq,C. N. Potts,Luk N. Van Wassenhove
#t1990
#cDiscrete Applied Mathematics
#index839415
#% 
#!
  
#*Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations.
#@T. H. C. Smith,T. W. S. Meyer,G. L. Thompson
#t1990
#cDiscrete Applied Mathematics
#index839416
#% 
#!
  
#*Classification of a class of distance-regular graphs via completely regular codes.
#@Josep Rifà,Ll. Huguet
#t1990
#cDiscrete Applied Mathematics
#index839417
#% 
#!
  
#*A new linear storage, polynomial-time approximation scheme for the subset-sum problem.
#@Matteo Fischetti
#t1990
#cDiscrete Applied Mathematics
#index839418
#% 
#!
  
#*Two mixed integer programming formulations arising in manufacturing management.
#@Robert G. Jeroslow
#t1990
#cDiscrete Applied Mathematics
#index839419
#% 
#!
  
#*A survey of results for sequencing problems with controllable processing times.
#@Eugeniusz Nowicki,Stanislaw Zdrzalka
#t1990
#cDiscrete Applied Mathematics
#index839420
#% 
#!
  
#*Efficient algorithms for path partitions.
#@Craig Williams,Dana Richards
#t1990
#cDiscrete Applied Mathematics
#index839421
#% 
#!
  
#*The discrete moment problem and linear programming.
#@András Prékopa
#t1990
#cDiscrete Applied Mathematics
#index839422
#% 
#!
  
#*Van Lier sequences.
#@Peter C. Fishburn,Fred S. Roberts,Helen M. Marcus-Roberts
#t1990
#cDiscrete Applied Mathematics
#index839423
#% 
#!
  
#*Subset-sum problems with different summands: computation.
#@Mark Chaimovich
#t1990
#cDiscrete Applied Mathematics
#index839424
#% 
#!
  
#*Completely separable graphs.
#@Peter L. Hammer,Frédéric Maffray
#t1990
#cDiscrete Applied Mathematics
#index839425
#% 
#!
  
#*Applications of generalized matrix searching to geometric algorithms.
#@Alok Aggarwal,Maria M. Klawe
#t1990
#cDiscrete Applied Mathematics
#index839426
#% 
#!
  
#*Parallel selection.
#@Yossi Azar,Nicholas Pippenger
#t1990
#cDiscrete Applied Mathematics
#index839427
#% 
#!
  
#*Linear recursion properties of uncorrelated binary sequences.
#@A. J. Bromfield,F. C. Piper
#t1990
#cDiscrete Applied Mathematics
#index839428
#% 
#!
  
#*The complexity of regular subgraph recognition.
#@F. Cheah,Derek G. Corneil
#t1990
#cDiscrete Applied Mathematics
#index839429
#% 
#!
  
#*Sparsest cuts and bottlenecks in graphs.
#@David W. Matula,Farhad Shahrokhi
#t1990
#cDiscrete Applied Mathematics
#index839430
#% 
#!
  
#*Multicommodity flows in certain planar directed networks.
#@Hiroshi Nagamochi,Toshihide Ibaraki
#t1990
#cDiscrete Applied Mathematics
#index839431
#% 
#!
  
#*Universal sequences for complete graphs.
#@Noga Alon,Yossi Azar,Yiftach Ravid
#t1990
#cDiscrete Applied Mathematics
#index839432
#% 
#!
  
#*Algorithms for high dimensional stabbing problems.
#@David Avis,Mike Doskas
#t1990
#cDiscrete Applied Mathematics
#index839433
#% 
#!
  
#*Parallel algorithms for fractional and maximal independent sets in planar graphs.
#@Norm Dadoun,David G. Kirkpatrick
#t1990
#cDiscrete Applied Mathematics
#index839434
#% 
#!
  
#*On the computational complexity of upper fractional domination.
#@Grant A. Cheston,Gerd Fricke,Stephen T. Hedetniemi,David Pokrass Jacobs
#t1990
#cDiscrete Applied Mathematics
#index839435
#% 
#!
  
#*Fractional total colouring.
#@Jennifer Ryan
#t1990
#cDiscrete Applied Mathematics
#index839436
#% 
#!
  
#*Probabilistic single processor scheduling.
#@Janelle J. Harms,Charles J. Colbourn
#t1990
#cDiscrete Applied Mathematics
#index839437
#% 
#!
  
#*Edge-disjoint paths in a grid bounded by two nested rectangles.
#@Hitoshi Suzuki,Akira Ishiguro,Takao Nishizeki
#t1990
#cDiscrete Applied Mathematics
#index839438
#% 
#!
  
#*Mean distance in a tree.
#@Peter Winkler
#t1990
#cDiscrete Applied Mathematics
#index839439
#% 
#!
  
#*Principal structure of layered mixed matrices.
#@Kazuo Murota
#t1990
#cDiscrete Applied Mathematics
#index839440
#% 
#!
  
#*Representing orders on the plane by translating points and lines.
#@Richard J. Nowakowski,Ivan Rival,Jorge Urrutia
#t1990
#cDiscrete Applied Mathematics
#index839441
#% 
#!
  
#*Computing the binding number of a graph.
#@William H. Cunningham
#t1990
#cDiscrete Applied Mathematics
#index839442
#% 
#!
  
#*Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter.
#@Terunao Soneoka,Hiroshi Nakada,Makoto Imase
#t1990
#cDiscrete Applied Mathematics
#index839443
#% 
#!
  
#*Simplified existence theorems for (g, f)-factors.
#@Richard P. Anstee
#t1990
#cDiscrete Applied Mathematics
#index839444
#% 
#!
  
#*Preface.
#@Pavol Hell
#t1990
#cDiscrete Applied Mathematics
#index839445
#% 
#!
  
#*Recognizing tough graphs is NP-hard.
#@Douglas Bauer,S. Louis Hakimi,Edward F. Schmeichel
#t1990
#cDiscrete Applied Mathematics
#index839446
#% 
#!
  
#*Canonical equation sets for classes of concordant polytopes.
#@Jon Lee
#t1990
#cDiscrete Applied Mathematics
#index839447
#% 
#!
  
#*The solution of a nonlinear partial difference equation.
#@Zhixiong Wang
#t1990
#cDiscrete Applied Mathematics
#index839448
#% 
#!
  
#*On optimal strategies for a betting game.
#@Zhuocheng Yang
#t1990
#cDiscrete Applied Mathematics
#index839449
#% 
#!
  
#*Factorization of symmetric circulant matrices in finite fields.
#@Marcelo J. Weinberger,Abraham Lempel
#t1990
#cDiscrete Applied Mathematics
#index839450
#% 
#!
  
#*Classification of three-valued logical functions preserving 0.
#@Masahiro Miyakawa,Ivo G. Rosenberg,Ivan Stojmenovic
#t1990
#cDiscrete Applied Mathematics
#index839451
#% 
#!
  
#*Succinct representation of general unlabeled graphs.
#@Moni Naor
#t1990
#cDiscrete Applied Mathematics
#index839452
#% 
#!
  
#*Local medians in chordal graphs.
#@Heiko Wittenberg
#t1990
#cDiscrete Applied Mathematics
#index839453
#% 
#!
  
#*Preface.
#@Toshihide Ibaraki
#t1990
#cDiscrete Applied Mathematics
#index839454
#% 
#!
  
#*On the continuous working problem.
#@Ruay Shiung Chang,Richard C. T. Lee
#t1990
#cDiscrete Applied Mathematics
#index839455
#% 
#!
  
#*Scheduling independent two processor tasks on a uniform duo-processor system.
#@Jacek Blazewicz,Maciej Drozdowski,G. Schmidt,Dominique de Werra
#t1990
#cDiscrete Applied Mathematics
#index839456
#% 
#!
  
#*An algorithmic characterization of antimatroids.
#@E. Andrew Boyd,Ulrich Faigle
#t1990
#cDiscrete Applied Mathematics
#index839457
#% 
#!
  
#*Difference graphs.
#@Peter L. Hammer,Uri N. Peled,Xiaorong Sun
#t1990
#cDiscrete Applied Mathematics
#index839458
#% 
#!
  
#*On the growth of random knapsacks.
#@John W. Mamer,Kenneth Schilling
#t1990
#cDiscrete Applied Mathematics
#index839459
#% 
#!
  
#*Perfect error-correcting databases.
#@Zoltán Füredi
#t1990
#cDiscrete Applied Mathematics
#index839460
#% 
#!
  
#*The minimum weight of the Grassmann codes C(k, n), .
#@Charles T. Ryan,Kevin M. Ryan
#t1990
#cDiscrete Applied Mathematics
#index839461
#% 
#!
  
#*Communication in m-connected graphs.
#@Adam Idzik
#t1990
#cDiscrete Applied Mathematics
#index839462
#% 
#!
  
#*Resource allocation under limited sharing.
#@Michael A. Langston,Michael P. Morford
#t1990
#cDiscrete Applied Mathematics
#index839463
#% 
#!
  
#*The structure of an integral monoid and integer programming feasibility.
#@Jennifer Ryan
#t1990
#cDiscrete Applied Mathematics
#index839464
#% 
#!
  
#*Lower bounds and reduction procedures for the bin packing problem.
#@Silvano Martello,Paolo Toth
#t1990
#cDiscrete Applied Mathematics
#index839465
#% 
#!
  
#*Low complexity normal bases for F.
#@Gérald E. Séguin
#t1990
#cDiscrete Applied Mathematics
#index839466
#% 
#!
  
#*Minimizing the number of tardy job units under release time constraints.
#@Dorit S. Hochbaum,Ron Shamir
#t1990
#cDiscrete Applied Mathematics
#index839467
#% 
#!
  
#*Fixed edge-length graph drawing is NP-hard.
#@Peter Eades,Nicholas C. Wormald
#t1990
#cDiscrete Applied Mathematics
#index839468
#% 
#!
  
#*The complexity of determinacy problem on group testing.
#@Feng Yang,Ding-Zhu Du
#t1990
#cDiscrete Applied Mathematics
#index839469
#% 
#!
  
#*The double competition number of some triangle-free graphs.
#@Suzanne M. Seager
#t1990
#cDiscrete Applied Mathematics
#index839470
#% 
#!
  
#*The permutahedron of series-parallel posets.
#@Annelie von Arnim,Ulrich Faigle,Rainer Schrader
#t1990
#cDiscrete Applied Mathematics
#index839471
#% 
#!
  
#*A relationship between Gale transforms and Voronoi diagrams.
#@Franz Aurenhammer
#t1990
#cDiscrete Applied Mathematics
#index839472
#% 
#!
  
#*A smallest augmentation to 3-connect a graph.
#@Toshimasa Watanabe,Akira Nakamura
#t1990
#cDiscrete Applied Mathematics
#index839473
#% 
#!
  
#*Constrained partitioning problems.
#@Rainer E. Burkard,En-Yu Yao
#t1990
#cDiscrete Applied Mathematics
#index839474
#% 
#!
  
#*Recognition of a class of unimodular functions.
#@Bruno Simeone,Dominique de Werra,Maurice Cochand
#t1990
#cDiscrete Applied Mathematics
#index839475
#% 
#!
  
#*Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints.
#@Laurence A. Wolsey
#t1990
#cDiscrete Applied Mathematics
#index839476
#% 
#!
  
#*Meaningfulness of conclusions from combinatorial optimization.
#@Fred S. Roberts
#t1990
#cDiscrete Applied Mathematics
#index839477
#% 
#!
  
#*A note on line digraphs and the directed max-cut problem.
#@Vasek Chvátal,C. Ebenegger
#t1990
#cDiscrete Applied Mathematics
#index839478
#% 
#!
  
#*Unconstrained 0-1 optimization and Lagrangean relaxation.
#@Warren E. Adams,Alain Billionnet,Alain Sutter
#t1990
#cDiscrete Applied Mathematics
#index839479
#% 
#!
  
#*Preface.
#@Pierre Hansen,Dominique de Werra
#t1990
#cDiscrete Applied Mathematics
#index839480
#% 
#!
  
#*Incomparability in parallel computation.
#@Vince Grolmusz,Prabhakar Ragde
#t1990
#cDiscrete Applied Mathematics
#index839481
#% 
#!
  
#*Vicinal orders of trees.
#@Uri N. Peled,Murali K. Srinivasan
#t1990
#cDiscrete Applied Mathematics
#index839482
#% 
#!
  
#*Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems.
#@Michel Minoux,Kamel Barkaoui
#t1990
#cDiscrete Applied Mathematics
#index839483
#% 
#!
  
#*Irreducible disjoint covering systems (with an application to boolean algebra).
#@Marc A. Berger,Alexander Felzenbaum,Aviezri S. Fraenkel
#t1990
#cDiscrete Applied Mathematics
#index839484
#% 
#!
  
#*Lower bounds for recognizing small cliques on CRCW PRAM's.
#@Paul Beame
#t1990
#cDiscrete Applied Mathematics
#index839485
#% 
#!
  
#*Subtree isomorphism is in random NC.
#@Phillip B. Gibbons,Richard M. Karp,Gary L. Miller,Danny Soroker
#t1990
#cDiscrete Applied Mathematics
#index839486
#% 
#!
  
#*Parallel recognition of complement reducible graphs and cotree construction.
#@David G. Kirkpatrick,Teresa M. Przytycka
#t1990
#cDiscrete Applied Mathematics
#index839487
#% 
#!
  
#*On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization.
#@Pierre Hansen,Shi-Hui Lu,Bruno Simeone
#t1990
#cDiscrete Applied Mathematics
#index839488
#% 
#!
  
#*Optimal parallel construction of prescribed tournaments.
#@Danny Soroker
#t1990
#cDiscrete Applied Mathematics
#index839489
#% 
#!
  
#*The complexity of short two-person games.
#@Ashok K. Chandra,Martin Tompa
#t1990
#cDiscrete Applied Mathematics
#index839490
#% 
#!
  
#*The basic algorithm for pseudo-Boolean programming revisited.
#@Yves Crama,Pierre Hansen,Brigitte Jaumard
#t1990
#cDiscrete Applied Mathematics
#index839491
#% 
#!
  
#*Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm.
#@Baruch Schieber,Uzi Vishkin
#t1990
#cDiscrete Applied Mathematics
#index839492
#% 
#!
  
#*Preface.
#@Faith Ellen Fich
#t1990
#cDiscrete Applied Mathematics
#index839493
#% 
#!
  
#*Partial information in public key cryptography.
#@Josef Vyskoc
#t1988
#cDiscrete Applied Mathematics
#index839494
#% 
#!
  
#*Improved book-embeddings of incomplete hypercubes.
#@Toru Hasunuma
#t2009
#cDiscrete Applied Mathematics
#index1270133
#%225192
#%837096
#%897978
#%931050
#%973142
#%1034279
#%1034811
#%1080072
#%1081638
#%1082428
#!
  
#*Bounds relating the weakly connected domination number to the total domination number and the matching number.
#@Johannes H. Hattingh,Michael A. Henning
#t2009
#cDiscrete Applied Mathematics
#index1270134
#%296397
#%506378
#%610405
#%848906
#%852637
#!
  
#*Recent developments on graphs of bounded clique-width.
#@Marcin Kaminski,Vadim V. Lozin,Martin Milanic
#t2009
#cDiscrete Applied Mathematics
#index1270135
#%228655
#%415126
#%481148
#%621985
#%660576
#%836196
#%836522
#%837340
#%848319
#%930184
#%971764
#%977408
#%977711
#%977849
#%978691
#%1015284
#%1058968
#%1061817
#!
  
#*Graph labellings with variable weights, a survey.
#@Jerrold R. Griggs,Daniel Král
#t2009
#cDiscrete Applied Mathematics
#index1270136
#%186406
#%847716
#%848520
#%865288
#%977269
#%1061170
#%1061419
#%1061777
#%1061591
#%1061947
#%1062026
#%1061914
#%1062078
#%1061991
#%1121892
#%1124672
#%1141549
#!
  
#*A mathematical program to refine gene regulatory networks.
#@Guglielmo Lulli,Martin Romauch
#t2009
#cDiscrete Applied Mathematics
#index1270137
#%156684
#%763247
#%762901
#%766731
#%766686
#%767093
#%1034273
#%3004082
#!
  
#*Hamiltonian connectedness in 3-connected line graphs.
#@Hong-Jian Lai,Yehong Shao,Gexin Yu,Mingquan Zhan
#t2009
#cDiscrete Applied Mathematics
#index1270138
#%854355
#%854349
#%976763
#!
  
#*New permutation statistics: Variation and a variant.
#@Toufik Mansour,Chunwei Song
#t2009
#cDiscrete Applied Mathematics
#index1270139
#%846890
#!
  
#*The parameterized complexity of the induced matching problem.
#@Hannes Moser,Somnath Sikdar
#t2009
#cDiscrete Applied Mathematics
#index1270140
#%481074
#%493212
#%836956
#%836958
#%847188
#%887537
#%932664
#%949620
#%1058651
#%1060886
#%1061564
#%1062115
#!
  
#*Riordan group involutions and the Delta-sequence.
#@Gi-Sang Cheon,Sung-Tae Jin,Hana Kim,Louis W. Shapiro
#t2009
#cDiscrete Applied Mathematics
#index1270141
#% 
#!
  
#*Fractional weak discrepancy and interval orders.
#@Alan Shuchat,Randy Shull,Ann N. Trenk
#t2009
#cDiscrete Applied Mathematics
#index1270142
#%838691
#%851696
#%1061391
#!
  
#*On the diameter of a domination dot-critical graph.
#@Nader Jafari Rad
#t2009
#cDiscrete Applied Mathematics
#index1270143
#% 
#!
  
#*Superconnectivity of regular graphs with small diameter.
#@Camino Balbuena,Jianmin Tang,Kim Marshall,Yuqing Lin
#t2009
#cDiscrete Applied Mathematics
#index1270144
#%850616
#!
  
#*The signless Laplacian spectral radius of graphs with given degree sequences.
#@Xiao-Dong Zhang
#t2009
#cDiscrete Applied Mathematics
#index1270145
#% 
#!
  
#*DNA recombination through assembly graphs.
#@Angela Angeleska,Natasa Jonoska,Masahico Saito
#t2009
#cDiscrete Applied Mathematics
#index1270146
#%864653
#%1090798
#!
  
#*2-rainbow domination of generalized Petersen graphs P(n, 2).
#@Chunling Tong,Xiaohui Lin,Yuansheng Yang,Meiqin Luo
#t2009
#cDiscrete Applied Mathematics
#index1270147
#%838649
#%848758
#!
  
#*On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems.
#@Sylvain Guillemot,François Nicolas,Vincent Berry,Christophe Paul
#t2009
#cDiscrete Applied Mathematics
#index1270148
#%837112
#%933978
#%46591
#%1058356
#%817270
#%931056
#%949686
#%972490
#%1009272
#%971684
#%838591
#%847630
#!
  
#*An improved randomized approximation algorithm for maximum triangle packing.
#@Zhi-Zhong Chen,Ruka Tanahashi,Lusheng Wang
#t2009
#cDiscrete Applied Mathematics
#index1270149
#%837094
#!
  
#*A note on the lower bound of centralized radio broadcasting for planar reachability graphs.
#@Frantisek Galcík
#t2009
#cDiscrete Applied Mathematics
#index1270150
#%543976
#%610434
#%614238
#%660695
#%952968
#%971401
#%1095781
#!
  
#*Independent sets in bounded-degree hypergraphs.
#@Magnús M. Halldórsson,Elena Losievskaja
#t2009
#cDiscrete Applied Mathematics
#index1270151
#%46479
#%493808
#%610032
#%623183
#%750063
#%750921
#%837959
#%1059441
#%1089191
#!
  
#*Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem.
#@Pierre Hansen,Christophe Meyer
#t2009
#cDiscrete Applied Mathematics
#index1270152
#%812381
#%835851
#%836281
#%836271
#%838097
#%924076
#%1014163
#!
  
#*Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.
#@Dominique de Werra,Marc Demange,Bruno Escoffier,Jérôme Monnot,Vangelis Th. Paschos
#t2009
#cDiscrete Applied Mathematics
#index1270153
#%611196
#%660639
#%836194
#%838851
#%839458
#%931010
#%931497
#%1054426
#%1058509
#%1144365
#!
  
#*The bivariate Ising polynomial of a graph.
#@Daniel Andrén,Klas Markström
#t2009
#cDiscrete Applied Mathematics
#index1270154
#%831295
#%974741
#%977660
#%1091744
#!
  
#*Average distances and distance domination numbers.
#@Fang Tian,Jun-Ming Xu
#t2009
#cDiscrete Applied Mathematics
#index1270155
#%836566
#%836565
#%836784
#%839343
#%846933
#%1104914
#!
  
#*Resource augmented semi-online bounded space bin packing.
#@Leah Epstein,Elena Kleiman
#t2009
#cDiscrete Applied Mathematics
#index1270156
#%609851
#%610661
#%621905
#%622099
#%931899
#%934300
#%950817
#%951002
#%951557
#%952825
#%953419
#%1059275
#%1059633
#%1061877
#%1095632
#!
  
#*Optical grooming with grooming ratio eight.
#@Charles J. Colbourn,Gennian Ge,Alan C. H. Ling
#t2009
#cDiscrete Applied Mathematics
#index1270157
#%847337
#%1024872
#%1061002
#!
  
#*A note on the strength and minimum color sum of bipartite graphs.
#@Adrian Kosowski
#t2009
#cDiscrete Applied Mathematics
#index1270158
#%750417
#%783734
#%847891
#!
  
#*A new characterization of group action-based perfect nonlinearity.
#@Laurent Poinsot
#t2009
#cDiscrete Applied Mathematics
#index1270159
#%842694
#%960085
#!
  
#*MILP approach to pattern generation in logical analysis of data.
#@Hong Seo Ryoo,In-Yong Jang
#t2009
#cDiscrete Applied Mathematics
#index1270160
#%140
#%128755
#%837055
#%838842
#%839526
#%930086
#%1009539
#%1009356
#%1013425
#%1112474
#!
  
#*Bipartite density of triangle-free subcubic graphs.
#@Xuding Zhu
#t2009
#cDiscrete Applied Mathematics
#index1270161
#%623296
#%979341
#%1051774
#!
  
#*On a conjecture of the Randic index.
#@Zhifu You,Bolian Liu
#t2009
#cDiscrete Applied Mathematics
#index1270162
#% 
#!
  
#*Eulerian detachments with local edge-connectivity.
#@Takuro Fukunaga,Hiroshi Nagamochi
#t2009
#cDiscrete Applied Mathematics
#index1270163
#%853238
#%1061339
#%1061456
#%3480196
#!
  
#*Upper bounds of degree 3 for the probability of the union of events via linear programming.
#@Pierangela Veneziani
#t2009
#cDiscrete Applied Mathematics
#index1270164
#%830892
#!
  
#*The forcing hull and forcing geodetic numbers of graphs.
#@Li-Da Tong
#t2009
#cDiscrete Applied Mathematics
#index1270165
#%848812
#!
  
#*The Clar formulas of a benzenoid system and the resonance graph.
#@Khaled Salem,Sandi Klavzar,Aleksander Vesel,Petra Zigert
#t2009
#cDiscrete Applied Mathematics
#index1270166
#% 
#!
  
#*Phylogenetic graph models beyond trees.
#@Ulrik Brandes,Sabine Cornelsen
#t2009
#cDiscrete Applied Mathematics
#index1270167
#%522
#%120952
#%406787
#%611107
#%621848
#%851455
#%952832
#%952941
#%1060205
#%1086972
#%1091696
#!
  
#*Full orientability of graphs with at most one dependent arc.
#@Hsin-Hao Lai,Ko-Wei Lih,Li-Da Tong
#t2009
#cDiscrete Applied Mathematics
#index1270168
#%831175
#%854590
#%934982
#%975596
#%1061738
#%1089733
#%1144526
#!
  
#*L(p, q)-labeling of digraphs.
#@Yi-Ting Chen,Ma-Lian Chia,David Kuo
#t2009
#cDiscrete Applied Mathematics
#index1270169
#% 
#!
  
#*Four new sums of graphs and their Wiener indices.
#@Mehdi Eliasi,Bijan Taeri
#t2009
#cDiscrete Applied Mathematics
#index1270170
#%836565
#%854513
#%974308
#!
  
#*Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.
#@Dingzhu Du,Lan Shen,Yingqian Wang
#t2009
#cDiscrete Applied Mathematics
#index1270171
#%864200
#%1095474
#%1144488
#%1341525
#%2921467
#!
  
#*Equitable total coloring of CC.
#@Chunling Tong,Xiaohui Lin,Yuansheng Yang,Zhihe Li
#t2009
#cDiscrete Applied Mathematics
#index1270172
#% 
#!
  
#*On optimization, dynamics and uncertainty: A tutorial for gene-environment networks.
#@G.-W. Weber,Ö. Ugur,P. Taylan,A. Tezel
#t2009
#cDiscrete Applied Mathematics
#index1270173
#%836910
#%1233907
#%3005546
#!
  
#*A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.
#@Alexandre Salles da Cunha,Abilio Lucena,Nelson Maculan,Mauricio G. C. Resende
#t2009
#cDiscrete Applied Mathematics
#index1270174
#%610807
#%812955
#%837594
#%1013384
#%1024812
#%3612060
#!
  
#*Merging covering arrays and compressing multiple sequence alignments.
#@Andreas H. Ronneseth,Charles J. Colbourn
#t2009
#cDiscrete Applied Mathematics
#index1270175
#%32170
#%361546
#%361663
#%361831
#%811804
#%842526
#%975790
#%977541
#%1070567
#%1077103
#%1129902
#!
  
#*More on "Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index".
#@Ljiljana Pavlovic,Mirjana Lazic,Tatjana Aleksic
#t2009
#cDiscrete Applied Mathematics
#index1270176
#%838594
#!
  
#*Dynamically maintaining split graphs.
#@Pinar Heggernes,Federico Mancini
#t2009
#cDiscrete Applied Mathematics
#index1270177
#%609912
#%610766
#%621833
#%623317
#%837627
#%864857
#%929689
#%1059504
#%1059711
#%1059834
#%1061114
#!
  
#*Complexity results for minimum sum edge coloring.
#@Dániel Marx
#t2009
#cDiscrete Applied Mathematics
#index1270178
#%22484
#%46597
#%92875
#%493212
#%783734
#%837974
#%853215
#%887133
#%931296
#%952599
#%977006
#%1060518
#%1088756
#%1144365
#!
  
#*Global defensive alliances in star graphs.
#@Cheng-Ju Hsu,Fu-Hsing Wang,Yue-Li Wang
#t2009
#cDiscrete Applied Mathematics
#index1270179
#%674138
#%692896
#%836808
#%839074
#%1093967
#%1124904
#%472746
#!
  
#*On column generation formulations for the RWA problem.
#@Brigitte Jaumard,Christophe Meyer,B. Thiongane
#t2009
#cDiscrete Applied Mathematics
#index1270180
#%953220
#%1058509
#%1122335
#%1122590
#%3005546
#%3007117
#!
  
#*Algorithmic aspects of a general modular decomposition theory.
#@Binh-Minh Bui-Xuan,Michel Habib,Vincent Limouzy,Fabien de Montgolfier
#t2009
#cDiscrete Applied Mathematics
#index1270181
#%70760
#%225147
#%415103
#%837622
#%851455
#%952832
#%952833
#%953719
#%1060205
#%1062029
#%1091696
#!
  
#*Homogeneous and strictly homogeneous criteria for partial structures.
#@Boris A. Romov
#t2009
#cDiscrete Applied Mathematics
#index1270182
#%950787
#%3597529
#!
  
#*On graphs determining links with maximal number of components via medial construction.
#@Xian'an Jin,Fengming Dong,Eng Guan Tay
#t2009
#cDiscrete Applied Mathematics
#index1270183
#%839382
#!
  
#*Pattern analysis for the prediction of fungal pro-peptide cleavage sites.
#@S. Özögür-Akyüz,John Shawe-Taylor,G.-W. Weber,Z. B. Ögel
#t2009
#cDiscrete Applied Mathematics
#index1270184
#%762751
#%985103
#%3006861
#!
  
#*Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration.
#@Palash Sarkar
#t2009
#cDiscrete Applied Mathematics
#index1270185
#%119686
#%842422
#%3005937
#!
  
#*Short containers in Cayley graphs.
#@Shuhong Gao,D. Frank Hsu
#t2009
#cDiscrete Applied Mathematics
#index1270186
#%836737
#%853820
#%930742
#%930945
#%932411
#%933603
#%951394
#%975766
#%1077859
#%1078601
#!
  
#*On well-covered triangulations: Part II.
#@Art S. Finbow,Bert Hartnell,Richard J. Nowakowski,Michael D. Plummer
#t2009
#cDiscrete Applied Mathematics
#index1270187
#%836770
#%851733
#%854536
#%978147
#!
  
#*A characterization of cycle-free unit probe interval graphs.
#@David E. Brown,J. Richard Lundgren,Li Sheng
#t2009
#cDiscrete Applied Mathematics
#index1270188
#%610809
#%611109
#%837644
#!
  
#*Approximation algorithms for the weighted independent set problem in sparse graphs.
#@Akihisa Kako,Takao Ono,Tomio Hirata,Magnús M. Halldórsson
#t2009
#cDiscrete Applied Mathematics
#index1270189
#%46479
#%818078
#%837959
#%861924
#%949573
#%950840
#%951120
#%1015394
#!
  
#*Branchwidth of chordal graphs.
#@Christophe Paul,Jan Arne Telle
#t2009
#cDiscrete Applied Mathematics
#index1270190
#%267430
#%610529
#%837325
#%924114
#%952733
#%977717
#!
  
#*On total domination vertex critical graphs of high connectivity.
#@Michael A. Henning,Nader Jafari Rad
#t2009
#cDiscrete Applied Mathematics
#index1270191
#% 
#!
  
#*1-vertex-fault-tolerant cycles embedding on folded hypercubes.
#@Sun-Yuan Hsieh,Che-Nan Kuo,Hui-Ling Huang
#t2009
#cDiscrete Applied Mathematics
#index1270192
#%775237
#%838893
#%932527
#%933776
#%989936
#%1034073
#%1034824
#%1078237
#%1079140
#%1094980
#%1124953
#!
  
#*Molecular graphs and the inverse Wiener index problem.
#@Stephan G. Wagner,Hua Wang,Gang Yu
#t2009
#cDiscrete Applied Mathematics
#index1270193
#%610628
#%749689
#!
  
#*Laminar structure of ptolemaic graphs with applications.
#@Ryuhei Uehara,Yushi Uno
#t2009
#cDiscrete Applied Mathematics
#index1270194
#%415309
#%836239
#%836389
#%839425
#%849193
#%930746
#%949798
#%950239
#%974454
#%1058996
#%1059786
#%1060536
#%1090430
#%1092146
#!
  
#*Atom-bond connectivity index of trees.
#@Boris Furtula,Ante Graovac,Damir Vukicevic
#t2009
#cDiscrete Applied Mathematics
#index1270195
#% 
#!
  
#*An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.
#@Colin Cooper,Michele Zito
#t2009
#cDiscrete Applied Mathematics
#index1270196
#%506317
#%836658
#%950387
#%1125841
#!
  
#*Reformulation in mathematical programming: An application to quantum chemistry.
#@Leo Liberti,Carlile Lavor,Nelson Maculan,Marco Antonio Chaer Nascimento
#t2009
#cDiscrete Applied Mathematics
#index1270197
#%75
#%3579
#%3458424
#!
  
#*Complete catalogue of graphs of maximum degree 3 and defect at most 4.
#@Mirka Miller,Guillermo Pineda-Villavicencio
#t2009
#cDiscrete Applied Mathematics
#index1270198
#%836307
#%837291
#%853674
#%1078789
#%1079000
#!
  
#*Enumeration of 2-regular circulant graphs and directed double networks.
#@Aygul Mamut,Qiongxiang Huang,Liu Fenjin
#t2009
#cDiscrete Applied Mathematics
#index1270199
#%848016
#%848395
#%851875
#!
  
#*The mathematical solution of a cellular automaton model which simulates traffic flow with a slow-to-start effect.
#@Ran Tian
#t2009
#cDiscrete Applied Mathematics
#index1270200
#% 
#!
  
#*Graph spectra as a systematic tool in computational biology.
#@Anirban Banerjee,Jürgen Jost
#t2009
#cDiscrete Applied Mathematics
#index1270201
#% 
#!
  
#*On the NBC-complexes and beta-invariants of abstract convex geometries.
#@Masataka Nakamura
#t2009
#cDiscrete Applied Mathematics
#index1270202
#% 
#!
  
#*The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
#@C. T. Ng,T. C. Edwin Cheng,Vladimir Kotov,Mikhail Y. Kovalyov
#t2009
#cDiscrete Applied Mathematics
#index1270203
#%1054422
#%1288626
#!
  
#*Upper bounds on the k-domination number and the k-Roman domination number.
#@Adriana Hansberg,Lutz Volkmann
#t2009
#cDiscrete Applied Mathematics
#index1270204
#%830787
#!
  
#*Extremal fullerene graphs with the maximum Clar number.
#@Dong Ye,Heping Zhang
#t2009
#cDiscrete Applied Mathematics
#index1270205
#% 
#!
  
#*A generalization of Sperner's theorem and an application to graph orientations.
#@Jianguo Qian,Konrad Engel,Wei Xu
#t2009
#cDiscrete Applied Mathematics
#index1270206
#%836569
#%854035
#!
  
#*Neighborhood hypergraphs of digraphs and some matrix permutation problems.
#@Vladimir Gurvich,Igor E. Zverovich
#t2009
#cDiscrete Applied Mathematics
#index1270207
#%1144553
#!
  
#*Discovering cis-regulatory modules by optimizing barbecues.
#@Axel Mosig,Türker Bíyíkoglu,Sonja J. Prohaska,Peter F. Stadler
#t2009
#cDiscrete Applied Mathematics
#index1270208
#%597957
#%762699
#%764485
#%1089195
#!
  
#*Characterizations of competition multigraphs.
#@Yoshio Sano
#t2009
#cDiscrete Applied Mathematics
#index1270209
#%838053
#!
  
#*Linear delay enumeration and monadic second-order logic.
#@Bruno Courcelle
#t2009
#cDiscrete Applied Mathematics
#index1270210
#%228655
#%931405
#%932743
#%1117273
#!
  
#*Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method.
#@Alain Billionnet,Sourour Elloumi,Marie-Christine Plateau
#t2009
#cDiscrete Applied Mathematics
#index1270211
#%836126
#%837423
#%839491
#%924144
#%949759
#%1013457
#%1013705
#%1014463
#%3006755
#!
  
#*Domination in a digraph and in its reverse.
#@Ludovít Niepel,Martin Knor
#t2009
#cDiscrete Applied Mathematics
#index1270212
#%851783
#!
  
#*Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.
#@Alexey Baburin,Federico Della Croce,Edward Gimadi,Y. V. Glazkov,Vangelis Th. Paschos
#t2009
#cDiscrete Applied Mathematics
#index1270213
#%610035
#%812325
#!
  
#*Paintshop, odd cycles and necklace splitting.
#@Frédéric Meunier,András Sebö
#t2009
#cDiscrete Applied Mathematics
#index1270214
#%92852
#%836693
#%838483
#%972752
#%976029
#%1191345
#!
  
#*On the complexity of constructing Golomb Rulers.
#@Christophe Meyer,Periklis A. Papakonstantinou
#t2009
#cDiscrete Applied Mathematics
#index1270215
#%310897
#%741071
#%1090118
#%1090391
#%1090389
#%3004884
#!
  
#*On complexity of Minimum Leaf Out-Branching problem.
#@Peter Dankelmann,Gregory Gutin,Eun Jung Kim
#t2009
#cDiscrete Applied Mathematics
#index1270216
#%416083
#%611130
#%611581
#%976458
#!
  
#*Reformulation techniques in mathematical programming.
#@Leo Liberti,Nelson Maculan
#t2009
#cDiscrete Applied Mathematics
#index1270217
#%1014349
#!
  
#*Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT.
#@Richard Denman,Stephen Foster
#t2009
#cDiscrete Applied Mathematics
#index1270218
#%621778
#%623072
#%838558
#!
  
#*The signed domatic number of some regular graphs.
#@Dirk Meierling,Lutz Volkmann,Stephan Zitzen
#t2009
#cDiscrete Applied Mathematics
#index1270219
#%854283
#%854289
#%854299
#!
  
#*A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions.
#@Hanif D. Sherali,Warren P. Adams
#t2009
#cDiscrete Applied Mathematics
#index1270220
#%838097
#%838105
#%1013437
#!
  
#*RNA secondary structure, permutations, and statistics.
#@Robert Willenbring
#t2009
#cDiscrete Applied Mathematics
#index1270221
#%838035
#!
  
#*The clique-separator graph for chordal graphs.
#@Louis Ibarra
#t2009
#cDiscrete Applied Mathematics
#index1270222
#%660655
#%931034
#%977271
#%1059504
#%1060536
#!
  
#*Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.
#@B. S. Panda,Anita Das
#t2009
#cDiscrete Applied Mathematics
#index1270223
#%836744
#%853967
#%889654
#%932736
#%952771
#%977271
#%977482
#%1024818
#%1061140
#%1089657
#!
  
#*On the complement graph and defensive k-alliances.
#@Jose Maria Sigarreta,Sergio Bermudo,Henning Fernau
#t2009
#cDiscrete Applied Mathematics
#index1270224
#%839071
#%1342032
#%3005167
#%472746
#!
  
#*On probe permutation graphs.
#@David B. Chandler,Maw-Shang Chang,Ton Kloks,Jiping Liu,Sheng-Lung Peng
#t2009
#cDiscrete Applied Mathematics
#index1270225
#%610046
#%660694
#%836957
#%837644
#%851455
#%853372
#%1059793
#%1061054
#%1089606
#!
  
#*Cyclic and negacyclic codes over the Galois ring GR(p, m).
#@R. Sobhani,M. Esmaeili
#t2009
#cDiscrete Applied Mathematics
#index1270226
#% 
#!
  
#*Ranking hypotheses to minimize the search cost in probabilistic inference models.
#@Peter Damaschke
#t2009
#cDiscrete Applied Mathematics
#index1270227
#%20016
#%21465
#%838110
#%851848
#%887010
#%888448
#%953146
#%985317
#%985286
#%1054475
#%1054437
#%1093089
#%3350395
#!
  
#*Computing sharp bounds for hard clustering problems on trees.
#@Isabella Lari,Maurizio Maravalle,Bruno Simeone
#t2009
#cDiscrete Applied Mathematics
#index1270228
#%1014289
#%1292171
#%2892142
#!
  
#*Bi-cycle extendable through a given set in balanced bipartite graphs.
#@Hao Li,Mei Lu
#t2009
#cDiscrete Applied Mathematics
#index1270229
#%883297
#%976257
#!
  
#*Finding the longest isometric cycle in a graph.
#@Daniel Lokshtanov
#t2009
#cDiscrete Applied Mathematics
#index1270230
#%993684
#!
  
#*A connection between circular colorings and periodic schedules.
#@Hong-Gwa Yeh
#t2009
#cDiscrete Applied Mathematics
#index1270231
#%847170
#%849138
#%951436
#%1095304
#%1123363
#%1129289
#%1144531
#%3480186
#!
  
#*The number of independent sets in unicyclic graphs with a given diameter.
#@Shuchao Li,Zhongxun Zhu
#t2009
#cDiscrete Applied Mathematics
#index1270232
#%745763
#%837293
#%837814
#!
  
#*Construction of binary and ternary self-orthogonal linear codes.
#@Axel Kohnert,Alfred Wassermann
#t2009
#cDiscrete Applied Mathematics
#index1270233
#% 
#!
  
#*Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]
#@Alain Hertz,Matthieu Plumettaz,Nicolas Zufferey
#t2009
#cDiscrete Applied Mathematics
#index1270234
#% 
#!
  
#*Graph operations characterizing rank-width.
#@Bruno Courcelle,Mamadou Moustapha Kanté
#t2009
#cDiscrete Applied Mathematics
#index1270235
#%228655
#%481148
#%621985
#%625165
#%821551
#%836522
#%838669
#%977408
#%977711
#%977717
#%978691
#%979196
#%1058968
#%1090210
#%1090230
#%1144642
#!
  
#*On the choice of explicit stabilizing terms in column generation.
#@Hatem Ben Amor,Jacques Desrosiers,Antonio Frangioni
#t2009
#cDiscrete Applied Mathematics
#index1270236
#%812728
#%851675
#%1013849
#%1013936
#%1014399
#%1288660
#%1289652
#%2892142
#%3458230
#!
  
#*A flexible model and efficient solution strategies for discrete location problems.
#@Alfredo Marín,Stefan Nickel,Justo Puerto,Sebastian Velten
#t2009
#cDiscrete Applied Mathematics
#index1270237
#%813608
#%814416
#%836333
#%924031
#%1013309
#!
  
#*Minimal split completions.
#@Pinar Heggernes,Federico Mancini
#t2009
#cDiscrete Applied Mathematics
#index1270238
#%837785
#%1058697
#%1089427
#%1092634
#!
  
#*Approximation algorithms and hardness results for the clique packing problem.
#@Frédéric Chataigner,Gordana Manic,Yoshiko Wakabayashi,Raphael Yuster
#t2009
#cDiscrete Applied Mathematics
#index1270239
#%930316
#!
  
#*Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.
#@Siamak Tazari,Matthias Müller-Hannemann
#t2009
#cDiscrete Applied Mathematics
#index1270240
#%611165
#%611543
#%624086
#%929968
#%932894
#%950342
#%951699
#%972200
#%977699
#%977703
#%1059210
#%1060908
#!
  
#*Polynomial reduction of time-space scheduling to time scheduling.
#@J. Studenovský
#t2009
#cDiscrete Applied Mathematics
#index1270241
#%42561
#%885408
#%1054423
#%3003185
#!
  
#*On bipartite graphs with minimal energy.
#@Xueliang Li,Jianbin Zhang,Lusheng Wang
#t2009
#cDiscrete Applied Mathematics
#index1270242
#%836861
#%837933
#!
  
#*Some complexity problems on single input double output controllers.
#@Katalin M. Hangos,Zsolt Tuza,A. Yeo
#t2009
#cDiscrete Applied Mathematics
#index1270243
#% 
#!
  
#*Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support.
#@Andreas W. M. Dress
#t2009
#cDiscrete Applied Mathematics
#index1270244
#%865326
#%1061073
#%1060987
#!
  
#*On a problem related to the Vandermonde determinant.
#@Tomohiro Sogabe,Moawwad El-Mikkawy
#t2009
#cDiscrete Applied Mathematics
#index1270245
#% 
#!
  
#*Approximating minimum-power edge-covers and 2, 3-connectivity.
#@Guy Kortsarz,Zeev Nutov
#t2009
#cDiscrete Applied Mathematics
#index1270246
#%557781
#%610609
#%953526
#%1012701
#%1014473
#%1141000
#!
  
#*Edge searching weighted graphs.
#@Öznur Yasar,Danny Dyer,David A. Pike,Margo Kondratieva
#t2009
#cDiscrete Applied Mathematics
#index1270247
#%614021
#%887765
#%932186
#%950952
#%951151
#%952688
#%1092604
#!
  
#*On the number of components of (k, g)-cages after vertex deletion.
#@Yuqing Lin,Camino Balbuena,Mirka Miller
#t2009
#cDiscrete Applied Mathematics
#index1270248
#%850616
#!
  
#*A sufficient connectivity condition for generic rigidity in the plane.
#@Bill Jackson,Tibor Jordán
#t2009
#cDiscrete Applied Mathematics
#index1270249
#%843210
#%976395
#%1144477
#!
  
#*Improvements on the Johnson bound for Reed-Solomon codes.
#@V. N. Muralidhara,Sandeep Sen
#t2009
#cDiscrete Applied Mathematics
#index1270250
#%210279
#%210861
#%211561
#%212116
#%622217
#%861649
#%931375
#%960453
#%1061405
#!
  
#*Linear CNF formulas and satisfiability.
#@Stefan Porschen,Ewald Speckenmeyer,Xishun Zhao
#t2009
#cDiscrete Applied Mathematics
#index1270251
#%836835
#%853553
#!
  
#*Inference of an oscillating model for the yeast cell cycle.
#@Nicole Radde,Lars Kaderali
#t2009
#cDiscrete Applied Mathematics
#index1270252
#%762814
#%764372
#%765668
#%766855
#%1121511
#!
  
#*An introduction to the perplex number system.
#@Jerry L. R. Chandler
#t2009
#cDiscrete Applied Mathematics
#index1270253
#% 
#!
  
#*Whole-genome prokaryotic clustering based on gene lengths.
#@Alexander Bolshoy,Zeev Volkovich
#t2009
#cDiscrete Applied Mathematics
#index1270254
#%21161
#%595744
#%764253
#%595742
#!
  
#*Genetic relationship between Kangal, Akbash and other dog populations.
#@Evren Koban,Çigdem Gökçek Saraç,Sinan Can Açan,Peter Savolainen,Inci Togan
#t2009
#cDiscrete Applied Mathematics
#index1270255
#% 
#!
  
#*Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs.
#@Xiaochun Cai,Bo Zhou
#t2009
#cDiscrete Applied Mathematics
#index1270256
#%837935
#%1270276
#!
  
#*Restricted k-ary words and functional equations.
#@Ghassan Firro,Toufik Mansour
#t2009
#cDiscrete Applied Mathematics
#index1270257
#%831429
#%846890
#%851695
#%854143
#%974253
#%974753
#%974796
#%977111
#!
  
#*Exact wirelength of hypercubes on a grid.
#@Paul Manuel,Indra Rajasingh,Bharati Rajan,Helda Mercy
#t2009
#cDiscrete Applied Mathematics
#index1270258
#%493186
#%803565
#%835845
#%836118
#%836403
#%837858
#%837930
#%847163
#%851974
#%953661
#%1078213
#%1080072
#%1124802
#%3316691
#!
  
#*Preface.
#@Andreas W. M. Dress,Bülent Karasözen,Peter F. Stadler,Gerhard-Wilhelm Weber
#t2009
#cDiscrete Applied Mathematics
#index1270259
#% 
#!
  
#*Collision-free path coloring with application to minimum-delay gathering in sensor networks.
#@Luisa Gargano,Adele A. Rescigno
#t2009
#cDiscrete Applied Mathematics
#index1270260
#%2022
#%298607
#%341434
#%432154
#%506426
#%584547
#%679065
#%679009
#%793249
#%1083157
#%1091122
#%1122269
#%1124433
#%1125330
#!
  
#*Modeling and simulation of metabolic networks for estimation of biomass accumulation parameters.
#@Ugur Kaplan,Metin Türkay,L. Biegler,B. Karasözen
#t2009
#cDiscrete Applied Mathematics
#index1270261
#% 
#!
  
#*Kinetic maintenance of mobile k-centres on trees.
#@Stephane Durocher,Christophe Paul
#t2009
#cDiscrete Applied Mathematics
#index1270262
#%110702
#%111154
#%210930
#%609783
#%952630
#%952644
#%1012564
#%1061835
#!
  
#*2-rainbow domination in generalized Petersen graphs P(n, 3).
#@Guangjun Xu
#t2009
#cDiscrete Applied Mathematics
#index1270263
#%838649
#%848758
#%1270147
#!
  
#*Gray codes for non-crossing partitions and dissections of a convex polygon.
#@Clemens Huemer,Ferran Hurtado,Marc Noy,Elsa Omaña-Pulido
#t2009
#cDiscrete Applied Mathematics
#index1270264
#%803858
#%836041
#%837127
#%848935
#%849168
#%851526
#%950173
#%953352
#%1089148
#!
  
#*Degree-bounded minimum spanning trees.
#@Raja Jothi,Balaji Raghavachari
#t2009
#cDiscrete Applied Mathematics
#index1270265
#%212049
#%837984
#%843158
#%843693
#%949569
#%952917
#%952966
#%1059818
#%1059765
#%1059816
#%1060076
#!
  
#*Broadcasting from multiple originators.
#@Arthur L. Liestman,Dana S. Richards,Ladislav Stacho
#t2009
#cDiscrete Applied Mathematics
#index1270266
#%836832
#%838617
#%839244
#%847954
#%854084
#%1061420
#%837089
#!
  
#*The vertex PI index and Szeged index of bridge graphs.
#@Toufik Mansour,Matthias Schork
#t2009
#cDiscrete Applied Mathematics
#index1270267
#%838871
#!
  
#*On highly palindromic words.
#@Stepan Holub,Kalle Saari
#t2009
#cDiscrete Applied Mathematics
#index1270268
#%853070
#%889895
#%975418
#%976725
#%1089910
#%1094373
#!
  
#*Treelike comparability graphs.
#@Sabine Cornelsen,Gabriele Di Stefano
#t2009
#cDiscrete Applied Mathematics
#index1270269
#%219539
#%493216
#%622513
#%660828
#%660720
#%839425
#%930691
#%979597
#%1061230
#%620433
#!
  
#*Enumeration aspects of maximal cliques and bicliques.
#@Alain Gély,Lhouari Nourine,Bachir Sadi
#t2009
#cDiscrete Applied Mathematics
#index1270270
#%611113
#%660655
#%835930
#%835975
#%931986
#%933155
#%953164
#%1090577
#%1091524
#!
  
#*On the complexity of recognizing directed path families.
#@Nicola Apollonio,Paolo Giulio Franciosa
#t2009
#cDiscrete Applied Mathematics
#index1270271
#%836162
#%838140
#%838263
#%839478
#%977271
#!
  
#*On the 3-restricted edge connectivity of permutation graphs.
#@Camino Balbuena,D. González-Moreno,Xavier Marcote
#t2009
#cDiscrete Applied Mathematics
#index1270272
#%837295
#%838728
#%847051
#%849145
#%852643
#%854207
#%854868
#%931027
#%1024275
#%1024761
#!
  
#*A simple algorithm for multicuts in planar graphs with outer terminals.
#@Cédric Bentz
#t2009
#cDiscrete Applied Mathematics
#index1270273
#%269277
#%837087
#%838939
#%934084
#%949686
#%952687
#%952981
#%953533
#%977712
#%1058998
#%1059290
#!
  
#*Extensive facility location problems on networks with equity measures.
#@Justo Puerto,Federica Ricca,Andrea Scozzari
#t2009
#cDiscrete Applied Mathematics
#index1270274
#%812140
#%836313
#%837672
#%838166
#%838168
#%953596
#%1014111
#%1024721
#%1059712
#!
  
#*Minors of simplicial complexes.
#@Tomás Kaiser
#t2009
#cDiscrete Applied Mathematics
#index1270275
#% 
#!
  
#*On reciprocal complementary Wiener number.
#@Bo Zhou,Xiaochun Cai,Nenad Trinajstic
#t2009
#cDiscrete Applied Mathematics
#index1270276
#% 
#!
  
#*On the number of connected convex subgraphs of a connected acyclic digraph.
#@Gregory Gutin,Anders Yeo
#t2009
#cDiscrete Applied Mathematics
#index1270277
#%77478
#%918425
#!
  
#*Computing branchwidth via efficient triangulations and blocks.
#@Fedor V. Fomin,Frédéric Mazoit,Ioan Todinca
#t2009
#cDiscrete Applied Mathematics
#index1270278
#%2022
#%209802
#%211756
#%610791
#%837325
#%837785
#%861361
#%924114
#%977717
#%1058697
#%1060735
#%1061054
#%1095225
#%1144411
#!
  
#*Efficient algorithms for wavelength assignment on trees of rings.
#@Zhengbing Bian,Qian-Ping Gu,Xiao Zhou
#t2009
#cDiscrete Applied Mathematics
#index1270279
#%211651
#%340857
#%408212
#%614044
#%622955
#%952841
#%1061659
#%1090915
#%3480183
#!
  
#*Approximation algorithms for constrained generalized tree alignment problem.
#@Srikrishnan Divakaran
#t2009
#cDiscrete Applied Mathematics
#index1270280
#%522
#%210488
#%559083
#%622374
#%952662
#%953642
#%962202
#%1060624
#!
  
#*The unambiguity of segmented morphisms.
#@Dominik D. Freydenberger,Daniel Reidenbach
#t2009
#cDiscrete Applied Mathematics
#index1270281
#%109198
#%837580
#%972331
#%1089093
#%1093002
#%1094186
#%1095696
#%1096076
#%1096069
#%1096551
#!
  
#*The Asian contribution to the Turkish population with respect to the Balkans: Y-chromosome perspective.
#@Ceren Caner Berkman,Inci Togan
#t2009
#cDiscrete Applied Mathematics
#index1270282
#% 
#!
  
#*A scale-free graph model based on bipartite graphs.
#@Etienne Birmelé
#t2009
#cDiscrete Applied Mathematics
#index1270283
#%621241
#%831118
#%931507
#!
  
#*Distance constrained labelings of planar graphs with no short cycles.
#@Zdenek Dvorak,Daniel Král,Pavel Nejedlý,Riste Skrekovski
#t2009
#cDiscrete Applied Mathematics
#index1270284
#%847716
#%848520
#%865288
#%865420
#%977269
#%1061170
#%1061419
#%1061777
#%1061591
#%1061864
#%3480322
#!
  
#*Partitioning graphs of supply and demand.
#@Takehiro Ito,Xiao Zhou,Takao Nishizeki
#t2009
#cDiscrete Applied Mathematics
#index1270285
#%839345
#%887537
#%950753
#%951694
#%952621
#%952716
#%1090228
#!
  
#*Algebraic and topological closure conditions for classes of pseudo-Boolean functions.
#@Stephan Foldes,Peter L. Hammer
#t2009
#cDiscrete Applied Mathematics
#index1270286
#%839146
#%847526
#%853846
#%950771
#%977868
#%1013094
#%1278861
#!
  
#*Prokaryote clustering based on DNA curvature distributions.
#@Limor Kozobay-Avraham,Sergey Hosid,Zeev Volkovich,Alexander Bolshoy
#t2009
#cDiscrete Applied Mathematics
#index1270287
#% 
#!
  
#*Extension problems with degree bounds.
#@Tomás Feder,Pavol Hell,Jing Huang
#t2009
#cDiscrete Applied Mathematics
#index1270288
#%837426
#%974348
#%975607
#%1059157
#%1062077
#%3480154
#!
  
#*Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
#@Gerardo Berbeglia,Gena Hahn
#t2009
#cDiscrete Applied Mathematics
#index1270289
#%812271
#%814428
#%838695
#!
  
#*Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees.
#@Lingli Sun,Ting Chen
#t2009
#cDiscrete Applied Mathematics
#index1270290
#%847194
#!
  
#*Groups with the same non-commuting graph.
#@M. R. Darafsheh
#t2009
#cDiscrete Applied Mathematics
#index1270291
#% 
#!
  
#*On randomized algorithms for the majority problem.
#@Demetres Christofides
#t2009
#cDiscrete Applied Mathematics
#index1270292
#%831280
#%929619
#%1058325
#!
  
#*On minimizing the number of ADMs in a general topology optical network.
#@Michele Flammini,Mordechai Shalom,Shmuel Zaks
#t2009
#cDiscrete Applied Mathematics
#index1270293
#% 
#!
  
#*Note on the m-step competition numbers of paths and cycles.
#@Yongqiang Zhao,Gerard J. Chang
#t2009
#cDiscrete Applied Mathematics
#index1270294
#%837358
#%839029
#!
  
#*Intersection models of weakly chordal graphs.
#@Martin Charles Golumbic,Marina Lipshteyn,Michal Stern
#t2009
#cDiscrete Applied Mathematics
#index1270295
#%838772
#%838974
#!
  
#*Size of random Galois lattices and number of closed frequent itemsets.
#@Richard Emilion,Gérard Lévy
#t2009
#cDiscrete Applied Mathematics
#index1270296
#%522200
#%597957
#%641841
#%836355
#!
  
#*A note on fundamental, non-fundamental, and robust cycle bases.
#@Konstantin Klemm,Peter F. Stadler
#t2009
#cDiscrete Applied Mathematics
#index1270297
#%838554
#%853069
#!
  
#*Tree-width of graphs without a 3×3 grid minor.
#@Etienne Birmelé,John Adrian Bondy,Bruce A. Reed
#t2009
#cDiscrete Applied Mathematics
#index1270298
#% 
#!
  
#*The NLC-width and clique-width for powers of graphs of bounded tree-width.
#@Frank Gurski,Egon Wanke
#t2009
#cDiscrete Applied Mathematics
#index1270299
#%228723
#%836522
#%837737
#%838705
#%953423
#%979540
#%1058968
#%1061638
#%1077403
#%1090228
#%1091658
#%1091656
#!
  
#*Orthogonal double covers of Cayley graphs.
#@R. Scapellato,R. El-Shanawany,M. Higazy
#t2009
#cDiscrete Applied Mathematics
#index1270300
#%842017
#!
  
#*The upper connected geodetic number and forcing connected geodetic number of a graph.
#@A. P. Santhakumaran,P. Titus,J. John
#t2009
#cDiscrete Applied Mathematics
#index1270301
#% 
#!
  
#*Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems.
#@Masaru Iwasa,Hiroo Saito,Tomomi Matsui
#t2009
#cDiscrete Applied Mathematics
#index1270302
#%210333
#%836303
#%837048
#%950885
#%951616
#%1013925
#!
  
#*Preface.
#@Andreas Brandstädt,Konrad Engel,Hans-Dietrich O. F. Gronau,Van Bang Le
#t2009
#cDiscrete Applied Mathematics
#index1270303
#% 
#!
  
#*Facets of the (s, t)-p-path polytope.
#@Rüdiger Stephan
#t2009
#cDiscrete Applied Mathematics
#index1270304
#%3007117
#!
  
#*Decomposing complete edge-chromatic graphs and hypergraphs. Revisited.
#@Vladimir Gurvich
#t2009
#cDiscrete Applied Mathematics
#index1270305
#%851455
#%853657
#%853893
#%951220
#%1144533
#%2851819
#!
  
#*An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors.
#@Yusuke Kuroki,Tomomi Matsui
#t2009
#cDiscrete Applied Mathematics
#index1270306
#%814167
#%836016
#%836304
#%851235
#%952693
#!
  
#*Fibonacci numbers and Lucas numbers in graphs.
#@Mariusz Startek,Andrzej Wloch,Iwona Wloch
#t2009
#cDiscrete Applied Mathematics
#index1270307
#%837814
#!
  
#*Scheduling jobs with release dates on parallel batch processing machines.
#@L. L. Liu,C. T. Ng,T. C. Edwin Cheng
#t2009
#cDiscrete Applied Mathematics
#index1270308
#%210888
#%749973
#%837527
#%1093060
#!
  
#*Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices.
#@Arvind Gupta,Ján Manuch,Ladislav Stacho,Xiaohong Zhao
#t2009
#cDiscrete Applied Mathematics
#index1270309
#%120952
#%558834
#%972132
#%1087072
#!
  
#*Using a similarity measure for credible classification.
#@M. Subasi,E. Subasi,M. Anthony,P. L. Hammer
#t2009
#cDiscrete Applied Mathematics
#index1270310
#%2301
#%2360
#%39620
#%211958
#%390462
#%838445
#%949807
#%1009215
#%1009580
#%1013425
#%1023121
#%1112474
#!
  
#*On the monotone likelihood ratio property for the convolution of independent binomial random variables.
#@Andrey Rukhin,Carey E. Priebe,Dennis M. Healy Jr.
#t2009
#cDiscrete Applied Mathematics
#index1270311
#% 
#!
  
#*Integral point sets over Z.
#@Axel Kohnert,Sascha Kurz
#t2009
#cDiscrete Applied Mathematics
#index1270312
#% 
#!
  
#*On the spanning fan-connectivity of graphs.
#@Cheng-Kuan Lin,Jimmy J. M. Tan,D. Frank Hsu,Lih-Hsing Hsu
#t2009
#cDiscrete Applied Mathematics
#index1270313
#%934170
#%1093026
#!
  
#*Numerical characterization of n-cube subset partitioning.
#@Hasmik Sahakyan
#t2009
#cDiscrete Applied Mathematics
#index1270314
#%1089139
#!
  
#*Error-correcting pooling designs associated with some distance-regular graphs.
#@Yujuan Bai,Tayuan Huang,Kaishun Wang
#t2009
#cDiscrete Applied Mathematics
#index1270315
#%848056
#%848643
#%865395
#!
  
#*On a parallel machine scheduling problem with equal processing times.
#@Svetlana A. Kravchenko,Frank Werner
#t2009
#cDiscrete Applied Mathematics
#index1270316
#%836028
#%1060463
#!
  
#*Optimal strong (kappa, d)-orientation of complete k-partite graphs.
#@Huifang Miao,Xiaofeng Guo
#t2009
#cDiscrete Applied Mathematics
#index1270317
#% 
#!
  
#*0-1 reformulations of the multicommodity capacitated network design problem.
#@Antonio Frangioni,Bernard Gendron
#t2009
#cDiscrete Applied Mathematics
#index1270318
#%186490
#%814210
#%836450
#%836524
#%885451
#%885411
#%885386
#%1013382
#%1013380
#%1013994
#%1024803
#%1024722
#%1288608
#%1289692
#%1290113
#%1290023
#%2884761
#%2892142
#!
  
#*Weighted distances based on neighborhood sequences for point-lattices.
#@Robin Strand
#t2009
#cDiscrete Applied Mathematics
#index1270319
#%828046
#%833662
#%940181
#%940182
#%940184
#%940183
#%951164
#%951478
#%1041949
#%1042507
#%1046109
#%1046564
#%1046601
#!
  
#*The competition number of a graph with exactly h holes, all of which are independent.
#@Bo-Jr Li,Gerard J. Chang
#t2009
#cDiscrete Applied Mathematics
#index1270320
#%837358
#%839349
#!
  
#*Super-connected arc-transitive digraphs.
#@Jixiang Meng,Zhao Zhang
#t2009
#cDiscrete Applied Mathematics
#index1270321
#%837660
#%838869
#%849145
#%864542
#%1061444
#!
  
#*Consistency of the QNet algorithm for generating planar split networks from weighted quartets.
#@Stefan Grünewald,Vincent Moulton,Andreas Spillner
#t2009
#cDiscrete Applied Mathematics
#index1270322
#%185822
#%1086972
#!
  
#*A linearization framework for unconstrained quadratic (0-1) problems.
#@Serigne Gueye,Philippe Michelon
#t2009
#cDiscrete Applied Mathematics
#index1270323
#%836271
#%837699
#%851350
#%885468
#%1013437
#!
  
#*An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree.
#@Johannes H. Hattingh,Ernst J. Joubert
#t2009
#cDiscrete Applied Mathematics
#index1270324
#%847463
#%851770
#!
  
#*On pseudo 2-factors.
#@Siham Bekkai,Mekkia Kouider
#t2009
#cDiscrete Applied Mathematics
#index1270325
#%854050
#%976686
#!
  
#*A note on the minimum bounded edge-partition of a tree.
#@Shane Dye
#t2009
#cDiscrete Applied Mathematics
#index1270326
#%838599
#%971488
#!
  
#*Edge intersection graphs of systems of paths on a grid with a bounded number of bends.
#@Andrei Asinowski,Andrew Suk
#t2009
#cDiscrete Applied Mathematics
#index1270327
#%863611
#%1078352
#!
  
#*On some algorithmic problems regarding the hairpin completion.
#@Florin Manea,Carlos Martín-Vide,Victor Mitrana
#t2009
#cDiscrete Applied Mathematics
#index1270328
#% 
#!
  
#*Inducing regulation of any digraphs.
#@Joanna Górska,Zdzislaw Skupien
#t2009
#cDiscrete Applied Mathematics
#index1270329
#% 
#!
  
#*Norm statistics and the complexity of clustering problems.
#@Beth Novick
#t2009
#cDiscrete Applied Mathematics
#index1270330
#%813608
#!
  
#*Connected graph searching in chordal graphs.
#@Nicolas Nisse
#t2009
#cDiscrete Applied Mathematics
#index1270331
#%614021
#%837015
#%837785
#%950952
#%951151
#%952688
#%953226
#%977921
#%1092604
#!
  
#*Integration of topological measures for eliminating non-specific interactions in protein interaction networks.
#@Murat Ali Bayir,Tacettin Dogacan Guney,Tolga Can
#t2009
#cDiscrete Applied Mathematics
#index1270332
#%63324
#%438609
#%766622
#%766765
#!
  
#*Domination, radius, and minimum degree.
#@Michael A. Henning,Simon Mukwembi
#t2009
#cDiscrete Applied Mathematics
#index1270333
#%975528
#!
  
#*Simple games and weighted games: A theoretical and computational viewpoint.
#@Josep Freixas,Xavier Molinero
#t2009
#cDiscrete Applied Mathematics
#index1270334
#%978175
#!
  
#*Some results related to the tenacity and existence of k-trees.
#@Dara Moazzami,Behzad Salehian
#t2009
#cDiscrete Applied Mathematics
#index1270335
#% 
#!
  
#*Linear codes for high payload steganography.
#@Mahdad Khatirinejad,Petr Lisonek
#t2009
#cDiscrete Applied Mathematics
#index1270336
#%385662
#!
  
#*Optimal matrix-segmentation by rectangles.
#@Konrad Engel
#t2009
#cDiscrete Applied Mathematics
#index1270337
#%835981
#%836690
#%843919
#%1024213
#%3007117
#!
  
#*On the degree distance of a graph.
#@Peter Dankelmann,I. Gutman,Simon Mukwembi,Henda C. Swart
#t2009
#cDiscrete Applied Mathematics
#index1270338
#%838766
#%839008
#%851954
#%967777
#!
  
#*Orthogonal covers by multiplication graphs.
#@Hans-Dietrich O. F. Gronau,Markus Schmidmeier
#t2009
#cDiscrete Applied Mathematics
#index1270339
#%842017
#!
  
#*On the list dynamic coloring of graphs.
#@S. Akbari,Mohammed Ghanbari,S. Jahanbekam
#t2009
#cDiscrete Applied Mathematics
#index1270340
#% 
#!
  
#*Distance-two labellings of Hamming graphs.
#@Gerard J. Chang,Changhong Lu,Sanming Zhou
#t2009
#cDiscrete Applied Mathematics
#index1270341
#%848356
#%854494
#%864266
#%1061170
#%1061385
#%1061419
#%1061777
#%1061886
#!
  
#*The crossing numbers of generalized Petersen graphs with small order.
#@Xiaohui Lin,Yuansheng Yang,Wenping Zheng,Lei Shi,Weiming Lu
#t2009
#cDiscrete Applied Mathematics
#index1270342
#%853346
#!
  
#*List-coloring graphs without K-minors.
#@Ken-ichi Kawarabayashi
#t2009
#cDiscrete Applied Mathematics
#index1270343
#% 
#!
  
#*Lower bounds for three algorithms for transversal hypergraph generation.
#@Matthias Hagen
#t2009
#cDiscrete Applied Mathematics
#index1270344
#%186128
#%268842
#%269383
#%302520
#%469050
#%545113
#%837679
#%838906
#%852493
#%931986
#%950383
#%952955
#%1003432
#%1059107
#%1059106
#%1062065
#%1090422
#%1095732
#%1118440
#!
  
#*A refinement of the common cause principle.
#@Nihat Ay
#t2009
#cDiscrete Applied Mathematics
#index1270345
#%807247
#!
  
#*Online scheduling with general machine cost functions.
#@Csanád Imreh
#t2009
#cDiscrete Applied Mathematics
#index1270346
#%557760
#%623119
#%651093
#%741017
#%741927
#%809650
#%838735
#%949605
#%973471
#%1059074
#!
  
#*Upper bounds on the upper signed total domination number of graphs.
#@Erfang Shan,T. C. Edwin Cheng
#t2009
#cDiscrete Applied Mathematics
#index1270347
#%975791
#!
  
#*Bernoulli polynomials and Pascal matrices in the context of Clifford analysis.
#@H. R. Malonek,G. Tomaz
#t2009
#cDiscrete Applied Mathematics
#index1270348
#%838440
#!
  
#*Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion.
#@Paul A. Dreyer Jr.,Fred S. Roberts
#t2009
#cDiscrete Applied Mathematics
#index1270349
#%196441
#%837826
#%932682
#!
  
#*Locating a minisum circle in the plane.
#@Jack Brimberg,Henrik Juel,Anita Schöbel
#t2009
#cDiscrete Applied Mathematics
#index1270350
#%624211
#%812656
#!
  
#*Hypergraph decomposition and secret sharing.
#@Giovanni Di Crescenzo,Clemente Galdi
#t2009
#cDiscrete Applied Mathematics
#index1270351
#%2022
#%120261
#%120498
#%775946
#%841947
#%842426
#%842179
#%842398
#%933606
#%977916
#%1089483
#!
  
#*The first and second Zagreb indices of some graph operations.
#@M. H. Khalifeh,H. Yousefi-Azari,A. R. Ashrafi
#t2009
#cDiscrete Applied Mathematics
#index1270352
#%838871
#%2990183
#!
  
#*On the two-dimensional orthogonal drawing of series-parallel graphs.
#@Satoshi Tayu,Kumiko Nomura,Shuichi Ueno
#t2009
#cDiscrete Applied Mathematics
#index1270353
#%105531
#%803513
#%837542
#%989407
#%1058543
#%1059289
#!
  
#*There are k-uniform cubefree binary morphisms for all k>=0.
#@James D. Currie,Narad Rampersad
#t2009
#cDiscrete Applied Mathematics
#index1270354
#%836105
#%838009
#%838011
#%838684
#%933537
#%3004189
#!
  
#*Injective coloring of planar graphs.
#@Yuehua Bu,Dong Chen,André Raspaud,Weifan Wang
#t2009
#cDiscrete Applied Mathematics
#index1270355
#%847884
#%977269
#%1061170
#%1061385
#%1061419
#%1061864
#%3480281
#!
  
#*Conflict-free coloring of unit disks.
#@Nissan Lev-Tov,David Peleg
#t2009
#cDiscrete Applied Mathematics
#index1270356
#%111140
#%852820
#%971445
#%1059140
#!
  
#*On explicit formulas for bandwidth and antibandwidth of hypercubes.
#@Xiaohan Wang,Xiaolin Wu,Sorina Dumitrescu
#t2009
#cDiscrete Applied Mathematics
#index1270357
#%832456
#%1059912
#%1089862
#!
  
#*Reinforcement numbers of digraphs.
#@Jia Huang,Jian-Wei Wang,Jun-Ming Xu
#t2009
#cDiscrete Applied Mathematics
#index1270358
#%836587
#%847580
#%848101
#%852274
#%852815
#%932143
#%1079781
#%2990677
#%3480159
#!
  
#*Security number of grid-like graphs.
#@Kyohei Kozawa,Yota Otachi,Koichi Yamazaki
#t2009
#cDiscrete Applied Mathematics
#index1270359
#%660883
#%838567
#%838810
#%838799
#%1061762
#!
  
#*LDPC codes from Singer cycles.
#@Luca Giuzzi,Angelo Sonnino
#t2009
#cDiscrete Applied Mathematics
#index1270360
#% 
#!
  
#*Kirchhoff index of composite graphs.
#@Heping Zhang,Yujun Yang,Chuanwen Li
#t2009
#cDiscrete Applied Mathematics
#index1270361
#%854513
#%1061969
#!
  
#*Minimum-weight cycle covers and their approximability.
#@Bodo Manthey
#t2009
#cDiscrete Applied Mathematics
#index1270362
#%837094
#%862186
#%930100
#%949801
#%950279
#%950834
#%951516
#%979560
#%1059341
#%1060858
#%1061473
#%1095494
#%3005546
#!
  
#*Calculating the extremal number ex(v;{C, C, ..., C}).
#@Jianmin Tang,Yuqing Lin,Camino Balbuena,Mirka Miller
#t2009
#cDiscrete Applied Mathematics
#index1270363
#% 
#!
  
#*The incidence game chromatic number.
#@Stephan Dominique Andres
#t2009
#cDiscrete Applied Mathematics
#index1270364
#%849111
#%852439
#%854696
#%976595
#%979249
#%1090903
#!
  
#*Path finding approaches and metabolic pathways.
#@Francisco J. Planes,John E. Beasley
#t2009
#cDiscrete Applied Mathematics
#index1270365
#%167984
#%764052
#%764528
#%765574
#%766919
#!
  
#*A new constraint-based description of the steady-state flux cone of metabolic networks.
#@Abdelhalim Larhlimi,Alexander Bockmayr
#t2009
#cDiscrete Applied Mathematics
#index1270366
#%104946
#%764385
#!
  
#*A generalization of Lucas polynomial sequence.
#@Gi-Sang Cheon,Hana Kim,Louis W. Shapiro
#t2009
#cDiscrete Applied Mathematics
#index1270367
#%839200
#%848794
#%854414
#!
  
#*Modeling the process of human body iron homeostasis using a variant of timed Petri nets.
#@Jacek Blazewicz,Dorota Formanowicz,Piotr Formanowicz,Andrea Sackmann,Michal Sajkowski
#t2009
#cDiscrete Applied Mathematics
#index1270368
#%3498
#%438668
#%616938
#%782890
#!
  
#*k-strong spanning local tournaments in locally semicomplete digraphs.
#@Jørgen Bang-Jensen
#t2009
#cDiscrete Applied Mathematics
#index1270369
#%836229
#%837214
#%851727
#%976317
#!
  
#*Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.
#@Frederic Dorn,Jan Arne Telle
#t2009
#cDiscrete Applied Mathematics
#index1270370
#%481074
#%493212
#%839345
#%924114
#%977717
#%1060735
#!
  
#*Rooted k-connections in digraphs.
#@András Frank
#t2009
#cDiscrete Applied Mathematics
#index1270371
#% 
#!
  
#*On the complexity of paths avoiding forbidden pairs.
#@Petr Kolman,Ondrej Pangrác
#t2009
#cDiscrete Applied Mathematics
#index1270372
#%838355
#%931892
#%1128146
#!
  
#*Conjugated trees with minimum general Randic index.
#@Xiaodan Chen,Jianguo Qian
#t2009
#cDiscrete Applied Mathematics
#index1270373
#% 
#!
  
#*Minimally 3-restricted edge connected graphs.
#@Qinghai Liu,Yanmei Hong,Zhao Zhang
#t2009
#cDiscrete Applied Mathematics
#index1270374
#%847051
#%848540
#%849145
#%854868
#%931027
#!
  
#*On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs.
#@Shuchao Li,Xuechao Li,Wei Jing
#t2009
#cDiscrete Applied Mathematics
#index1270375
#%837111
#%837814
#%1144532
#%1270232
#!
  
#*Extended cooperative networks games.
#@Alain Quilliot,Fatiha Bendali,Jean Mailfert
#t2009
#cDiscrete Applied Mathematics
#index1270376
#%1014328
#%1122072
#%1121968
#%1122595
#!
  
#*Complexity of (p, 1)-total labelling.
#@Frédéric Havet,Stéphan Thomassé
#t2009
#cDiscrete Applied Mathematics
#index1270377
#%623072
#%851317
#%854748
#%1061170
#%1061419
#!
  
#*Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum.
#@Jutta Gebert,Nicole Radde,Ulrich Faigle,Julia Strösser,Andreas Burkovski
#t2009
#cDiscrete Applied Mathematics
#index1270378
#%766855
#%836910
#!
  
#*Parametric modeling of protein-DNA binding kinetics: A discrete event based simulation approach.
#@Preetam Ghosh,Samik Ghosh,Kalyan Basu,Sajal K. Das
#t2009
#cDiscrete Applied Mathematics
#index1270379
#%42145
#%713638
#!
  
#*On intermediate factorial languages.
#@Arseny M. Shur
#t2009
#cDiscrete Applied Mathematics
#index1270380
#% 
#!
  
#*Structure and dimension of the eigenspace of a concave Monge matrix.
#@Martin Gavalec,Ján Plávka
#t2009
#cDiscrete Applied Mathematics
#index1270381
#%836303
#%838805
#!
  
#*On b-colorings in regular graphs.
#@Mostafa Blidia,Frédéric Maffray,Zoham Zemir
#t2009
#cDiscrete Applied Mathematics
#index1270382
#%660803
#%836512
#%837221
#!
  
#*2-dimensional optical orthogonal codes from singer groups.
#@T. L. Alderson,Keith E. Mellinger
#t2009
#cDiscrete Applied Mathematics
#index1270383
#%1153134
#!
  
#*Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution.
#@Hande Yaman
#t2009
#cDiscrete Applied Mathematics
#index1270384
#%1013414
#%1013593
#%1014323
#%1289901
#%1290004
#%1340612
#!
  
#*Disjoint congruence classes and a timetabling application.
#@Geir Dahl
#t2009
#cDiscrete Applied Mathematics
#index1270385
#%853340
#%1288397
#!
  
#*Unbordered partial words.
#@Francine Blanchet-Sadri,C. D. Davis,Joel Dodge,Robert Mercas,Margaret Moorefield
#t2009
#cDiscrete Applied Mathematics
#index1270386
#%2487
#%211341
#%949668
#%950066
#%952779
#%974698
#%1089338
#%1095726
#!
  
#*Optimal popular matchings.
#@Telikepalli Kavitha,Meghana Nasre
#t2009
#cDiscrete Applied Mathematics
#index1270387
#%592866
#%1060795
#%1077305
#%3003855
#!
  
#*t-wise balanced designs.
#@Reinhard Laue
#t2009
#cDiscrete Applied Mathematics
#index1270388
#%865244
#!
  
#*Nonadaptive algorithms for threshold group testing.
#@Hong-Bin Chen,Hung-Lin Fu
#t2009
#cDiscrete Applied Mathematics
#index1270389
#%267179
#%494370
#%558784
#%836981
#%978084
#%1058425
#%1060997
#!
  
#*Labeling bipartite permutation graphs with a condition at distance two.
#@Toru Araki
#t2009
#cDiscrete Applied Mathematics
#index1270390
#%837591
#%934715
#%934864
#%1061170
#%1061419
#%1144605
#!
  
#*Guest editors' foreword.
#@Jan Kratochvíl,Andrzej Proskurowski,Oriol Serra
#t2009
#cDiscrete Applied Mathematics
#index1270391
#%837425
#!
  
#*On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures.
#@Yinmei Cao,Anhua Lin,Rong Luo,Xiaoya Zha
#t2009
#cDiscrete Applied Mathematics
#index1270392
#% 
#!
  
#*The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence.
#@Thomas Kalinowski
#t2009
#cDiscrete Applied Mathematics
#index1270393
#%835981
#%836690
#!
  
#*Relaxation procedures on graphs.
#@Elias Wegert,Christian Reiher
#t2009
#cDiscrete Applied Mathematics
#index1270394
#%853722
#%854624
#%864424
#%977299
#%1090911
#!
  
#*On the approximability of the Simplified Partial Digest Problem.
#@Jacek Blazewicz,Edmund K. Burke,Marta Kasprzak,Alexandr Kovalev,Mikhail Y. Kovalyov
#t2009
#cDiscrete Applied Mathematics
#index1336352
#%111487
#%1087093
#%1090391
#!
  
#*On cover-structure graphs.
#@Henning Wunderlich
#t2009
#cDiscrete Applied Mathematics
#index1336382
#%623312
#%975180
#!
  
#*minimum dominating set of queens: A trivial programming exercise?
#@Henning Fernau
#t2010
#cDiscrete Applied Mathematics
#index1336413
#%836298
#%847120
#%852292
#%852823
#%932186
#%933487
#%933440
#%952621
#%1094849
#!
  
#*A benchmark set for the reconstruction of hv-convex discrete sets.
#@Péter Balázs
#t2009
#cDiscrete Applied Mathematics
#index1336395
#%741757
#%818086
#%854154
#%885091
#%930582
#%934459
#%1089139
#%1089540
#%1091235
#%1093147
#%1096273
#%1266327
#!
  
#*Bicolored graph partitioning, or: gerrymandering at its worst.
#@Nicola Apollonio,Ronald I. Becker,Isabella Lari,Federica Ricca,Bruno Simeone
#t2009
#cDiscrete Applied Mathematics
#index1336375
#% 
#!
  
#*Directed defective asymmetric graph coloring games.
#@Stephan Dominique Andres
#t2010
#cDiscrete Applied Mathematics
#index1336420
#%847308
#%978610
#%979249
#%1144340
#!
  
#*About equivalent interval colorings of weighted graphs.
#@Mathieu Bouchard,Mirjana Cangalovic,Alain Hertz
#t2009
#cDiscrete Applied Mathematics
#index1336370
#%610591
#%621610
#%812787
#%979938
#%1058746
#!
  
#*Constructing fair sports league schedules with regard to strength groups.
#@Dirk Briskorn,Sigrid Knust
#t2010
#cDiscrete Applied Mathematics
#index1336409
#%812178
#!
  
#*On the b-chromatic number of Kneser graphs.
#@Hossein Hajiabolhassan
#t2010
#cDiscrete Applied Mathematics
#index1336441
#%660803
#%836512
#%837221
#%838638
#!
  
#*Average-case analysis of incremental topological ordering.
#@Deepak Ajwani,Tobias Friedrich
#t2010
#cDiscrete Applied Mathematics
#index1336442
#%2022
#%269329
#%609762
#%610864
#%611709
#%621842
#%622961
#%660844
#%932869
#%952536
#%979958
#%1052252
#%1075962
#%1077286
#%1090108
#%1094149
#!
  
#*Series-parallel chromatic hypergraphs.
#@Ioan Tomescu,Syed Ahtsham Ul Haq Bokhary
#t2010
#cDiscrete Applied Mathematics
#index1336414
#%978257
#%2921542
#!
  
#*Computing regions of interest for geometric features in digital images.
#@Kristof Teelen,Peter Veelaert
#t2009
#cDiscrete Applied Mathematics
#index1336400
#%1032047
#!
  
#*Global optimization for first order Markov Random Fields with submodular priors.
#@Jérôme Darbon
#t2009
#cDiscrete Applied Mathematics
#index1336360
#%2137
#%127873
#%749626
#%890293
#%908024
#%908484
#%950674
#%950771
#%950678
#%977868
#%1031035
#%1031246
#%1031248
#%1032403
#%1339145
#%1339160
#%2884761
#%2884762
#%3005546
#!
  
#*The game of F-saturator.
#@Michael Ferrara,Michael S. Jacobson,Angela Harris
#t2010
#cDiscrete Applied Mathematics
#index1336427
#%847084
#%854580
#!
  
#*The expressive power of binary submodular functions.
#@Stanislav Zivný,David A. Cohen,Peter G. Jeavons
#t2009
#cDiscrete Applied Mathematics
#index1336392
#% 
#!
  
#*The self-affine property of (U, r)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS.
#@Tian-Jia Ni,Zhi-Ying Wen
#t2009
#cDiscrete Applied Mathematics
#index1336381
#%836037
#%839214
#%846850
#%889407
#%973021
#!
  
#*Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees.
#@Naoki Katoh,Shin-ichi Tanigawa
#t2009
#cDiscrete Applied Mathematics
#index1336389
#%768171
#%803460
#%803497
#%803441
#%804014
#%835975
#%842933
#%844193
#%883365
#%1060744
#%1092011
#%1336532
#%2921420
#!
  
#*On the complexity of some subgraph problems.
#@Andrea Scozzari,Fabio Tardella
#t2009
#cDiscrete Applied Mathematics
#index1336403
#%209743
#%621303
#%623296
#%836122
#%839303
#%839429
#%951873
#%1058511
#%1058439
#!
  
#*On the remoteness function in median graphs.
#@Kannan Balakrishnan,Bostjan Bresar,Manoj Changat,Wilfried Imrich,Sandi Klavzar,Matjaz Kovse,Ajitha R. Subhamathi
#t2009
#cDiscrete Applied Mathematics
#index1336362
#%836336
#%837496
#%837740
#%837640
#%838424
#%1061075
#%1061548
#%1091716
#!
  
#*RNA pseudoknot structures with arc-length >=3 and stack-length >=sigma.
#@Emma Y. Jin,Christian M. Reidys
#t2010
#cDiscrete Applied Mathematics
#index1336433
#% 
#!
  
#*The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions.
#@Birgit Engels
#t2010
#cDiscrete Applied Mathematics
#index1336412
#%415671
#%611251
#%803974
#%1025571
#%1095936
#!
  
#*Signed star domatic number of a graph.
#@M. Atapour,Seyed Mahmoud Sheikholeslami,A. N. Ghameshlou,Lutz Volkmann
#t2010
#cDiscrete Applied Mathematics
#index1336417
#%838711
#%838977
#!
  
#*The Ordered Gradual Covering Location Problem on a Network.
#@Oded Berman,Jörg Kalcsics,Dmitry Krass,Stefan Nickel
#t2009
#cDiscrete Applied Mathematics
#index1336406
#%812213
#!
  
#*Thinning on cell complexes from polygonal tilings.
#@Petra Wiederhold,Sandino Morales
#t2009
#cDiscrete Applied Mathematics
#index1336383
#%137719
#%771268
#%834111
#%835183
#%941694
#%1042366
#%1044012
#%1339147
#%3004083
#!
  
#*Region merging with topological control.
#@Alexandre Dupas,Guillaume Damiand
#t2009
#cDiscrete Applied Mathematics
#index1336397
#%154013
#%154099
#%780156
#%833873
#%834894
#%835666
#%1046875
#!
  
#*APN permutations on Z and Costas arrays.
#@Konstantinos Drakakis,Rod Gow,Gary McGuire
#t2009
#cDiscrete Applied Mathematics
#index1336411
#% 
#!
  
#*Relaxed voting and competitive location under monotonous gain functions on trees.
#@Joachim Spoerhase,Hans-Christoph Wirth
#t2010
#cDiscrete Applied Mathematics
#index1336428
#%1277516
#!
  
#*An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse.
#@Dimitri Drapkin,Rüdiger Schultz
#t2010
#cDiscrete Applied Mathematics
#index1336430
#%1013558
#%2891903
#%2891748
#%3458377
#!
  
#*On the number of transversals in Cayley tables of cyclic groups.
#@Nicholas J. Cavenagh,Ian M. Wanless
#t2010
#cDiscrete Applied Mathematics
#index1336434
#%842478
#%854273
#%865036
#%976026
#%977170
#%1052470
#%3004708
#!
  
#*The binding number of a graph and its cliques.
#@Jeremy Lyle,Wayne Goddard
#t2009
#cDiscrete Applied Mathematics
#index1336373
#%830795
#%977695
#!
  
#*An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths.
#@Naoyuki Kamiyama,Naoki Katoh,Atsushi Takizawa
#t2009
#cDiscrete Applied Mathematics
#index1336366
#%611608
#%897810
#%950463
#%1013122
#%1059273
#%1060668
#%1095684
#!
  
#*Detecting induced subgraphs.
#@Benjamin Lévêque,David Y. Lin,Frédéric Maffray,Nicolas Trotignon
#t2009
#cDiscrete Applied Mathematics
#index1336356
#%185901
#%798033
#%852950
#%1061692
#!
  
#*Integral polyhedra related to integer multicommodity flows on a cycle.
#@Kyungsik Lee
#t2010
#cDiscrete Applied Mathematics
#index1336419
#%836004
#%836843
#%838386
#%953639
#%1061639
#!
  
#*On minimally b-imperfect graphs.
#@Chính T. Hoàng,Cláudia Linhares Sales,Frédéric Maffray
#t2009
#cDiscrete Applied Mathematics
#index1336391
#%660803
#%837221
#!
  
#*Characterising (k, )-leaf powers.
#@Andreas Brandstädt,Peter Wagner
#t2010
#cDiscrete Applied Mathematics
#index1336447
#% 
#!
  
#*Positivity of third order linear recurrence sequences.
#@Vichian Laohakosol,Pinthira Tangsupphathawat
#t2009
#cDiscrete Applied Mathematics
#index1336386
#%3000906
#!
  
#*Disjoint paths in sparse graphs.
#@Cédric Bentz
#t2009
#cDiscrete Applied Mathematics
#index1336384
#%209914
#%210269
#%610201
#%610956
#%621698
#%621699
#%622833
#%837087
#%837384
#%837726
#%838939
#%932241
#%934084
#%949686
#%952687
#%972793
#%972405
#%977721
#%1013121
#%1058998
#%1059290
#!
  
#*Finding induced trees.
#@N. Derhy,Christophe Picouleau
#t2009
#cDiscrete Applied Mathematics
#index1336399
#%798033
#%852950
#%1061692
#%1336356
#!
  
#*Locating and paired-dominating sets in graphs.
#@John McCoy,Michael A. Henning
#t2009
#cDiscrete Applied Mathematics
#index1336376
#%836396
#%3612438
#!
  
#*Solving a multicoloring problem with overlaps using integer programming.
#@Isabel Méndez-Díaz,Paula Zabala
#t2010
#cDiscrete Applied Mathematics
#index1336429
#%838752
#%1275096
#%1288590
#!
  
#*A proof of a conjecture on the Randic index of graphs with given girth.
#@Xueliang Li,Jianxi Liu
#t2009
#cDiscrete Applied Mathematics
#index1336401
#% 
#!
  
#*Positive circuits and maximal number of fixed points in discrete dynamical systems.
#@Adrien Richard
#t2009
#cDiscrete Applied Mathematics
#index1336354
#%167936
#%838724
#!
  
#*Lower bounds for optimal alignments of binary sequences.
#@Cynthia Vinzant
#t2009
#cDiscrete Applied Mathematics
#index1336378
#%522
#%836753
#!
  
#*A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem.
#@Sylvain Boussier,Michel Vasquez,Yannick Vimont,Saïd Hanafi,Philippe Michelon
#t2010
#cDiscrete Applied Mathematics
#index1336422
#%816206
#%885431
#%897525
#%952125
#!
  
#*Multiple levels of preference in interactive strategic decisions.
#@Haiyan Xu,Keith W. Hipel,D. Marc Kilgour
#t2009
#cDiscrete Applied Mathematics
#index1336404
#%814260
#%838472
#%3355645
#!
  
#*Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets.
#@Henrik Schulz
#t2009
#cDiscrete Applied Mathematics
#index1336363
#%593637
#%803635
#%834111
#!
  
#*An upper bound for the competition numbers of graphs.
#@Akira Kamibeppu
#t2010
#cDiscrete Applied Mathematics
#index1336435
#%1270320
#!
  
#*Pure 2D picture grammars and languages.
#@K. G. Subramanian,Rosihan M. Ali,M. Geethalakshmi,Atulya K. Nagar
#t2009
#cDiscrete Applied Mathematics
#index1336357
#%228806
#%863524
#%863840
#%882079
#%882183
#%1327535
#%3004261
#!
  
#*A new characterization of matrices with the consecutive ones property.
#@N. S. Narayanaswamy,R. Subashini
#t2009
#cDiscrete Applied Mathematics
#index1336368
#%772122
#%837648
#%838708
#%953092
#!
  
#*The inverse problem for certain tree parameters.
#@Éva Czabarka,László A. Székely,Stephan Wagner
#t2009
#cDiscrete Applied Mathematics
#index1336402
#%851257
#%1270193
#!
  
#*Three supplements to Reid's theorem in multipartite tournaments.
#@Shengjia Li,Wei Meng,Yubao Guo
#t2010
#cDiscrete Applied Mathematics
#index1336432
#%851781
#%852461
#%883313
#%977979
#!
  
#*Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs.
#@Flavia Bonomo,Guillermo Durán,Francisco J. Soulignac,Gabriel Sueiro
#t2009
#cDiscrete Applied Mathematics
#index1336407
#%798033
#%837498
#%838840
#%848649
#%850548
#%853915
#%933197
#!
  
#*Crossing minimization in extended level drawings of graphs.
#@Christian Bachmaier,Hedi Buchner,Michael Forster,Seok-Hee Hong
#t2010
#cDiscrete Applied Mathematics
#index1336440
#%2583
#%224997
#%225111
#%283053
#%843719
#%1133483
#%1134073
#!
  
#*Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence.
#@Hua Wang
#t2009
#cDiscrete Applied Mathematics
#index1336355
#%838917
#!
  
#*The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm.
#@Jacques Carlier,Aziz Moukrim,Huang Xu
#t2009
#cDiscrete Applied Mathematics
#index1336374
#%745315
#%885425
#!
  
#*A characterization of block graphs.
#@Ali Behtoei,Mohsen Jannesari,Bijan Taeri
#t2010
#cDiscrete Applied Mathematics
#index1336438
#% 
#!
  
#*Properties of total domination edge-critical graphs.
#@Michael A. Henning,Lucas C. van der Merwe
#t2010
#cDiscrete Applied Mathematics
#index1336445
#%850745
#%851547
#%2851828
#!
  
#*The core and the Weber set of games on augmenting systems.
#@Jesús Mario Bilbao,M. Ordóñez
#t2010
#cDiscrete Applied Mathematics
#index1336421
#%1061100
#%1061032
#!
  
#*Supereulerianity of k-edge-connected graphs with a restriction on small bonds.
#@Zhaohong Niu,Liming Xiong
#t2010
#cDiscrete Applied Mathematics
#index1336431
#%836248
#%837408
#%854349
#%975009
#!
  
#*Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007.
#@Ulrich Faigle,Johann Hurink
#t2010
#cDiscrete Applied Mathematics
#index1336415
#% 
#!
  
#*Exclusive and essential sets of implicates of Boolean functions.
#@Endre Boros,Ondrej Cepek,Alexander Kogan,Petr Kucera
#t2010
#cDiscrete Applied Mathematics
#index1336394
#%621778
#%745030
#%751376
#%890323
#%931574
#%951084
#%973055
#%1058478
#%1112878
#%3003624
#!
  
#*Labeling the r-path with a condition at distance two.
#@John P. Georges,David W. Mauro,Yan Wang
#t2009
#cDiscrete Applied Mathematics
#index1336377
#%611669
#%847716
#%1061419
#%1061777
#%1061947
#%1062026
#%1061914
#%1270136
#%1341526
#!
  
#*A note on the domination dot-critical graphs.
#@Xue-gang Chen,Wai Chee Shiu
#t2009
#cDiscrete Applied Mathematics
#index1336365
#%1270143
#!
  
#*On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups.
#@J. Meng-Gérard,Philippe Chrétienne,Philippe Baptiste,Francis Sourd
#t2009
#cDiscrete Applied Mathematics
#index1336388
#%117142
#%838851
#%839080
#%1060972
#%1094527
#!
  
#*Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.
#@Haim Kaplan,Yahav Nussbaum
#t2009
#cDiscrete Applied Mathematics
#index1336396
#%525
#%611107
#%837741
#%837650
#%952870
#%1059009
#%1060701
#%1061471
#%1062087
#%1092124
#%1144530
#!
  
#*Structural analysis of a fractional matching problem.
#@R. Chandrasekaran,M. Dawande
#t2009
#cDiscrete Applied Mathematics
#index1336371
#%929747
#%1347891
#!
  
#*A new neighborhood and tabu search for the Blocking Job Shop.
#@Heinz Gröflin,Andreas Klinkert
#t2009
#cDiscrete Applied Mathematics
#index1336385
#% 
#!
  
#*Augmented nodal matrices and normal trees.
#@Ricardo Riaza,Alfonso J. Encinas
#t2010
#cDiscrete Applied Mathematics
#index1336437
#% 
#!
  
#*Most balanced minimum cuts.
#@Paul S. Bonsma
#t2010
#cDiscrete Applied Mathematics
#index1336446
#%269136
#%406787
#%621730
#%621971
#%783684
#%838592
#%931080
#%951026
#%952941
#!
  
#*Minimum cut bases in undirected networks.
#@Florentine Bunke,Horst W. Hamacher,Francesco Maffioli,Anne M. Schwahn
#t2010
#cDiscrete Applied Mathematics
#index1336424
#%624204
#%838855
#%853069
#%950462
#%974491
#%1058311
#%1059428
#%1059545
#%2871132
#!
  
#*Optimal receiver scheduling algorithms for a multicast problem.
#@Alan A. Bertossi,Maria Cristina Pinotti,Romeo Rizzi
#t2009
#cDiscrete Applied Mathematics
#index1336393
#%1016785
#!
  
#*Rainbow domination on trees.
#@Gerard J. Chang,Jiaojiao Wu,Xuding Zhu
#t2010
#cDiscrete Applied Mathematics
#index1336416
#%838649
#!
  
#*Some theoretical challenges in digital geometry: A perspective.
#@Tetsuo Asano,Valentin E. Brimkov,Reneta P. Barneva
#t2009
#cDiscrete Applied Mathematics
#index1336405
#%2487
#%2616
#%3482
#%154088
#%268569
#%750598
#%835341
#%836759
#%837317
#%838629
#%839091
#%931703
#%951246
#%953287
#%1031173
#%1093258
#%1096258
#%1096261
#%1227036
#%3004083
#!
  
#*Parameterized graph cleaning problems.
#@Dániel Marx,Ildikó Schlotter
#t2009
#cDiscrete Applied Mathematics
#index1336398
#%73
#%2022
#%104882
#%269338
#%398574
#%622067
#%853418
#%950704
#%952716
#%973231
#%1093037
#!
  
#*The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops.
#@Gregory Gutin,Eun Jung Kim
#t2010
#cDiscrete Applied Mathematics
#index1336425
#%660807
#%838940
#%865459
#%953187
#%975607
#%1061081
#%1061471
#%1341541
#%3480154
#!
  
#*Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian.
#@Ruijuan Li,Shengjia Li,Yubao Guo
#t2010
#cDiscrete Applied Mathematics
#index1336423
#%838577
#%865088
#!
  
#*Analyzing quadratic unconstrained binary optimization problems via multicommodity flows.
#@Di Wang,Robert Kleinberg
#t2009
#cDiscrete Applied Mathematics
#index1336379
#%3005546
#!
  
#*clever or smart: Strategies for the online target date assignment problem.
#@Elisabeth Gassner,Johannes Hatzl,Sven Oliver Krumke,Sleman Saliba
#t2010
#cDiscrete Applied Mathematics
#index1336418
#%623045
#%1024799
#%3005125
#!
  
#*Approximating the maximum 2- and 3-edge-colorable subgraph problems.
#@Adrian Kosowski
#t2009
#cDiscrete Applied Mathematics
#index1336390
#%46582
#%611189
#%622067
#%852004
#%932962
#%979687
#!
  
#*Connectivity preserving transformations for higher dimensional binary images.
#@Anvesh Komuravelli,Arnab Sinha,Arijit Bishnu
#t2009
#cDiscrete Applied Mathematics
#index1336380
#%2918950
#%3004083
#!
  
#*Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance.
#@Mustapha Aouchiche,Odile Favaron,Pierre Hansen
#t2009
#cDiscrete Applied Mathematics
#index1336372
#%836739
#%838963
#%847194
#%850815
#%851253
#%852635
#!
  
#*Approximating a real number by a rational number with a limited denominator: A geometric approach.
#@Emilie Charrier,Lilian Buzer
#t2009
#cDiscrete Applied Mathematics
#index1336359
#%1059469
#%3003378
#!
  
#*Total outer-connected domination numbers of trees.
#@Joanna Cyman,Joanna Raczek
#t2009
#cDiscrete Applied Mathematics
#index1336361
#% 
#!
  
#*Bounds on the index of the signless Laplacian of a graph.
#@Carla Silva Oliveira,Leonardo Silva de Lima,Nair Maria Maia de Abreu,Pierre Hansen
#t2010
#cDiscrete Applied Mathematics
#index1336443
#% 
#!
  
#*Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids.
#@Robin Strand,Benedek Nagy
#t2009
#cDiscrete Applied Mathematics
#index1336358
#%312508
#%638945
#%828046
#%833662
#%835426
#%940182
#%951478
#%1033261
#%1041949
#%1042507
#%1044246
#%1046109
#%1046601
#%1270319
#!
  
#*Combinatorial approach to image analysis.
#@Valentin E. Brimkov,Reneta P. Barneva
#t2009
#cDiscrete Applied Mathematics
#index1336353
#% 
#!
  
#*On island sequences of labelings with a condition at distance two.
#@Sarah Spence Adams,Alex Trazkovich,Denise Sakai Troxell,Bradford Westgate
#t2010
#cDiscrete Applied Mathematics
#index1336436
#%836915
#%838568
#%838593
#%838700
#%854494
#%1061419
#!
  
#*Solving symmetric mixed-model multi-level just-in-time scheduling problems.
#@Malte Fliedner,Nils Boysen,Armin Scholl
#t2010
#cDiscrete Applied Mathematics
#index1336426
#%1054477
#!
  
#*Foreword.
#@Luca Maria Gambardella,Alain Hertz,Frédéric Maffray,Marino Widmer
#t2009
#cDiscrete Applied Mathematics
#index1336367
#% 
#!
  
#*Transforms of pseudo-Boolean random variables.
#@Guoli Ding,Robert F. Lax,Jianhua Chen,Peter P. Chen,Brian D. Marx
#t2010
#cDiscrete Applied Mathematics
#index1336444
#%389440
#%838960
#%1013094
#%1021420
#!
  
#*Induced disjoint paths problem in a planar digraph.
#@Yusuke Kobayashi
#t2009
#cDiscrete Applied Mathematics
#index1336387
#%611561
#%852950
#%951591
#%977721
#%1060402
#!
  
#*A note on kernels and Sperner's Lemma.
#@Tamás Király,Júlia Pap
#t2009
#cDiscrete Applied Mathematics
#index1336364
#%798146
#%1014248
#%1060952
#!
  
#*Bounded edge-connectivity and edge-persistence of Cartesian product of graphs.
#@You Lu,Jun-Ming Xu,Xinmin Hou
#t2009
#cDiscrete Applied Mathematics
#index1336408
#%836971
#%853820
#!
  
#*Tricyclic graphs with maximum Merrifield-Simmons index.
#@Zhongxun Zhu,Shuchao Li,Liansheng Tan
#t2010
#cDiscrete Applied Mathematics
#index1336439
#%837814
#%1270232
#!
  
#*One-to-many node-disjoint paths in (n, k)-star graphs.
#@Yonghong Xiang,Iain A. Stewart
#t2010
#cDiscrete Applied Mathematics
#index1336410
#%408502
#%930742
#%942992
#%951394
#%975766
#%1078237
#%1080300
#%1124749
#!
  
#*A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints.
#@Krzysztof Giaro,Marek Kubale,P. Obszarski
#t2009
#cDiscrete Applied Mathematics
#index1336369
#%415657
#%930069
#%932314
#!
  
#*Double-super-connected digraphs.
#@Juan Liu,Jixiang Meng,Zhao Zhang
#t2010
#cDiscrete Applied Mathematics
#index2857034
#%864542
#%934529
#%935116
#%1270321
#!
  
#*Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree.
#@Charles R. Johnson,Christopher Jordan-Squire,David A. Sher
#t2010
#cDiscrete Applied Mathematics
#index2857052
#%3113359
#!
  
#*Integer matrices with constraints on leading partial row and column sums.
#@Stephen E. Wright
#t2010
#cDiscrete Applied Mathematics
#index2857077
#%836214
#%971524
#%1016199
#%1058808
#%1061557
#%3005546
#!
  
#*Approximation algorithms for art gallery problems in polygons.
#@Subir Kumar Ghosh
#t2010
#cDiscrete Applied Mathematics
#index2856981
#%210941
#%749592
#%803523
#%803768
#%803562
#%804054
#%844084
#%931057
#%934739
#%972335
#%1060730
#%1079109
#%1107155
#%2781266
#!
  
#*A note on scheduling identical coupled tasks in logarithmic time.
#@Philippe Baptiste
#t2010
#cDiscrete Applied Mathematics
#index2856995
#%837866
#!
  
#*A note on the weakly convex and convex domination numbers of a torus.
#@Joanna Raczek,Magdalena Lemanska
#t2010
#cDiscrete Applied Mathematics
#index2857072
#%1270219
#!
  
#*Computing an eigenvector of an inverse Monge matrix in max-plus algebra.
#@Aleksey A. Imaev,Robert P. Judd
#t2010
#cDiscrete Applied Mathematics
#index2857070
#%836303
#!
  
#*Network flow interdiction on planar graphs.
#@Rico Zenklusen
#t2010
#cDiscrete Applied Mathematics
#index2857059
#%622912
#%1024846
#%1060067
#%3005546
#!
  
#*k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.
#@Nicole Eggemann,Frédéric Havet,Steven D. Noble
#t2010
#cDiscrete Applied Mathematics
#index2856961
#%493584
#%611669
#%623072
#%865288
#%1061170
#%1061419
#%1091183
#%1270377
#%3480322
#!
  
#*Excessive factorizations of bipartite multigraphs.
#@David Cariolaro,Romeo Rizzi
#t2010
#cDiscrete Applied Mathematics
#index2857107
#%1144664
#!
  
#*Covering and radius-covering arrays: Constructions and classification.
#@Charles J. Colbourn,Gerzson Kéri,P. P. Rivas Soriano,Jan-Christoph Schlage-Puchta
#t2010
#cDiscrete Applied Mathematics
#index2857018
#%811804
#%837831
#%842418
#%842143
#%842784
#%851205
#%1281261
#%2919253
#!
  
#*A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone.
#@Dirk Oliver Theis
#t2010
#cDiscrete Applied Mathematics
#index2857023
#%83712
#%1013155
#%1014045
#%1014477
#!
  
#*Acute triangulations of trapezoids.
#@Liping Yuan
#t2010
#cDiscrete Applied Mathematics
#index2857000
#%843519
#%844096
#%844026
#%864788
#%865211
#%865554
#!
  
#*Out-arc pancyclicity of vertices in tournaments.
#@Qiaoping Guo,Shengjia Li,Yubao Guo,Hongwei Li
#t2010
#cDiscrete Applied Mathematics
#index2856991
#%838341
#%838781
#%2921509
#!
  
#*Balanced and 1-balanced graph constructions.
#@Arthur M. Hobbs,Lavanya Kannan,Hong-Jian Lai,Hongyuan Lai,Guoqing Weng
#t2010
#cDiscrete Applied Mathematics
#index2857116
#%652709
#%793563
#%836358
#!
  
#*Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph.
#@Louigi Addario-Berry,W. Sean Kennedy,Andrew D. King,Zhentao Li,Bruce A. Reed
#t2010
#cDiscrete Applied Mathematics
#index2857064
#%838458
#%1061091
#%1061194
#!
  
#*Complexity results related to monophonic convexity.
#@Mitre Costa Dourado,Fábio Protti,Jayme Luiz Szwarcfiter
#t2010
#cDiscrete Applied Mathematics
#index2857098
#%850714
#%975416
#%1091686
#!
  
#*A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges.
#@Peng Cheng,Shigeru Masuyama
#t2010
#cDiscrete Applied Mathematics
#index2856964
#%831140
#%1060278
#!
  
#*A tight bound on the min-ratio edge-partitioning problem of a tree.
#@An-Chiang Chu,Bang Ye Wu,Hung-Lung Wang,Kun-Mao Chao
#t2010
#cDiscrete Applied Mathematics
#index2857089
#%17108
#%416196
#%610534
#%642937
#%837595
#%838599
#%935053
#%949788
#%951301
#%1089228
#!
  
#*Minimum fill-in and treewidth of split+ke and split+kv graphs.
#@Federico Mancini
#t2010
#cDiscrete Applied Mathematics
#index2856982
#%211084
#%416096
#%623317
#%660599
#%836315
#%837832
#%929689
#%931034
#%931986
#%973165
#%1059711
#%1093313
#!
  
#*Distance spectral radius of trees with given matching number.
#@Aleksandar Ilic
#t2010
#cDiscrete Applied Mathematics
#index2857113
#%836565
#%836861
#%837111
#%838926
#%839098
#!
  
#*On acyclicity of games with cycles.
#@Daniel Andersson,Vladimir Gurvich,Thomas Dueholm Hansen
#t2010
#cDiscrete Applied Mathematics
#index2857036
#% 
#!
  
#*The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.
#@Frederico Paiva Quintão,Alexandre Salles da Cunha,Geraldo Robson Mateus,Abilio Lucena
#t2010
#cDiscrete Applied Mathematics
#index2856989
#%812843
#%951211
#%1013703
#%1014019
#%1061754
#!
  
#*Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date.
#@Imed Kacem
#t2010
#cDiscrete Applied Mathematics
#index2857015
#%924266
#%950753
#%1095472
#%1095771
#!
  
#*Dimension-2 poset competition numbers and dimension-2 poset double competition numbers.
#@Yaokun Wu,Junjie Lu
#t2010
#cDiscrete Applied Mathematics
#index2857033
#%611113
#%836444
#%836872
#%837424
#%838585
#%839333
#%839470
#%979172
#%1061426
#%1090893
#!
  
#*The rank-width of the square grid.
#@Vít Jelínek
#t2010
#cDiscrete Applied Mathematics
#index2857009
#%978691
#%1060875
#%1144642
#!
  
#*Generalized knight's tour on 3D chessboards.
#@Sen Bai,Xiaofan Yang,Guibin Zhu,De-Lei Jiang,Jian Huang
#t2010
#cDiscrete Applied Mathematics
#index2857062
#%836440
#%837453
#%837777
#!
  
#*Uniform election in trees and polyominoids.
#@A. El Hibaoui,John Michael Robson,Nasser Saheb-Djahromi,Akka Zemmari
#t2010
#cDiscrete Applied Mathematics
#index2856992
#%621269
#%888670
#%888888
#%932924
#%932840
#%3006604
#!
  
#*The Banzhaf power index for ternary bicooperative games.
#@Jesús Mario Bilbao,J. R. Fernández,N. Jiménez,J. J. López
#t2010
#cDiscrete Applied Mathematics
#index2857044
#%838933
#%857084
#%3449669
#!
  
#*On packing and covering polyhedra of consecutive ones circulant clutters.
#@Néstor E. Aguilera
#t2010
#cDiscrete Applied Mathematics
#index2857099
#%838392
#%975209
#%1014248
#%1014246
#!
  
#*Hyper- and reverse-Wiener indices of F-sums of graphs.
#@Metrose Metsidik,Weijuan Zhang,Fang Duan
#t2010
#cDiscrete Applied Mathematics
#index2857067
#%1270170
#!
  
#*Comparing Zagreb indices for connected graphs.
#@Batmend Horoldagva,Sang-Gu Lee
#t2010
#cDiscrete Applied Mathematics
#index2856972
#%847194
#%1270290
#!
  
#*Ordering connected graphs having small degree distances.
#@Ioan Tomescu
#t2010
#cDiscrete Applied Mathematics
#index2857078
#%838766
#%839008
#!
  
#*New results on optimizing rooted triplets consistency.
#@Jaroslaw Byrka,Sylvain Guillemot,Jesper Jansson
#t2010
#cDiscrete Applied Mathematics
#index2857025
#%481269
#%622980
#%623246
#%650621
#%750258
#%837612
#%838058
#%838636
#%861616
#%889990
#%950693
#%953130
#%979635
#%1059660
#%1059654
#%1060995
#%1087075
#%1092326
#%1180679
#%1307604
#%1342943
#%2863992
#!
  
#*The clique operator on circular-arc graphs.
#@Min Chih Lin,Francisco J. Soulignac,Jayme Luiz Szwarcfiter
#t2010
#cDiscrete Applied Mathematics
#index2857114
#%661063
#%838068
#%838482
#%853325
#%865557
#%953009
#%1059009
#%1062087
#!
  
#*Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface.
#@Martin Kochol
#t2010
#cDiscrete Applied Mathematics
#index2857085
#%225253
#%935131
#!
  
#*A min-max theorem for plane bipartite graphs.
#@Hernán G. Abeledo,Gary W. Atkinson
#t2010
#cDiscrete Applied Mathematics
#index2857010
#% 
#!
  
#*Repetition-free longest common subsequence.
#@Said Sadique Adi,Marília D. V. Braga,Cristina G. Fernandes,Carlos Eduardo Ferreira,Fábio Viduani Martinez,Marie-France Sagot,Marco A. Stefanes,Christian Tjandraatmadja,Yoshiko Wakabayashi
#t2010
#cDiscrete Applied Mathematics
#index2856999
#%481374
#!
  
#*On time-relaxed broadcasting networks.
#@Tianxing Yao,Peter Che Bor Lam,Wensong Lin,Guofei Zhou
#t2010
#cDiscrete Applied Mathematics
#index2856997
#%838081
#%1061420
#!
  
#*k-tuple total domination in graphs.
#@Michael A. Henning,Adel P. Kazemi
#t2010
#cDiscrete Applied Mathematics
#index2856990
#%1144588
#!
  
#*An iterative approach to graph irregularity strength.
#@Michael Ferrara,Ronald J. Gould,Michal Karonski,Florian Pfender
#t2010
#cDiscrete Applied Mathematics
#index2857029
#%852079
#%1061655
#%1144563
#%3480271
#!
  
#*The hardness of approximating the boxicity, cubicity and threshold dimension of a graph.
#@Abhijin Adiga,Diptendu Bhowmick,L. Sunil Chandran
#t2010
#cDiscrete Applied Mathematics
#index2857061
#%837424
#!
  
#*Random walks and the effective resistance sum rules.
#@Haiyan Chen
#t2010
#cDiscrete Applied Mathematics
#index2857056
#%838534
#%950015
#!
  
#*Codes from lattice and related graphs, and permutation decoding.
#@Jennifer D. Key,Bernardo Gabriel Rodrigues
#t2010
#cDiscrete Applied Mathematics
#index2856979
#%842035
#%864673
#%864674
#%865183
#%993507
#%2925487
#%3400547
#!
  
#*First-Fit coloring of {P, K-e}-free graphs.
#@Sheshayya A. Choudum,T. Karthick
#t2010
#cDiscrete Applied Mathematics
#index2857038
#% 
#!
  
#*Limited packings in graphs.
#@Robert Gallant,Georg Gunther,Bert Hartnell,Douglas F. Rall
#t2010
#cDiscrete Applied Mathematics
#index2857105
#%1025818
#!
  
#*Local edge-connectivity augmentation in hypergraphs is NP-complete.
#@Zoltán Király,Ben Cosh,Bill Jackson
#t2010
#cDiscrete Applied Mathematics
#index2856977
#%611126
#%837757
#%973099
#%975675
#%976396
#%976624
#%1061347
#%1061456
#!
  
#*On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width.
#@Robert Ganian,Petr Hlinený
#t2010
#cDiscrete Applied Mathematics
#index2857043
#%267132
#%660576
#%836522
#%837340
#%887537
#%974454
#%977408
#%977717
#%978691
#%978728
#%1058968
#%1060875
#%1091459
#%1095323
#%1265312
#%1270235
#%2857053
#!
  
#*Additive edge labelings.
#@Alicia Dickenstein,Enrique A. Tobis
#t2010
#cDiscrete Applied Mathematics
#index2856980
#%853049
#!
  
#*Further results on atom-bond connectivity index of trees.
#@Rundan Xing,Bo Zhou,Zhibin Du
#t2010
#cDiscrete Applied Mathematics
#index2857100
#%1270195
#!
  
#*The smallest values of algebraic connectivity for unicyclic graphs.
#@Jianxi Li,Ji-Ming Guo,Wai Chee Shiu
#t2010
#cDiscrete Applied Mathematics
#index2857120
#% 
#!
  
#*The bipartite edge frustration of composite graphs.
#@Zahra Yarahmadi,Tomislav Doslic,Ali Reza Ashrafi
#t2010
#cDiscrete Applied Mathematics
#index2857075
#%838597
#%1270267
#!
  
#*Boundary defensive k-alliances in graphs.
#@Ismael Gónzalez Yero,Juan Alberto Rodríguez-Velazquez
#t2010
#cDiscrete Applied Mathematics
#index2857069
#%839071
#!
  
#*Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments.
#@Dvir Shabtay,George Steiner,Liron Yedidsion
#t2010
#cDiscrete Applied Mathematics
#index2856987
#%2616
#%770378
#%812237
#%813635
#%814860
#%836426
#%837316
#%885448
#%1054535
#%1092680
#%1095472
#!
  
#*The independence polynomial of rooted products of graphs.
#@Vladimir R. Rosenfeld
#t2010
#cDiscrete Applied Mathematics
#index2857002
#%831295
#%838743
#%854797
#%864698
#%974864
#%978733
#!
  
#*On the kth smallest and kth greatest modified Wiener indices of trees.
#@Muhuo Liu,Bolian Liu
#t2010
#cDiscrete Applied Mathematics
#index2857016
#%838917
#%1270276
#!
  
#*A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
#@Günes Erdogan,Jean-François Cordeau,Gilbert Laporte
#t2010
#cDiscrete Applied Mathematics
#index2857086
#%837126
#%952948
#%1024813
#%1058381
#%1058463
#%1058798
#%1059213
#%2852861
#!
  
#*Sorting with networks of data structures.
#@Therese C. Biedl,Alexander Golynski,Angèle M. Hamel,Alejandro López-Ortiz,J. Ian Munro
#t2010
#cDiscrete Applied Mathematics
#index2857092
#%620872
#%620873
#%622938
#%830818
#%846840
#%847806
#%852017
#%854153
#%854399
#%930157
#%951700
#%952588
#%974753
#%974754
#%974751
#%975905
#%976579
#%1088987
#%1088989
#%1088988
#%1095213
#%3296042
#!
  
#*Characterizing and computing minimal cograph completions.
#@Daniel Lokshtanov,Federico Mancini,Charis Papadopoulos
#t2010
#cDiscrete Applied Mathematics
#index2856993
#%73
#%211084
#%622806
#%623317
#%836239
#%838071
#%838435
#%838864
#%929689
#%953010
#%953230
#%1058697
#%1089427
#%1092634
#%1341536
#!
  
#*Restricted power domination and fault-tolerant power domination on grids.
#@Kung-Jui Pai,Jou-Ming Chang,Yue-Li Wang
#t2010
#cDiscrete Applied Mathematics
#index2856966
#%750956
#%1061132
#%1061459
#%1095285
#!
  
#*On the connectivity and superconnected graphs with small diameter.
#@Camino Balbuena,Kim Marshall,Luis Pedro Montejano
#t2010
#cDiscrete Applied Mathematics
#index2856971
#%850616
#%1079783
#%1270144
#!
  
#*Complexity of two coloring problems in cubic planar bipartite mixed graphs.
#@B. Ries
#t2010
#cDiscrete Applied Mathematics
#index2857007
#%837691
#%838431
#%838547
#%865451
#%935025
#!
  
#*Antiblocking decoding.
#@Hans-Joachim Kroll,Rita Vincenti
#t2010
#cDiscrete Applied Mathematics
#index2857106
#% 
#!
  
#*Covering a laminar family by leaf to leaf links.
#@Yael Maduel,Zeev Nutov
#t2010
#cDiscrete Applied Mathematics
#index2857091
#%186032
#%837754
#%1077408
#!
  
#*A tight bound on the number of mobile servers to guarantee transferability among dominating configurations.
#@Satoshi Fujita
#t2010
#cDiscrete Applied Mathematics
#index2857046
#%344444
#%415311
#%750111
#%839330
#%930008
#%931882
#%933525
#%934635
#%1124878
#%1125534
#!
  
#*On homogeneous rotation symmetric bent functions.
#@Qiang Meng,Lusheng Chen,Fang-Wei Fu
#t2010
#cDiscrete Applied Mathematics
#index2857048
#%838967
#%864971
#%933974
#!
  
#*The k-in-a-tree problem for graphs of girth at least k.
#@W. Liu,Nicolas Trotignon
#t2010
#cDiscrete Applied Mathematics
#index2857111
#%1336356
#%2921537
#!
  
#*An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order.
#@Martin Sauerhoff
#t2010
#cDiscrete Applied Mathematics
#index2856994
#%132115
#%623064
#%626054
#%783800
#%838607
#%862115
#%973127
#!
  
#*2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes.
#@Heping Zhang,Saihua Liu
#t2010
#cDiscrete Applied Mathematics
#index2857101
#%837313
#%838389
#%839122
#%839243
#%1341637
#!
  
#*Inequalities of Nordhaus-Gaddum type for doubly connected domination number.
#@M. H. Akhbari,R. Hasni,Odile Favaron,Hosein Karami,Seyed Mahmoud Sheikholeslami
#t2010
#cDiscrete Applied Mathematics
#index2856963
#% 
#!
  
#*On well-covered triangulations: Part III.
#@Arthur S. Finbow,Bert Hartnell,Richard J. Nowakowski,Michael D. Plummer
#t2010
#cDiscrete Applied Mathematics
#index2856996
#%836770
#%851733
#%854536
#%978147
#%978148
#%1270187
#!
  
#*On the distribution of distances between specified nodes in increasing trees.
#@Markus Kuba,Alois Panholzer
#t2010
#cDiscrete Applied Mathematics
#index2857035
#%724
#%70692
#%979149
#%1052073
#%1052218
#%1051909
#%1052370
#%1059022
#!
  
#*Finding large cycles in Hamiltonian graphs.
#@Tomás Feder,Rajeev Motwani
#t2010
#cDiscrete Applied Mathematics
#index2856969
#%219937
#%610552
#%622066
#%952633
#%974724
#%975075
#%976387
#%977721
#%977824
#%1058629
#%1058915
#%1059156
#%1060725
#!
  
#*On the complexity of computing treelength.
#@Daniel Lokshtanov
#t2010
#cDiscrete Applied Mathematics
#index2857024
#%269358
#%621963
#%826591
#%953010
#%1058651
#%1058697
#%1060872
#%1095791
#!
  
#*Decompositions for edge-coloring join graphs and cobipartite graphs.
#@Raphael C. S. Machado,Celina M. H. de Figueiredo
#t2010
#cDiscrete Applied Mathematics
#index2857119
#%839124
#%853253
#%932962
#%1094600
#!
  
#*O(mlogn) split decomposition of strongly-connected graphs.
#@Benson L. Joeris,Scott Lundberg,Ross M. McConnell
#t2010
#cDiscrete Applied Mathematics
#index2857047
#%269080
#%797965
#%838875
#%839425
#%950362
#%952832
#%974454
#%1092124
#%2975778
#!
  
#*Interlace polynomials: Enumeration, unimodality and connections to codes.
#@Lars Eirik Danielsen,Matthew G. Parker
#t2010
#cDiscrete Applied Mathematics
#index2857041
#%824230
#%835946
#%842757
#%864155
#%953577
#%974427
#%974785
#%974787
#%977892
#%978555
#!
  
#*L(j, k)-labelling and maximum ordering-degrees for trees.
#@Justie Su-tzu Juan,Daphne Der-Fen Liu,Li-Yueh Chen
#t2010
#cDiscrete Applied Mathematics
#index2857021
#%269351
#%847716
#%864266
#%977269
#%1061170
#%1061419
#%1061777
#%1062026
#%1061914
#!
  
#*Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.
#@Ken Takata
#t2010
#cDiscrete Applied Mathematics
#index2857076
#%660473
#%752000
#%836103
#%908989
#%931986
#%951744
#%1058697
#%1059793
#%1094587
#!
  
#*On maximum independent sets in P-free graphs.
#@Bert Randerath,Ingo Schiermeyer
#t2010
#cDiscrete Applied Mathematics
#index2856988
#% 
#!
  
#*The competition number of a graph whose holes do not overlap much.
#@Suh-Ryung Kim,Jung Yeun Lee,Yoshio Sano
#t2010
#cDiscrete Applied Mathematics
#index2857083
#%837358
#%838390
#%839029
#%1270294
#%1270320
#!
  
#*Recognizing near-bipartite Pfaffian graphs in polynomial time.
#@Alberto Alexandre Assis Miranda,Cláudio Leonardo Lucchesi
#t2010
#cDiscrete Applied Mathematics
#index2857112
#%839384
#%975576
#!
  
#*The nonidealness index of rank-ideal matrices.
#@Gabriela R. Argiroffo,Silvia M. Bianchi
#t2010
#cDiscrete Applied Mathematics
#index2857065
#%838392
#%975209
#%975847
#%1013704
#%1340611
#!
  
#*An enumeration of equilateral triangle dissections.
#@Ales Drápal,Carlo Hämäläinen
#t2010
#cDiscrete Applied Mathematics
#index2857117
#%847484
#%978016
#%979213
#!
  
#*Satisfiability of algebraic circuits over sets of natural numbers.
#@Christian Glaßer,Christian Reitwießner,Stephen D. Travers,Matthias Waldherr
#t2010
#cDiscrete Applied Mathematics
#index2857058
#%104839
#%494722
#%620577
#%621778
#%623088
#%861061
#%973140
#!
  
#*A note on the acyclic 3-choosability of some planar graphs.
#@Hervé Hocquard,Mickaël Montassier,André Raspaud
#t2010
#cDiscrete Applied Mathematics
#index2857001
#%974772
#%978236
#%1144413
#%1276237
#%3480376
#!
  
#*Robust network optimization under polyhedral demand uncertainty is NP-hard.
#@Michel Minoux
#t2010
#cDiscrete Applied Mathematics
#index2857008
#%1024820
#%1289706
#%1289967
#!
  
#*Graph operations that are good for greedoids.
#@Vadim E. Levit,Eugen Mandrescu
#t2010
#cDiscrete Applied Mathematics
#index2857096
#%79048
#%204226
#%837520
#%837522
#%838734
#!
  
#*Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem.
#@Wei-jie Cong,Hong-wei Liu
#t2010
#cDiscrete Applied Mathematics
#index2857050
#%838661
#%1289988
#!
  
#*Total domination critical and stable graphs upon edge removal.
#@Wyatt J. Desormeaux,Teresa W. Haynes,Michael A. Henning
#t2010
#cDiscrete Applied Mathematics
#index2857103
#% 
#!
  
#*An implicit representation of chordal comparability graphs in linear time.
#@Andrew R. Curtis,Clemente Izurieta,Benson L. Joeris,Scott Lundberg,Ross M. McConnell
#t2010
#cDiscrete Applied Mathematics
#index2857013
#%622407
#%851455
#%1059553
#!
  
#*Cover-incomparability graphs and chordal graphs.
#@Bostjan Bresar,Manoj Changat,Tanja Gologranc,Joseph Mathews,Antony Mathews
#t2010
#cDiscrete Applied Mathematics
#index2857068
#%233394
#%837116
#%3077088
#!
  
#*A generalization of interval edge-colorings of graphs.
#@Petros A. Petrosyan,H. Z. Arakelyan,V. M. Baghdasaryan
#t2010
#cDiscrete Applied Mathematics
#index2857094
#%836934
#%836935
#%974447
#%1061870
#!
  
#*Bounds for short covering codes and reactive tabu search.
#@Carlos Mendes,Emerson L. Monte Carmelo,Marcus Poggi
#t2010
#cDiscrete Applied Mathematics
#index2857032
#%865376
#%979389
#!
  
#*A new approximation algorithm for the multilevel facility location problem.
#@Adriana Felicia Gabor,Jan-Kees C. W. van Ommeren
#t2010
#cDiscrete Applied Mathematics
#index2856986
#%210344
#%210840
#%621300
#%623147
#%817978
#%950780
#%953022
#%953262
#%1014416
#%1058856
#%1060732
#!
  
#*A polyhedral approach to the stability of a family of coalitions.
#@Néstor E. Aguilera,Mariana S. Escalante
#t2010
#cDiscrete Applied Mathematics
#index2857045
#%798033
#%975847
#%1013083
#%3007117
#!
  
#*Enumeration of matchings in families of self-similar graphs.
#@Elmar Teufl,Stephan Wagner
#t2010
#cDiscrete Applied Mathematics
#index2857055
#%837111
#%974740
#%979127
#%2921494
#!
  
#*Feasibility of motion planning on acyclic and strongly connected directed graphs.
#@Zhilin Wu,Stéphane Grumbach
#t2010
#cDiscrete Applied Mathematics
#index2856974
#%624071
#%887043
#%742865
#%211229
#%211255
#%3002009
#%506389
#%559094
#!
  
#*On orthogonal ray graphs.
#@Anish Man Singh Shrestha,Satoshi Tayu,Shuichi Ueno
#t2010
#cDiscrete Applied Mathematics
#index2857073
#%283242
#%837321
#%837424
#%837741
#%838650
#%838220
#%852847
#%859244
#%864733
#%930255
#%930707
#%978023
#%1059992
#%1144530
#!
  
#*A polyhedral study of triplet formulation for single row facility layout problem.
#@Sujeevraja Sanjeevi,Kiavash Kianfar
#t2010
#cDiscrete Applied Mathematics
#index2857084
#%814119
#%839096
#%1289547
#!
  
#*A new characterization of P-free graphs.
#@Pim van 't Hof,Daniël Paulusma
#t2010
#cDiscrete Applied Mathematics
#index2857042
#% 
#!
  
#*Recognizing digraphs of Kelly-width 2.
#@Daniel Meister,Jan Arne Telle,Martin Vatshelle
#t2010
#cDiscrete Applied Mathematics
#index2856975
#%611130
#%851391
#%889631
#%976458
#%1096098
#!
  
#*Forcing matching numbers of fullerene graphs.
#@Heping Zhang,Dong Ye,Wai Chee Shiu
#t2010
#cDiscrete Applied Mathematics
#index2856970
#%837359
#%838389
#%838941
#%848812
#%852067
#%854655
#%1092865
#!
  
#*H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.
#@Binh-Minh Bui-Xuan,Jan Arne Telle,Martin Vatshelle
#t2010
#cDiscrete Applied Mathematics
#index2857053
#%611683
#%660576
#%831274
#%837340
#%975761
#%977717
#%978691
#%978746
#%1058968
#%1060205
#%1060875
#%1091459
#%1095323
#%1144642
#%1270235
#!
  
#*Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]
#@Zhi-Zhong Chen,Ruka Tanahashi,Lusheng Wang
#t2010
#cDiscrete Applied Mathematics
#index2857060
#% 
#!
  
#*Minimum sum edge colorings of multicycles.
#@Jean Cardinal,Vlady Ravelomanana,Mario Valencia-Pabon
#t2010
#cDiscrete Applied Mathematics
#index2856960
#%22484
#%46597
#%268332
#%611620
#%750063
#%783734
#%837974
#%847891
#%887133
#%931296
#%952599
#%1060518
#!
  
#*Matching interdiction.
#@Rico Zenklusen
#t2010
#cDiscrete Applied Mathematics
#index2857104
#%610536
#%622912
#%838435
#%838952
#%932586
#%1016282
#%1058651
#%1144456
#%2857059
#!
  
#*Guest Editors' Foreword.
#@Pinar Heggernes,Jan Kratochvíl,Andrzej Proskurowski
#t2010
#cDiscrete Applied Mathematics
#index2857027
#% 
#!
  
#*New families of graphs without short cycles and large size.
#@E. Abajo,Camino Balbuena,Ana Diánez
#t2010
#cDiscrete Applied Mathematics
#index2856978
#% 
#!
  
#*Atom-bond connectivity index of graphs.
#@Kinkar Ch. Das
#t2010
#cDiscrete Applied Mathematics
#index2857003
#%1270195
#!
  
#*On a disparity between relative cliquewidth and relative NLC-width.
#@Haiko Müller,Ruth Urner
#t2010
#cDiscrete Applied Mathematics
#index2856973
#%481148
#%621985
#%971764
#%978691
#%979196
#%1091656
#!
  
#*The Zagreb coindices of graph operations.
#@Ali Reza Ashrafi,Tomislav Doslic,A. Hamzeh
#t2010
#cDiscrete Applied Mathematics
#index2857115
#%838528
#%838871
#%1270352
#%2858894
#%2990183
#!
  
#*On the sum minimization version of the online bin covering problem.
#@János Csirik,Leah Epstein,Csanád Imreh,Asaf Levin
#t2010
#cDiscrete Applied Mathematics
#index2857095
#%268316
#%610325
#%741842
#%839205
#%953358
#%1014015
#%1092319
#!
  
#*Torsion formulas for signed graphs.
#@Beifang Chen,Jue Wang
#t2010
#cDiscrete Applied Mathematics
#index2857022
#%865517
#!
  
#*Wiener and vertex PI indices of Kronecker products of graphs.
#@Marhaba Hoji,Zhaoyang Luo,Elkin Vumar
#t2010
#cDiscrete Applied Mathematics
#index2857102
#%838871
#%935024
#%1061118
#%1144494
#%1270170
#%2990183
#!
  
#*On the packing chromatic number of some lattices.
#@Arthur S. Finbow,Douglas F. Rall
#t2010
#cDiscrete Applied Mathematics
#index2857012
#%838679
#%1191097
#!
  
#*Optimal radio labellings of complete m-ary trees.
#@Xiangwen Li,Vicky Mak,Sanming Zhou
#t2010
#cDiscrete Applied Mathematics
#index2856985
#%839037
#%1061170
#%1061385
#%1061419
#%1061654
#%1061947
#%1061914
#%1061886
#%1095398
#%1270341
#!
  
#*On the linear (n-1)-arboricity of K.
#@Bing Xue,Liancui Zuo
#t2010
#cDiscrete Applied Mathematics
#index2857093
#% 
#!
  
#*A transform property of Kloosterman sums.
#@Ian F. Blake,Theodoulos Garefalakis
#t2010
#cDiscrete Applied Mathematics
#index2856967
#%851182
#%851356
#%977866
#!
  
#*A note on the hardness of Skolem-type sequences.
#@Gustav Nordh
#t2010
#cDiscrete Applied Mathematics
#index2857014
#%977009
#%1054464
#!
  
#*The minimum reload s-t path, trail and walk problems.
#@Laurent Gourvès,Adria Lyra,Carlos A. J. Martinhon,Jérôme Monnot
#t2010
#cDiscrete Applied Mathematics
#index2857110
#%481413
#%838276
#%839017
#%1096371
#!
  
#*Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches.
#@Jyh-Jye Lin,Chi-Yuan Chan,Biing-Feng Wang
#t2010
#cDiscrete Applied Mathematics
#index2857019
#%610534
#%837043
#%837595
#%932358
#%949788
#%950099
#%951301
#%951147
#%971555
#%1089228
#!
  
#*Independence polynomials of k-tree related graphs.
#@Lanzhen Song,William Staton,Bing Wei
#t2010
#cDiscrete Applied Mathematics
#index2857037
#%854797
#%978733
#!
  
#*3-symmetric and 3-decomposable geometric drawings of K.
#@Bernardo M. Ábrego,M. Cetina,Silvia Fernández-Merchant,Jesús Leaños,Gelasio Salazar
#t2010
#cDiscrete Applied Mathematics
#index2857081
#% 
#!
  
#*The induced path function, monotonicity and betweenness.
#@Manoj Changat,Joseph Mathews,Henry Martyn Mulder
#t2010
#cDiscrete Applied Mathematics
#index2857030
#%853980
#%975416
#%1060536
#%1061268
#%2858773
#!
  
#*Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices.
#@Xiande Zhang,Gennian Ge
#t2010
#cDiscrete Applied Mathematics
#index2857049
#%949590
#%976222
#%1024776
#%1089319
#!
  
#*Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.
#@Guillermo Durán,Thomas M. Liebling,Martín Matamala,Jayme Luiz Szwarcfiter
#t2010
#cDiscrete Applied Mathematics
#index2857087
#% 
#!
  
#*A forbidden subgraph characterization of line-polar bipartite graphs.
#@Jing Huang,Baogang Xu
#t2010
#cDiscrete Applied Mathematics
#index2857006
#%838884
#%838920
#%1191212
#%1265299
#!
  
#*Backbone colorings of graphs with bounded degree.
#@Jozef Miskuf,Riste Skrekovski,Martin Tancer
#t2010
#cDiscrete Applied Mathematics
#index2856968
#%854298
#%1144605
#%1341548
#!
  
#*Metric and ultrametric spaces of resistances.
#@Vladimir Gurvich
#t2010
#cDiscrete Applied Mathematics
#index2857121
#% 
#!
  
#*Disjoint dominating and total dominating sets in graphs.
#@Michael A. Henning,Christian Löwenstein,Dieter Rautenbach,Justin Southey
#t2010
#cDiscrete Applied Mathematics
#index2857063
#%1059159
#%2921393
#!
  
#*Real-time data gathering in sensor networks.
#@Yoram Revah,Michael Segal,Liron Yedidsion
#t2010
#cDiscrete Applied Mathematics
#index2856984
#%563979
#%584501
#%584412
#%679065
#%679009
#!
  
#*Dynamic programming and planarity: Improved tree-decomposition based algorithms.
#@Frederic Dorn
#t2010
#cDiscrete Applied Mathematics
#index2856965
#%186102
#%481074
#%493212
#%609887
#%610529
#%837785
#%924114
#%931034
#%972584
#%977717
#%1060536
#%1061056
#!
  
#*Greedy approaches for a class of nonlinear Generalized Assignment Problems.
#@Thomas C. Sharkey,H. Edwin Romeijn
#t2010
#cDiscrete Applied Mathematics
#index2857039
#%837971
#%839094
#%885508
#%1013590
#%1275081
#%1288596
#%1290018
#!
  
#*Finding monotone paths in edge-ordered graphs.
#@Ján Katrenic,Gabriel Semanisin
#t2010
#cDiscrete Applied Mathematics
#index2857074
#%2022
#%211560
#%611442
#%848842
#%861707
#%949588
#%952718
#!
  
#*Homomorphisms of 2-edge-colored graphs.
#@Amanda Montejano,Pascal Ochem,Alexandre Pinlou,André Raspaud,Eric Sopena
#t2010
#cDiscrete Applied Mathematics
#index2857080
#%836675
#%848968
#%933460
#%935107
#%977351
#!
  
#*Parallel cleaning of a network with brushes.
#@Serge Gaspers,Margaret-Ellen Messinger,Richard J. Nowakowski,Pawel Pralat
#t2010
#cDiscrete Applied Mathematics
#index2857054
#%951151
#%1089417
#%1096104
#%1276052
#%1341678
#!
  
#*A tournament of order 14 with disjoint Banks and Slater sets.
#@Patric R. J. Östergård,Vesa P. Vaskelainen
#t2010
#cDiscrete Applied Mathematics
#index2857004
#%12358
#%831274
#%838423
#%1060995
#!
  
#*The polynomial dichotomy for three nonempty part sandwich problems.
#@Rafael B. Teixeira,Simone Dantas,Celina M. Herrera de Figueiredo
#t2010
#cDiscrete Applied Mathematics
#index2857082
#%481202
#%610145
#%836174
#%836572
#%836768
#%930352
#%953010
#%952930
#!
  
#*The t-discrepancy of a poset.
#@David Howard,Ann N. Trenk
#t2010
#cDiscrete Applied Mathematics
#index2857066
#%1061391
#!
  
#*On end-vertices of Lexicographic Breadth First Searches.
#@Derek G. Corneil,Ekkehard Köhler,Jean-Marc Lanlignel
#t2010
#cDiscrete Applied Mathematics
#index2857011
#%85882
#%660546
#%836508
#%852117
#%1058966
#%1061595
#%1091696
#%1341542
#!
  
#*Polynomial kernels for 3-leaf power graph modification problems.
#@Stéphane Bessy,Christophe Paul,Anthony Perez
#t2010
#cDiscrete Applied Mathematics
#index2857118
#%269362
#%269370
#%654424
#%661048
#%838073
#%838998
#%930182
#%953170
#%953423
#%1013773
#%1015519
#%1062115
#%1077403
#%1340705
#!
  
#*Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987]
#@Stephan Dominique Andres
#t2010
#cDiscrete Applied Mathematics
#index2857057
#%1270364
#!
  
#*A bound on the treewidth of planar even-hole-free graphs.
#@Ana Silva,Aline Alves da Silva,Cláudia Linhares Sales
#t2010
#cDiscrete Applied Mathematics
#index2857071
#%977725
#%977724
#!
  
#*Bounds for visual cryptography schemes.
#@Hossein Hajiabolhassan,Abbas Cheraghi
#t2010
#cDiscrete Applied Mathematics
#index2857051
#%610907
#%616624
#%831055
#%842483
#%861800
#%887031
#%977268
#%1061050
#%1095459
#%3142735
#%3480222
#!
  
#*Variance of the subgraph count for sparse Erdos-Rényi graphs.
#@Robert B. Ellis,James P. Ferry
#t2010
#cDiscrete Applied Mathematics
#index2856998
#% 
#!
  
#*The lattice of embedded subsets.
#@Michel Grabisch
#t2010
#cDiscrete Applied Mathematics
#index2857020
#%828999
#!
  
#*Recognizing line-polar bipartite graphs in time O(n).
#@Tinaz Ekim,Jing Huang
#t2010
#cDiscrete Applied Mathematics
#index2857079
#%838884
#%838920
#%1191212
#%1265299
#%2857006
#!
  
#*'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders.
#@Moshe Dror,George Steiner
#t2010
#cDiscrete Applied Mathematics
#index2857109
#%770378
#%812840
#%837440
#%887744
#%930919
#%950387
#%1054523
#!
  
#*On shortest crucial words avoiding abelian powers.
#@Sergey V. Avgustinovich,Amy Glen,Bjarni V. Halldórsson,Sergey Kitaev
#t2010
#cDiscrete Applied Mathematics
#index2857026
#%975545
#%1207031
#!
  
#*Szeged index, edge Szeged index, and semi-star trees.
#@Ardeshir Dolati,Imaneh Motevalian,Akram Ehyaee
#t2010
#cDiscrete Applied Mathematics
#index2857017
#%1270267
#!
  
#*Equitable colorings of Kronecker products of graphs.
#@Wu-Hsiung Lin,Gerard J. Chang
#t2010
#cDiscrete Applied Mathematics
#index2857088
#%557708
#%610779
#%851139
#%854096
#%864297
#%975067
#%979265
#%1052085
#%1089092
#%1144519
#%3480200
#!
  
#*Maintaining dynamic minimum spanning trees: An experimental study.
#@Giuseppe Cattaneo,Pompeo Faruolo,Umberto Ferraro Petrillo,Giuseppe F. Italiano
#t2010
#cDiscrete Applied Mathematics
#index2857031
#%525
#%38747
#%186092
#%210911
#%211160
#%924326
#%950140
#%950693
#%950651
#%951628
#%952895
#%971798
#%972397
#%972981
#%980001
#%979979
#%979920
#%1059122
#%1059550
#%1077237
#%1077290
#!
  
#*Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs.
#@Hortensia Galeana-Sánchez,Bernardo Llano,Juan José Montellano-Ballesteros
#t2010
#cDiscrete Applied Mathematics
#index2857040
#%854254
#!
  
#*On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.
#@Liliana Alcón,Luerbio Faria,C. M. H. de Figueiredo,M. Gutierrez
#t2010
#cDiscrete Applied Mathematics
#index2856962
#%92852
#%209945
#%268601
#!
  
#*Complexity of the packing coloring problem for trees.
#@Jirí Fiala,Petr A. Golovach
#t2010
#cDiscrete Applied Mathematics
#index2857028
#%493212
#%838679
#%952621
#%1191097
#!
  
#*The existence and upper bound for two types of restricted connectivity.
#@Qinghai Liu,Zhao Zhang
#t2010
#cDiscrete Applied Mathematics
#index2857005
#%837660
#%838869
#%854207
#%854868
#%864542
#%931653
#%1270321
#!
  
#*Finding the maximum and minimum elements with one lie.
#@Dániel Gerbner,Dömötör Pálvölgyi,Balázs Patkós,Gábor Wiener
#t2010
#cDiscrete Applied Mathematics
#index2856983
#%775129
#%835890
#%1093958
#!
  
#*Tighter bounds of the First Fit algorithm for the bin-packing problem.
#@Binzhou Xia,Zhiyi Tan
#t2010
#cDiscrete Applied Mathematics
#index2857108
#% 
#!
  
#*Integrated production and delivery scheduling with disjoint windows.
#@Yumei Huo,Joseph Y.-T. Leung,Xin Wang
#t2010
#cDiscrete Applied Mathematics
#index2856976
#%1054507
#%1290051
#!
  
#*A cops and robber game in multidimensional grids.
#@Sayan Bhattacharya,Goutam Paul,Swagato Sanyal
#t2010
#cDiscrete Applied Mathematics
#index2857090
#%624364
#%838799
#%851979
#%930799
#%933111
#%976458
#%1061827
#!
  
#*Bounds on the connected k-domination number in graphs.
#@Adriana Hansberg
#t2010
#cDiscrete Applied Mathematics
#index2857097
#%830787
#!
  
#*Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity.
#@Panagiotis Rizomiliotis
#t2010
#cDiscrete Applied Mathematics
#index2919132
#%484
#%192876
#!
  
#*Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912].
#@Jack Brimberg,Henrik Juel,Anita Schöbel
#t2010
#cDiscrete Applied Mathematics
#index2919145
#% 
#!
  
#*Improved induced matchings in sparse graphs.
#@Rok Erman,Lukasz Kowalik,Matjaz Krnc,Tomasz Walen
#t2010
#cDiscrete Applied Mathematics
#index2919138
#%210446
#%623296
#%949686
#%1060735
#%1270140
#%1277536
#%3480163
#!
  
#*Small alliances in a weighted graph.
#@Kenji Kimura,Masayuki Koyama,Akira Saito
#t2010
#cDiscrete Applied Mathematics
#index2919139
#% 
#!
  
#*On mean distance and girth.
#@Siham Bekkai,Mekkia Kouider
#t2010
#cDiscrete Applied Mathematics
#index2919122
#%836565
#%846933
#%847194
#%851731
#!
  
#*Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices.
#@Qin Zhao,Shuchao Li
#t2010
#cDiscrete Applied Mathematics
#index2919140
#%837538
#%851954
#%3480249
#!
  
#*Covering line graphs with equivalence relations.
#@Louis Esperet,John Gimbel,Andrew King
#t2010
#cDiscrete Applied Mathematics
#index2919131
#%797841
#%930075
#!
  
#*Generalized sequences and k-independent sets in graphs.
#@Iwona Wloch,Andrzej Wloch
#t2010
#cDiscrete Applied Mathematics
#index2919127
#% 
#!
  
#*Approximating maximum edge 2-coloring in simple graphs.
#@Zhi-Zhong Chen,Sayuri Konno,Yuki Matsushita
#t2010
#cDiscrete Applied Mathematics
#index2919137
#%1343008
#%979687
#%46582
#%622067
#%953179
#%3480301
#%1336390
#!
  
#*Total choosability of planar graphs with maximum degree 4.
#@Nicolas Roussel
#t2011
#cDiscrete Applied Mathematics
#index2919146
#%281025
#%831033
#%852402
#%974774
#%1144488
#%2923717
#!
  
#*Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms.
#@B. S. Panda,Anita Das
#t2010
#cDiscrete Applied Mathematics
#index2919128
#%544376
#%836744
#%842963
#%853967
#%889654
#%932736
#%952771
#%1024818
#%1061140
#%1089657
#%1270223
#!
  
#*Reoptimizing the 0-1 knapsack problem.
#@Claudia Archetti,Luca Bertazzi,Maria Grazia Speranza
#t2010
#cDiscrete Applied Mathematics
#index2919133
#%612277
#%838020
#%950753
#%951513
#!
  
#*A generic approach to proving NP-hardness of partition type problems.
#@Mikhail Y. Kovalyov,Erwin Pesch
#t2010
#cDiscrete Applied Mathematics
#index2919144
#%837308
#%923359
#!
  
#*On the revised Szeged index.
#@Rundan Xing,Bo Zhou
#t2011
#cDiscrete Applied Mathematics
#index2919154
#%1270267
#%2858894
#%2919130
#!
  
#*An efficient algorithm for computing the distance between close partitions.
#@Daniel Cosmin Porumbel,Jin-Kao Hao,Pascale Kuntz
#t2011
#cDiscrete Applied Mathematics
#index2919151
#%438901
#%764569
#%934928
#%1053318
#!
  
#*Enumeration of polyominoes inscribed in a rectangle.
#@Alain Goupil,Hugo Cloutier,Fathallah Nouboud
#t2010
#cDiscrete Applied Mathematics
#index2919134
#% 
#!
  
#*Matchability and k-maximal matchings.
#@Brian C. Dean,Sandra Mitchell Hedetniemi,Stephen T. Hedetniemi,Jason Lewis,Alice A. McRae
#t2011
#cDiscrete Applied Mathematics
#index2919153
#%851124
#%931152
#%952663
#%1013521
#%1058908
#!
  
#*Exact values of ex(nu;{C, C, ..., C}).
#@E. Abajo,Ana Diánez
#t2010
#cDiscrete Applied Mathematics
#index2919125
#% 
#!
  
#*Independence in connected graphs.
#@Jochen Harant,Dieter Rautenbach
#t2011
#cDiscrete Applied Mathematics
#index2919152
#%837588
#!
  
#*Facet-inducing web and antiweb inequalities for the graph coloring polytope.
#@Gintaras Palubeckis
#t2010
#cDiscrete Applied Mathematics
#index2919120
#%798759
#%836271
#%837860
#%838787
#%865160
#%907189
#%1013694
#%1014540
#%1061189
#%2857099
#!
  
#*Dynamic list coloring of bipartite graphs.
#@Louis Esperet
#t2010
#cDiscrete Applied Mathematics
#index2919142
#%1270340
#!
  
#*Hamiltonicity of 6-connected line graphs.
#@Mingquan Zhan
#t2010
#cDiscrete Applied Mathematics
#index2919143
#%852906
#%854349
#%977790
#%978717
#%1144381
#%1270138
#!
  
#*On the Boolean connectivity problem for Horn relations.
#@Kazuhisa Makino,Suguru Tamaki,Masaki Yamamoto
#t2010
#cDiscrete Applied Mathematics
#index2919123
#%13443
#%204233
#%415677
#%621145
#%623072
#%744723
#%744756
#%745214
#%745223
#%745224
#%821095
#%836684
#%887563
#%888523
#%930284
#%949902
#%949955
#%951052
#%952190
#%952955
#%971768
#%1058692
#%1059760
#%1059742
#%1060809
#%1060926
#!
  
#*Oriented matroid systems.
#@Arne Bang Huseby
#t2011
#cDiscrete Applied Mathematics
#index2919149
#%838459
#!
  
#*Which generalized Randic indices are suitable measures of molecular branching?
#@Damir Vukicevic
#t2010
#cDiscrete Applied Mathematics
#index2919126
#% 
#!
  
#*DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs.
#@Michel Minoux,Hacene Ouzia
#t2010
#cDiscrete Applied Mathematics
#index2919156
#%406882
#%838097
#%885431
#%1013315
#%1013365
#%1013437
#%1014057
#%1014534
#!
  
#*The p-maxian problem on interval graphs.
#@Yukun Cheng,Liying Kang
#t2010
#cDiscrete Applied Mathematics
#index2919135
#%814591
#%934818
#%950957
#%1054480
#%1061836
#!
  
#*Connectivity of iterated line graphs.
#@Yehong Shao
#t2010
#cDiscrete Applied Mathematics
#index2919141
#%837331
#!
  
#*On the existence problem of the total domination vertex critical graphs.
#@Moo Young Sohn,Dongseok Kim,Young Soo Kwon,Jaeun Lee
#t2011
#cDiscrete Applied Mathematics
#index2919150
#%1270191
#!
  
#*Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem.
#@Flavio Guiñez,Martín Matamala,Stéphan Thomassé
#t2011
#cDiscrete Applied Mathematics
#index2919155
#%836513
#%836514
#%1090176
#!
  
#*Adjacency matrices of probe interval graphs.
#@Shamik Ghosh,Maitry Podder,Malay K. Sen
#t2010
#cDiscrete Applied Mathematics
#index2919121
#%610809
#%611109
#%660694
#%836957
#%837741
#%837644
#%852277
#%853984
#%1061985
#%1144530
#!
  
#*Matching preclusion for k-ary n-cubes.
#@Shiying Wang,Ruixia Wang,Shangwei Lin,Jing Li
#t2010
#cDiscrete Applied Mathematics
#index2919136
#%1024756
#%1078333
#%1227610
#%1276604
#%1276680
#!
  
#*Maximal pivots on graphs with an application to gene assembly.
#@Robert Brijder,Hendrik Jan Hoogeboom
#t2010
#cDiscrete Applied Mathematics
#index2919124
#%741661
#%838868
#%1090791
#%1014698
#%975819
#!
  
#*Lit-only sigma-game on pseudo-trees.
#@Xinmao Wang,Yaokun Wu
#t2010
#cDiscrete Applied Mathematics
#index2919129
#% 
#!
  
#*On the expressive power of CNF formulas of bounded tree- and clique-width.
#@Irénée Briquel,Pascal Koiran,Klaus Meer
#t2011
#cDiscrete Applied Mathematics
#index2919147
#%416145
#%487424
#%623312
#%660716
#%661044
#%820710
#%836521
#%838739
#%950790
#%1058652
#!
  
#*On the b-coloring of P-tidy graphs.
#@Clara Inés Betancur Velasquez,Flavia Bonomo,Ivo Koch
#t2011
#cDiscrete Applied Mathematics
#index2919148
#% 
#!
  
#*Use of the Szeged index and the revised Szeged index for measuring network bipartivity.
#@Tomaz Pisanski,Milan Randic
#t2010
#cDiscrete Applied Mathematics
#index2919130
#%838597
#!
  
#*A General Label Search to investigate classical graph search algorithms.
#@Richard Krueger,Geneviève Simonet,Anne Berry
#t2011
#cDiscrete Applied Mathematics
#index2967280
#%852117
#%1060536
#%1091696
#%1341536
#%1341542
#!
  
#*Partitioning a graph into offensive k-alliances.
#@Jose Maria Sigarreta,Ismael Gónzalez Yero,Sergio Bermudo,Juan Alberto Rodríguez-Velazquez
#t2011
#cDiscrete Applied Mathematics
#index2967281
#%839071
#%839074
#%1270224
#!
  
#*Superconnectivity of graphs with odd girth g and even girth h.
#@Camino Balbuena,Pedro García-Vázquez,Luis Pedro Montejano
#t2011
#cDiscrete Applied Mathematics
#index2967268
#%850616
#%851838
#%975783
#%1079783
#%1144598
#%1270144
#%2856971
#!
  
#*Improper C-colorings of graphs.
#@Csilla Bujtás,E. Sampathkumar,Zsolt Tuza,L. Pushpa Latha,R. C. Vasundhara
#t2011
#cDiscrete Applied Mathematics
#index2967279
#%838610
#%1090899
#%1096280
#%2872627
#!
  
#*Total coloring of planar graphs without 6-cycles.
#@Jianfeng Hou,Bin Liu,Guizhen Liu,Jianliang Wu
#t2011
#cDiscrete Applied Mathematics
#index2967274
#%851317
#%852402
#%864200
#%935099
#%1144488
#%2921467
#%2921530
#!
  
#*Asymptotics of the convex hull of spherically symmetric samples.
#@Enkelejd Hashorva
#t2011
#cDiscrete Applied Mathematics
#index2967265
#%839138
#%843138
#!
  
#*Packing 3-vertex paths in claw-free graphs and related topics.
#@Alexander K. Kelmans
#t2011
#cDiscrete Applied Mathematics
#index2967278
#%852159
#%976526
#%976968
#%1059070
#%1144561
#%3480372
#!
  
#*Characterization and recognition of P-sparse graphs partitionable into k independent sets and cliques.
#@Raquel S. F. Bravo,Sulamita Klein,Loana Tito Nogueira,Fábio Protti
#t2011
#cDiscrete Applied Mathematics
#index2967273
#% 
#!
  
#*On the dynamic coloring of graphs.
#@Meysam Alishahi
#t2011
#cDiscrete Applied Mathematics
#index2967277
#%1270340
#%2919142
#!
  
#*Sharp bounds of the zeroth-order general Randic index of bicyclic graphs with given pendent vertices.
#@Xiang-Feng Pan,Ning-Ning Lv
#t2011
#cDiscrete Applied Mathematics
#index2967266
#% 
#!
  
#*Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements.
#@Shangwei Lin,Shiying Wang,Chunfang Li
#t2011
#cDiscrete Applied Mathematics
#index2967272
#%341943
#%835845
#%838539
#%838893
#%988878
#%990271
#%990224
#%1060613
#%1079760
#%1095648
#%1124898
#%1124966
#%1125445
#%1125588
#%1126304
#%1276683
#!
  
#*A note on the complexity of flow-shop scheduling with deteriorating jobs.
#@Karin Thörnblad,Michael Patriksson
#t2011
#cDiscrete Applied Mathematics
#index2967276
#% 
#!
  
#*Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable.
#@Yingqian Wang,Qian Wu,Liang Shen
#t2011
#cDiscrete Applied Mathematics
#index2967271
#%853828
#%934704
#%934920
#%934967
#%978236
#%978240
#!
  
#*Total domination dot-critical graphs.
#@Michael A. Henning,Nader Jafari Rad
#t2011
#cDiscrete Applied Mathematics
#index2967275
#%847327
#%1270191
#%1270143
#%1336365
#%2921549
#!
  
#*On the approximability of the minimum strictly fundamental cycle basis problem.
#@Giulia Galbiati,Romeo Rizzi,Edoardo Amaldi
#t2011
#cDiscrete Applied Mathematics
#index2967269
#%621917
#%750971
#%818074
#%838554
#%1059545
#%1060654
#%1088756
#%2871132
#!
  
#*Lower bounds on the independence number of certain graphs of odd girth at least seven.
#@Anders Sune Pedersen,Dieter Rautenbach,Friedrich Regen
#t2011
#cDiscrete Applied Mathematics
#index2967264
#%847851
#%979102
#!
  
#*Hamiltonian index is NP-complete.
#@Zdenek Ryjácek,Gerhard J. Woeginger,Liming Xiong
#t2011
#cDiscrete Applied Mathematics
#index2967270
#%849262
#!
  
#*The (1, 2)-step competition graph of a tournament.
#@Kim A. S. Factor,Sarah K. Merz
#t2011
#cDiscrete Applied Mathematics
#index2967267
#%839029
#!
  
#*On the affine Sylvester problem.
#@Jonathan Lenchner
#t2011
#cDiscrete Applied Mathematics
#index3066811
#%844162
#!
  
#*Valuations and closure operators on finite lattices.
#@Léonard Kwuida,Stefan E. Schmidt
#t2011
#cDiscrete Applied Mathematics
#index3066796
#% 
#!
  
#*Supereulerian graphs in the graph family C(6, k).
#@Hong-Jian Lai,Yanting Liang
#t2011
#cDiscrete Applied Mathematics
#index3066772
#% 
#!
  
#*On n-facility median problem with facilities subject to failure facing uniform demand.
#@Oded Berman,Dmitry Krass
#t2011
#cDiscrete Applied Mathematics
#index3066783
#%1288546
#!
  
#*The L(2, 1)-labeling of unigraphs.
#@Tiziana Calamoneri,Rossella Petreschi
#t2011
#cDiscrete Applied Mathematics
#index3066858
#%619997
#%660620
#%686093
#%849046
#%1061170
#%1061419
#%1061777
#%1270390
#!
  
#*Bounding the feedback vertex number of digraphs in terms of vertex degrees.
#@Hermann Gruber
#t2011
#cDiscrete Applied Mathematics
#index3066824
#%974994
#%837959
#!
  
#*On perfect hashing of numbers with sparse digit representation via multiplication by a constant.
#@Maurizio Monge
#t2011
#cDiscrete Applied Mathematics
#index3066838
#%104698
#%186458
#%494717
#%611321
#%611314
#%622708
#%623064
#!
  
#*Learning random monotone DNF.
#@Jeffrey C. Jackson,Homin K. Lee,Rocco A. Servedio,Andrew Wan
#t2011
#cDiscrete Applied Mathematics
#index3066781
#% 
#!
  
#*A new imputation method for incomplete binary data.
#@Munevver Mine Subasi,Ersoy Subasi,Martin Anthony,Peter L. Hammer
#t2011
#cDiscrete Applied Mathematics
#index3066759
#% 
#!
  
#*Facility location problems: A parameterized view.
#@Michael R. Fellows,Henning Fernau
#t2011
#cDiscrete Applied Mathematics
#index3066802
#%17168
#%465804
#%598708
#%610186
#%611376
#%623147
#%623455
#%839612
#%862275
#%953021
#%971668
#%1209565
#%1338606
#%2868680
#%3112095
#!
  
#*A revision and extension of results on 4-regular, 4-connected, claw-free graphs.
#@Trevor J. Gionet Jr.,Erika L. C. King,Yixiao Sha
#t2011
#cDiscrete Applied Mathematics
#index3066856
#%837084
#!
  
#*An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays.
#@Géraldine Heilporn,Jean-François Cordeau,Gilbert Laporte
#t2011
#cDiscrete Applied Mathematics
#index3066771
#%815069
#%1024805
#%1288383
#%1288496
#%1289681
#!
  
#*Messy broadcasting - Decentralized broadcast schemes with limited knowledge.
#@Hovhannes A. Harutyunyan,Pavol Hell,Arthur L. Liestman
#t2011
#cDiscrete Applied Mathematics
#index3066778
#% 
#!
  
#*Q-ary Rényi-Ulam pathological liar game with one lie.
#@Kun Meng,Chuang Lin,Wen An Liu,Yang Yang
#t2011
#cDiscrete Applied Mathematics
#index3066786
#% 
#!
  
#*Star-critical Ramsey numbers.
#@Jonelle Hook,Garth Isaak
#t2011
#cDiscrete Applied Mathematics
#index3066797
#% 
#!
  
#*The external constraint 4 nonempty part sandwich problem.
#@Rafael B. Teixeira,Simone Dantas,Celina M. Herrera de Figueiredo
#t2011
#cDiscrete Applied Mathematics
#index3066805
#%481202
#%798033
#%836572
#%836768
#%930352
#%953010
#%952930
#%1059709
#%1062055
#%1091066
#%3024867
#!
  
#*Optimization problems in multiple subtree graphs.
#@Danny Hermelin,Dror Rawitz
#t2011
#cDiscrete Applied Mathematics
#index3066801
#%609971
#%611454
#%750952
#%1058525
#%1059036
#!
  
#*On the Zagreb index inequality of graphs with prescribed vertex degrees.
#@Vesna Andova,Saso Bogoev,Darko Dimitrov,Marcin Pilipczuk,Riste Skrekovski
#t2011
#cDiscrete Applied Mathematics
#index3066815
#%847194
#%1270290
#!
  
#*Deterministic symmetric rendezvous with tokens in a synchronous torus.
#@Evangelos Kranakis,Danny Krizanc,Euripides Markou
#t2011
#cDiscrete Applied Mathematics
#index3066837
#%269175
#%297198
#%612290
#%1093338
#%1289487
#%1289867
#%1289966
#%1290165
#!
  
#*On distance-3 matchings and induced matchings.
#@Andreas Brandstädt,Raffaele Mosca
#t2011
#cDiscrete Applied Mathematics
#index3066812
#%750939
#%836172
#%836378
#%836956
#%836958
#%847188
#%851104
#%851309
#%851455
#%853802
#%953009
#%1025783
#%1058703
#%1061125
#%1061564
#%1095924
#%1270140
#%2868703
#!
  
#*Some special minimum k-geodetically connected graphs.
#@Yingjie Lan,Songqing Chen
#t2011
#cDiscrete Applied Mathematics
#index3066841
#% 
#!
  
#*Improved bounds for acyclic chromatic index of planar graphs.
#@Jianfeng Hou,Guizhen Liu,Guanghui Wang
#t2011
#cDiscrete Applied Mathematics
#index3066816
#%17100
#%622762
#%933907
#%935134
#%1051754
#%1144576
#%1343069
#%2872679
#%2872615
#%3480347
#!
  
#*Acyclic chromatic indices of planar graphs with large girth.
#@Weifan Wang,Qiaojun Shu,Kan Wang,Ping Wang
#t2011
#cDiscrete Applied Mathematics
#index3066861
#%17100
#%622762
#%933907
#%935134
#%1051754
#%3480347
#!
  
#*On basic forbidden patterns of functions.
#@Sergi Elizalde,Yangyang Liu
#t2011
#cDiscrete Applied Mathematics
#index3066864
#%979289
#%1341560
#!
  
#*On the behavior of the N-operator under blocker duality.
#@Silvia M. Bianchi,Mariana S. Escalante,Graciela L. Nasini
#t2011
#cDiscrete Applied Mathematics
#index3066794
#% 
#!
  
#*Upper bounds on the signed total domatic number of graphs.
#@Lutz Volkmann
#t2011
#cDiscrete Applied Mathematics
#index3066804
#%838281
#%1270219
#!
  
#*Global secure sets of grid-like graphs.
#@Yiu Yu Ho,Ronald D. Dutton
#t2011
#cDiscrete Applied Mathematics
#index3066753
#%838567
#%838810
#%1270359
#!
  
#*Self-inverse Sheffer sequences and Riordan involutions.
#@Ana Luzón,Manuel A. Morón
#t2011
#cDiscrete Applied Mathematics
#index3066860
#%838582
#%838883
#%839200
#%854414
#!
  
#*Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.
#@Gerard Jennhwa Chang,Jianfeng Hou,Nicolas Roussel
#t2011
#cDiscrete Applied Mathematics
#index3066813
#%852402
#%1144488
#%1341525
#%2862095
#%2921467
#!
  
#*On the complexity of the dominating induced matching problem in hereditary classes of graphs.
#@Domingos Moreira Cardoso,Nicholas Korpelainen,Vadim V. Lozin
#t2011
#cDiscrete Applied Mathematics
#index3066834
#%415126
#%835918
#%836378
#%836956
#%836958
#%837591
#%837589
#%839000
#%847188
#%854441
#%931480
#%932664
#%1095736
#%1095912
#%1238332
#!
  
#*Distributed computation of virtual coordinates for greedy routing in sensor networks.
#@Mirela Ben-Chen,Steven J. Gortler,Craig Gotsman,Camille Wormser
#t2011
#cDiscrete Applied Mathematics
#index3066760
#%111597
#%212217
#%225265
#%611514
#%611572
#%803621
#%1058477
#%1119244
#%1119534
#%1141106
#%1338847
#%2801692
#!
  
#*2-extendability and k-resonance of non-bipartite Klein-bottle polyhexes.
#@Qiuli Li,Saihua Liu,Heping Zhang
#t2011
#cDiscrete Applied Mathematics
#index3066770
#%839045
#%975334
#%1341637
#%2857101
#!
  
#*A new time-discretization for delay multiple-input nonlinear systems using the Taylor method and first order hold.
#@Yuanliang Zhang,Olga Kostyukova,Kil To Chong
#t2011
#cDiscrete Applied Mathematics
#index3066798
#% 
#!
  
#*Transitive orientations in bull-reducible Berge graphs.
#@Celina M. Herrera de Figueiredo,Frédéric Maffray,Cláudia Villela Maciel
#t2011
#cDiscrete Applied Mathematics
#index3066761
#%269362
#%798033
#%837151
#%851455
#%952833
#%1061323
#%1077341
#!
  
#*Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree.
#@Yuichi Asahiro,Eiji Miyano,Hirotaka Ono
#t2011
#cDiscrete Applied Mathematics
#index3066817
#%17162
#%79058
#%494873
#%622081
#%651177
#%838246
#%932207
#%950704
#%1013938
#%1058651
#!
  
#*The C-extended graft construction.
#@Gary MacGillivray,Jacobus Swarts
#t2011
#cDiscrete Applied Mathematics
#index3066855
#% 
#!
  
#*Separator orders in interval, cocomparability, and AT-free graphs.
#@Jonathan Backer
#t2011
#cDiscrete Applied Mathematics
#index3066823
#%268840
#%415310
#%836101
#%837719
#%837785
#%931034
#%1058966
#%1059793
#%1061125
#%1061230
#!
  
#*Minimum average congestion of enhanced and augmented hypercubes into complete binary trees.
#@Paul Manuel
#t2011
#cDiscrete Applied Mathematics
#index3066792
#% 
#!
  
#*Unique intersectability of diamond-free graphs.
#@Jun-Lin Guo,Tao-Ming Wang,Yue-Li Wang
#t2011
#cDiscrete Applied Mathematics
#index3066822
#%773461
#%851585
#!
  
#*On exact blockers and anti-blockers, Δ-conjecture, and related problems.
#@Vladimir Gurvich
#t2011
#cDiscrete Applied Mathematics
#index3066785
#% 
#!
  
#*On the complexity of enumerating pseudo-intents.
#@Felix Distel,Baris Sertkaya
#t2011
#cDiscrete Applied Mathematics
#index3066795
#%309447
#%309403
#%309497
#%309498
#%415677
#%469050
#%545113
#%621914
#%751986
#%817943
#%838946
#%838948
#%852893
#%931986
#%952955
#%1059107
#%1059106
#%1061507
#!
  
#*A lower bound on independence in terms of degrees.
#@Jochen Harant
#t2011
#cDiscrete Applied Mathematics
#index3066846
#% 
#!
  
#*On the distance distribution of trees.
#@Peter Dankelmann
#t2011
#cDiscrete Applied Mathematics
#index3066849
#% 
#!
  
#*Graphs with given number of cut vertices and extremal Merrifield-Simmons index.
#@Hongbo Hua,Shenggui Zhang
#t2011
#cDiscrete Applied Mathematics
#index3066840
#% 
#!
  
#*Constrained k-center and movement to independence.
#@Adrian Dumitrescu,Minghui Jiang
#t2011
#cDiscrete Applied Mathematics
#index3066835
#%212138
#%621947
#%836762
#%953688
#%1082471
#%1227549
#!
  
#*The clustering coefficient of a scale-free random graph.
#@Nicole Eggemann,Steven D. Noble
#t2011
#cDiscrete Applied Mathematics
#index3066799
#% 
#!
  
#*The incidence game chromatic number of paths and subgraphs of wheels.
#@John Y. Kim
#t2011
#cDiscrete Applied Mathematics
#index3066832
#%849111
#%851725
#%852439
#%854696
#%976595
#%978610
#%979249
#%1270364
#!
  
#*Powers of cycles, powers of paths, and distance graphs.
#@Min Chih Lin,Dieter Rautenbach,Francisco J. Soulignac,Jayme Luiz Szwarcfiter
#t2011
#cDiscrete Applied Mathematics
#index3066765
#%836507
#%838277
#%851604
#%852593
#%864264
#%930689
#%931133
#%953009
#%988337
#%1059009
#%1061471
#!
  
#*Vertex splitting and the recognition of trapezoid graphs.
#@George B. Mertzios,Derek G. Corneil
#t2011
#cDiscrete Applied Mathematics
#index3066847
#%836404
#%836205
#%851455
#%953368
#%993684
#!
  
#*Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.
#@Ferdinando Cicalese,Travis Gagie,Eduardo Sany Laber,Martin Milanic
#t2011
#cDiscrete Applied Mathematics
#index3066754
#%744494
#%751382
#%971682
#%621732
#%610265
#%950383
#%622369
#%622414
#%853657
#%951216
#%211723
#%66522
#!
  
#*A class of graph-geodetic distances generalizing the shortest-path and the resistance distances.
#@Pavel Chebotarev
#t2011
#cDiscrete Applied Mathematics
#index3066779
#% 
#!
  
#*The Northwest corner rule revisited.
#@Bettina Klinz,Gerhard J. Woeginger
#t2011
#cDiscrete Applied Mathematics
#index3066854
#%124321
#%836303
#%3005546
#!
  
#*An s-t connection problem with adaptability.
#@David Adjiashvili,Rico Zenklusen
#t2011
#cDiscrete Applied Mathematics
#index3066807
#%186642
#%210459
#%407053
#%812795
#%1013338
#%3004144
#!
  
#*Minimum sum set coloring of trees and line graphs of trees.
#@Flavia Bonomo,Guillermo Durán,Javier Marenco,Mario Valencia-Pabon
#t2011
#cDiscrete Applied Mathematics
#index3066776
#% 
#!
  
#*Unique response Roman domination in graphs.
#@E. Ebrahimi Targhi,Nader Jafari Rad,Lutz Volkmann
#t2011
#cDiscrete Applied Mathematics
#index3066769
#%1341588
#!
  
#*On the λ-robustness of matrices over fuzzy algebra.
#@Ján Plávka,Peter Szabó
#t2011
#cDiscrete Applied Mathematics
#index3066787
#% 
#!
  
#*Total domination dot-stable graphs.
#@Stephanie A. Rickett,Teresa W. Haynes
#t2011
#cDiscrete Applied Mathematics
#index3066843
#% 
#!
  
#*The folk solution and Boruvka's algorithm in minimum cost spanning tree problems.
#@Gustavo Bergantiños,Juan J. Vidal-Puga
#t2011
#cDiscrete Applied Mathematics
#index3066852
#% 
#!
  
#*Fractional weak discrepancy and split semiorders.
#@Alan Shuchat,Randy Shull,Ann N. Trenk
#t2011
#cDiscrete Applied Mathematics
#index3066833
#%838691
#%851696
#%1061391
#%1270142
#!
  
#*Degree distance of unicyclic and bicyclic graphs.
#@Aleksandar Ilic,Dragan Stevanovic,Lihua Feng,Guihai Yu,Peter Dankelmann
#t2011
#cDiscrete Applied Mathematics
#index3066806
#%838766
#%839008
#%1270338
#!
  
#*First-Fit coloring of bounded tolerance graphs.
#@Hal A. Kierstead,Karin R. Saoub
#t2011
#cDiscrete Applied Mathematics
#index3066829
#%611196
#%852883
#%853908
#%1061515
#%1061519
#!
  
#*A study of 3-arc graphs.
#@Martin Knor,Guangjun Xu,Sanming Zhou
#t2011
#cDiscrete Applied Mathematics
#index3066777
#% 
#!
  
#*Circular vertex arboricity.
#@Guanghui Wang,Shan Zhou,Guizhen Liu,Jianliang Wu
#t2011
#cDiscrete Applied Mathematics
#index3066857
#%702139
#%797884
#%849138
#%853849
#%865435
#%974773
#%3480231
#!
  
#*Triangular line graphs and word sense disambiguation.
#@Pranav Anand,Henry Escuadro,Ralucca Gera,Craig Martell
#t2011
#cDiscrete Applied Mathematics
#index3066842
#%775660
#%797400
#%852364
#!
  
#*Recolouring-resistant colourings.
#@Anders Sune Pedersen,Dieter Rautenbach
#t2011
#cDiscrete Applied Mathematics
#index3066768
#% 
#!
  
#*Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
#@Nicola Apollonio,Massimiliano Caramia
#t2011
#cDiscrete Applied Mathematics
#index3066755
#%837016
#%837909
#%838140
#%977271
#%1024913
#!
  
#*Bounds on the locating-total domination number of a tree.
#@Xue-Gang Chen,Moo Young Sohn
#t2011
#cDiscrete Applied Mathematics
#index3066828
#% 
#!
  
#*Foreword.
#@Marina Lipshteyn,Ross M. McConnell,Haim Kaplan,Vadim E. Levit
#t2011
#cDiscrete Applied Mathematics
#index3066830
#% 
#!
  
#*Weak sense of direction labelings and graph embeddings.
#@Christine T. Cheng,Ichiro Suzuki
#t2011
#cDiscrete Applied Mathematics
#index3066782
#% 
#!
  
#*Untangling planar graphs from a specified vertex position - Hard cases.
#@Mihyun Kang,Oleg Pikhurko,Alexander Ravsky,Mathias Schacht,Oleg Verbitsky
#t2011
#cDiscrete Applied Mathematics
#index3066757
#%225293
#%611241
#%612325
#%820783
#%823670
#%974273
#%977469
#%1060695
#%1096065
#%1336538
#%1336577
#!
  
#*Laced Boolean functions and subset sum problems in finite fields.
#@David Canright,Sugata Gangopadhyay,Subhamoy Maitra,Pantelimon Stanica
#t2011
#cDiscrete Applied Mathematics
#index3066764
#%139082
#%934873
#%1058956
#%1060147
#%1095393
#!
  
#*An axiomatization of the median procedure on the n-cube.
#@Henry Martyn Mulder,Beth Novick
#t2011
#cDiscrete Applied Mathematics
#index3066767
#%837640
#%1336362
#!
  
#*Dichotomy for tree-structured trigraph list homomorphism problems.
#@Tomás Feder,Pavol Hell,David G. Schell,Juraj Stacho
#t2011
#cDiscrete Applied Mathematics
#index3066853
#%1062055
#%481202
#%1060815
#%3480154
#%1091066
#%610487
#%838419
#%1059157
#%837116
#!
  
#*Orientable edge colorings of graphs.
#@Robert E. Jamison
#t2011
#cDiscrete Applied Mathematics
#index3066763
#%73
#%883369
#%3480268
#!
  
#*Occurrence of structured motifs in random sequences: Arbitrary number of boxes.
#@Valery T. Stefanov,Stéphane Robin,Sophie Schbath
#t2011
#cDiscrete Applied Mathematics
#index3066826
#%838573
#%838777
#!
  
#*A direct barter model for course add/drop process.
#@Ali Haydar Özer,Can Özturan
#t2011
#cDiscrete Applied Mathematics
#index3066809
#%530447
#%748623
#%751861
#%839227
#%950464
#%953002
#%1013107
#%1013105
#%1073067
#%3005546
#!
  
#*Tenacity of a graph with maximum connectivity.
#@Dara Moazzami
#t2011
#cDiscrete Applied Mathematics
#index3066793
#% 
#!
  
#*On a labeling problem in graphs.
#@R. Chandrasekaran,M. Dawande,Mehmet Baysan
#t2011
#cDiscrete Applied Mathematics
#index3066820
#%797806
#%1289119
#%1347891
#!
  
#*Complexity issues for the sandwich homogeneous set problem.
#@Arnaud Durand,Michel Habib
#t2011
#cDiscrete Applied Mathematics
#index3066819
#%494794
#%621793
#%750810
#%836768
#%861707
#%930152
#%930352
#%931138
#%931545
#%934083
#%949588
#%1096003
#!
  
#*Characterization of graphs and digraphs with small process numbers.
#@David Coudert,Jean-Sébastien Sereni
#t2011
#cDiscrete Applied Mathematics
#index3066756
#%2022
#%794456
#%837361
#%932186
#%951151
#%974671
#%977921
#%1058651
#%1096102
#%1121994
#%1122819
#!
  
#*On the suppression of variables in Boolean equations.
#@Frank Markham Brown
#t2011
#cDiscrete Applied Mathematics
#index3066784
#% 
#!
  
#*Any 2-asummable bipartite function is weighted threshold.
#@Javier Herranz
#t2011
#cDiscrete Applied Mathematics
#index3066845
#%210520
#%929875
#%933010
#!
  
#*Efficient synthesis of a class of Boolean programs from I-O data: Application to genetic networks.
#@Ruth Charney,Jacques Cohen,Aurélien Rizk
#t2011
#cDiscrete Applied Mathematics
#index3066774
#%546057
#%1088695
#!
  
#*The hyper-Wiener index of the generalized hierarchical product of graphs.
#@Mehdi Eliasi,Ali Iranmanesh
#t2011
#cDiscrete Applied Mathematics
#index3066818
#%836565
#%839092
#%854513
#%974308
#%1270170
#%2990183
#!
  
#*Combinatorics on update digraphs in Boolean networks.
#@Julio Aracena,Eric Fanchon,Marco Montalva,Mathilde Noual
#t2011
#cDiscrete Applied Mathematics
#index3066775
#%848596
#!
  
#*Necessary conditions for the existence of two classes of ZCPS-Wh(v).
#@R. Julian R. Abel,Ian Anderson,Norman J. Finizio
#t2011
#cDiscrete Applied Mathematics
#index3066831
#%836772
#!
  
#*On minimal Sturmian partial words.
#@Francine Blanchet-Sadri,John Lensmire
#t2011
#cDiscrete Applied Mathematics
#index3066827
#%1086955
#%3004189
#%1089338
#!
  
#*An extremal problem for total domination stable graphs upon edge removal.
#@Wyatt J. Desormeaux,Teresa W. Haynes,Michael A. Henning
#t2011
#cDiscrete Applied Mathematics
#index3066766
#% 
#!
  
#*Embedding processes in combinatorial game theory.
#@Carlos Pereira dos Santos
#t2011
#cDiscrete Applied Mathematics
#index3066808
#% 
#!
  
#*Weighted well-covered graphs without C, C, C, C.
#@Vadim E. Levit,David Tankus
#t2011
#cDiscrete Applied Mathematics
#index3066790
#% 
#!
  
#*Characterization and representation problems for intersection betweennesses.
#@Dieter Rautenbach,Vinícius Fernandes dos Santos,Philipp Matthias Schäfer,Jayme Luiz Szwarcfiter
#t2011
#cDiscrete Applied Mathematics
#index3066803
#% 
#!
  
#*Generalization of matching extensions in graphs (III).
#@Bing Bai,Hongliang Lu,Qinglin Yu
#t2011
#cDiscrete Applied Mathematics
#index3066810
#%838622
#%848382
#!
  
#*Minimum k-path vertex cover.
#@Bostjan Bresar,Frantisek Kardos,Ján Katrenic,Gabriel Semanisin
#t2011
#cDiscrete Applied Mathematics
#index3066863
#%2022
#%887537
#%847851
#%3083381
#%2851828
#!
  
#*Noisy colored point set matching.
#@Yago Diez,Joan Antoni Sellarès
#t2011
#cDiscrete Applied Mathematics
#index3066789
#%110569
#%111030
#%111002
#%233284
#%609880
#%769985
#%803610
#%803747
#%803804
#%824645
#%835904
#%842840
#%1038539
#!
  
#*On counting interval lengths of interval graphs.
#@Márcia R. Cerioli,Fabiano de S. Oliveira,Jayme Luiz Szwarcfiter
#t2011
#cDiscrete Applied Mathematics
#index3066762
#%611107
#%971578
#!
  
#*Best semi-online algorithms for unbounded parallel batch scheduling.
#@Jinjiang Yuan,C. T. Ng,T. C. Edwin Cheng
#t2011
#cDiscrete Applied Mathematics
#index3066821
#%406865
#%750547
#%1013093
#%1061506
#%1090072
#%1095575
#%1279059
#!
  
#*1-factor covers of regular graphs.
#@sarah-marie belcastro,Michael Young
#t2011
#cDiscrete Applied Mathematics
#index3066773
#% 
#!
  
#*Monadic second-order model-checking on decomposable matroids.
#@Yann Strozecki
#t2011
#cDiscrete Applied Mathematics
#index3066791
#% 
#!
  
#*Broadcasting secure messages via optimal independent spanning trees in folded hypercubes.
#@Jinn-Shyong Yang,Hung-Chang Chan,Jou-Ming Chang
#t2011
#cDiscrete Applied Mathematics
#index3066859
#%445682
#%837095
#%888339
#%931908
#%941553
#%942547
#%942988
#%952782
#%1035928
#%1058386
#%1058985
#%1079226
#%1079924
#%1080300
#%1096480
#%1096591
#%1124953
#%1126140
#%1276106
#%1324802
#%2862459
#%2862156
#%2869408
#%3079992
#%3081429
#!
  
#*Open neighborhood locating-dominating in trees.
#@Suk Jai Seo,Peter J. Slater
#t2011
#cDiscrete Applied Mathematics
#index3066780
#%837100
#%846967
#%848951
#%3612438
#!
  
#*Average distance and domination number revisited.
#@Dieter Rautenbach
#t2011
#cDiscrete Applied Mathematics
#index3066850
#%836566
#%1144686
#%1270155
#!
  
#*Local negative circuits and fixed points in non-expansive Boolean networks.
#@Adrien Richard
#t2011
#cDiscrete Applied Mathematics
#index3066758
#%838724
#!
  
#*Observable graphs.
#@Raphaël M. Jungers,Vincent D. Blondel
#t2011
#cDiscrete Applied Mathematics
#index3066844
#% 
#!
  
#*Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees.
#@Behrooz Alizadeh,Rainer E. Burkard
#t2011
#cDiscrete Applied Mathematics
#index3066814
#%1334153
#!
  
#*Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling.
#@Liron Yedidsion,Dvir Shabtay,Moshe Kaspi
#t2011
#cDiscrete Applied Mathematics
#index3066862
#%2616
#%809636
#%813461
#%813947
#%813945
#%814580
#%838384
#%838690
#%839420
#%934345
#%1054403
#%1054499
#%2885256
#%3349831
#!
  
#*Properties of optimal schedules in preemptive shop scheduling.
#@Philippe Baptiste,Jacques Carlier,Alexander Kononov,Maurice Queyranne,Sergey Sevastyanov,Maxim Sviridenko
#t2011
#cDiscrete Applied Mathematics
#index3066788
#% 
#!
  
#*A structural theorem for planar graphs with some applications.
#@Huiyu Sheng,Yingqian Wang
#t2011
#cDiscrete Applied Mathematics
#index3066839
#%935099
#%974774
#%1095474
#%2923717
#!
  
#*Erratum to: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution [Discrete Appl. Math. 157 (2009) 3133-3151].
#@Hande Yaman
#t2011
#cDiscrete Applied Mathematics
#index3066851
#% 
#!
  
#*On graphs without a C or a diamond.
#@Elaine M. Eschen,Chính T. Hoàng,Jeremy Spinrad,R. Sritharan
#t2011
#cDiscrete Applied Mathematics
#index3066836
#% 
#!
  
#*Equistable graphs, general partition graphs, triangle graphs, and graph products.
#@Stefko Miklavic,Martin Milanic
#t2011
#cDiscrete Applied Mathematics
#index3066848
#%837382
#%837818
#%838759
#%853633
#!
  
#*A theory of decomposition into prime factors of layered interconnection networks.
#@Azaria Paz
#t2011
#cDiscrete Applied Mathematics
#index3066825
#%28326
#%343608
#%839278
#%988439
#%1079784
#%1080457
#%1080404
#%1082713
#%1092771
#!
  
#*Identification in Z2 using Euclidean balls.
#@Ville Junnila,Tero Laihonen
#t2011
#cDiscrete Applied Mathematics
#index3066800
#% 
#!
  
#*Nested hierarchies in planar graphs.
#@Won-Min Song,Tiziana di Matteo,Tomaso Aste
#t2011
#cDiscrete Applied Mathematics
#index3160072
#% 
#!
  
#*Some properties for a class of interchange graphs.
#@Jingjing Jin
#t2011
#cDiscrete Applied Mathematics
#index3160134
#% 
#!
  
#*Hamiltonian cycles passing through linear forests in k-ary n-cubes.
#@Shiying Wang,Yuxing Yang,Jing Li,Shangwei Lin
#t2011
#cDiscrete Applied Mathematics
#index3160086
#%341943
#%796494
#%890140
#%934929
#%935065
#%990271
#%1061163
#%1061280
#%1078333
#%1078808
#%1126354
#%1144410
#%1276680
#%1276683
#%2875684
#%2967272
#%3491119
#!
  
#*A fast algorithm for multiplying min-sum permutations.
#@Yoshifumi Sakai
#t2011
#cDiscrete Applied Mathematics
#index3160120
#% 
#!
  
#*Girth of pancake graphs.
#@Phillip E. C. Compeau
#t2011
#cDiscrete Applied Mathematics
#index3160093
#%558741
#%836481
#%950590
#%1034901
#%1061065
#%1281507
#!
  
#*A sufficient condition for boundedness of tolerance graphs.
#@Birk Eisermann
#t2011
#cDiscrete Applied Mathematics
#index3160083
#% 
#!
  
#*Approximation schemes for parallel machine scheduling with availability constraints.
#@Bin Fu,Yumei Huo,Hairong Zhao
#t2011
#cDiscrete Applied Mathematics
#index3160121
#%611763
#%740406
#%741141
#%1034171
#%1227612
#%3078462
#%3259215
#!
  
#*Total restrained domination in claw-free graphs with minimum degree at least two.
#@Ernst J. Joubert
#t2011
#cDiscrete Applied Mathematics
#index3160107
#% 
#!
  
#*On resistance of graphs.
#@Petros A. Petrosyan,H. E. Sargsyan
#t2011
#cDiscrete Applied Mathematics
#index3160077
#% 
#!
  
#*Some inequalities for the atom-bond connectivity index of graph operations.
#@G. H. Fath-Tabar,B. Vaez-Zadeh,Ali Reza Ashrafi,Ante Graovac
#t2011
#cDiscrete Applied Mathematics
#index3160084
#% 
#!
  
#*Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms.
#@Nicolas Bourgeois,Bruno Escoffier,Vangelis Th. Paschos
#t2011
#cDiscrete Applied Mathematics
#index3160098
#% 
#!
  
#*8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).
#@Sonia Cafieri,Ulrich Faigle,Leo Liberti
#t2011
#cDiscrete Applied Mathematics
#index3160094
#% 
#!
  
#*Identifying codes and locating-dominating sets on paths and cycles.
#@Chunxia Chen,Changhong Lu,Zhengke Miao
#t2011
#cDiscrete Applied Mathematics
#index3160096
#%846967
#%864090
#%864512
#%865370
#%865468
#%976294
#%1061214
#%1078780
#%1089985
#%3612438
#!
  
#*Paths, trees and matchings under disjunctive constraints.
#@Andreas Darmann,Ulrich Pferschy,Joachim Schauer,Gerhard J. Woeginger
#t2011
#cDiscrete Applied Mathematics
#index3160106
#% 
#!
  
#*A comparison of lower bounds for the symmetric circulant traveling salesman problem.
#@Etienne de Klerk,Cristian Dobre
#t2011
#cDiscrete Applied Mathematics
#index3160075
#% 
#!
  
#*Minimum cost open chain reconfiguration.
#@Ali Nourollah,Mohammadreza Razzazi
#t2011
#cDiscrete Applied Mathematics
#index3160078
#%292498
#%467088
#%843542
#%972300
#!
  
#*Flow hypergraph reducibility.
#@André Luiz Pires Guedes,Lilian Markenzon,Luerbio Faria
#t2011
#cDiscrete Applied Mathematics
#index3160117
#% 
#!
  
#*The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
#@Luidi Simonetti,Yuri Frota,Cid C. de Souza
#t2011
#cDiscrete Applied Mathematics
#index3160060
#% 
#!
  
#*On a group testing problem: Characterization of graphs with 2-complexity c and maximum number of edges.
#@Tatjana Gerzen
#t2011
#cDiscrete Applied Mathematics
#index3160081
#% 
#!
  
#*Enumerating (2+2)-free posets by the number of minimal elements and other statistics.
#@Sergey Kitaev,Jeffrey B. Remmel
#t2011
#cDiscrete Applied Mathematics
#index3160100
#% 
#!
  
#*A system-theoretic model for cooperation, interaction and allocation.
#@Ulrich Faigle,Jan Voss
#t2011
#cDiscrete Applied Mathematics
#index3160095
#% 
#!
  
#*Thue choosability of trees.
#@Francesca Fiorenzi,Pascal Ochem,Patrice Ossona de Mendez,Xuding Zhu
#t2011
#cDiscrete Applied Mathematics
#index3160105
#% 
#!
  
#*Analysing local algorithms in location-aware quasi-unit-disk graphs.
#@Marja Hassinen,Joel Kaasinen,Evangelos Kranakis,Valentin Polishchuk,Jukka Suomela,Andreas Wiese
#t2011
#cDiscrete Applied Mathematics
#index3160082
#%27110
#%38939
#%38910
#%209982
#%481364
#%544190
#%544192
#%610901
#%622873
#%652621
#%654153
#%654180
#%654159
#%827070
#%828324
#%828686
#%841406
#%953139
#%953576
#%979630
#%1012887
#%1058474
#%1060122
#%1059943
#%1096500
#%1141645
#%1256385
#%1276213
#%1310263
#%2810559
#%2816379
#%2818904
#%3079966
#%1257138
#!
  
#*The number of excellent discrete Morse functions on graphs.
#@Rafael Ayala,Desamparados Fernández-Ternero,J. A. Vilches
#t2011
#cDiscrete Applied Mathematics
#index3160135
#% 
#!
  
#*Classification and generation of nanocones.
#@Gunnar Brinkmann,Nicolas Van Cleemput
#t2011
#cDiscrete Applied Mathematics
#index3160070
#%864199
#!
  
#*On disconnected cuts and separators.
#@Takehiro Ito,Marcin Kaminski,Daniël Paulusma,Dimitrios M. Thilikos
#t2011
#cDiscrete Applied Mathematics
#index3160099
#% 
#!
  
#*Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts.
#@Daobin Li,Baoyindureng Wu,Xunuan Yang,Xinhui An
#t2011
#cDiscrete Applied Mathematics
#index3160059
#%838563
#%975528
#%978080
#%1270170
#%1270193
#%1270276
#!
  
#*L(2, 1)-labeling of perfect elimination bipartite graphs.
#@B. S. Panda,Preeti Goel
#t2011
#cDiscrete Applied Mathematics
#index3160118
#% 
#!
  
#*(k, j)-coloring of sparse graphs.
#@Oleg V. Borodin,Anna O. Ivanova,Mickaël Montassier,André Raspaud
#t2011
#cDiscrete Applied Mathematics
#index3160136
#% 
#!
  
#*Nash-solvable two-person symmetric cycle game forms.
#@Endre Boros,Vladimir Gurvich,Kazuhisa Makino,Wei Shao
#t2011
#cDiscrete Applied Mathematics
#index3160137
#%838956
#%952955
#%1013819
#%1091228
#%1270305
#%2857036
#!
  
#*Partial characterizations of circle graphs.
#@Flavia Bonomo,Guillermo Durán,Luciano N. Grippo,Martín Darío Safe
#t2011
#cDiscrete Applied Mathematics
#index3160130
#% 
#!
  
#*Congestion games with failures.
#@Michal Penn,Maria Polukarov,Moshe Tennenholtz
#t2011
#cDiscrete Applied Mathematics
#index3160116
#%138058
#%209920
#%268839
#%592929
#%620516
#%621725
#%622872
#%951491
#%1060705
#%1122595
#%1289767
#%1289893
#%1332067
#%2939566
#!
  
#*Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength.
#@Paul Manuel,M. Arockiaraj,Indra Rajasingh,Bharati Rajan
#t2011
#cDiscrete Applied Mathematics
#index3160090
#% 
#!
  
#*Vertex PI indices of four sums of graphs.
#@Shuhua Li,Guoping Wang
#t2011
#cDiscrete Applied Mathematics
#index3160087
#%838871
#%1270170
#%1270267
#%2857067
#!
  
#*A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems.
#@Walid Ben-Ameur,José Neto
#t2011
#cDiscrete Applied Mathematics
#index3160101
#% 
#!
  
#*Exact algorithms for dominating set.
#@Johan M. M. van Rooij,Hans L. Bodlaender
#t2011
#cDiscrete Applied Mathematics
#index3160123
#% 
#!
  
#*Extremal P-stable graphs.
#@Illés Horváth,Gyula Y. Katona
#t2011
#cDiscrete Applied Mathematics
#index3160126
#% 
#!
  
#*A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑wC problem.
#@Edouard Wagneur,T. C. Edwin Cheng,C. T. Daniel Ng
#t2011
#cDiscrete Applied Mathematics
#index3160061
#% 
#!
  
#*Searching for mobile intruders in circular corridors by two 1-searchers.
#@Bo Jiang,Xuehou Tan
#t2011
#cDiscrete Applied Mathematics
#index3160066
#% 
#!
  
#*Permuting operations on strings and their relation to prime numbers.
#@Peter R. J. Asveld
#t2011
#cDiscrete Applied Mathematics
#index3160112
#% 
#!
  
#*Competitive subset selection with two agents.
#@Gaia Nicosia,Andrea Pacifici,Ulrich Pferschy
#t2011
#cDiscrete Applied Mathematics
#index3160073
#% 
#!
  
#*Fast computation of Andrews' smallest part statistic and conjectured congruences.
#@K. C. Garrett,C. McEachern,T. Frederick,Olaf A. Hall-Holt
#t2011
#cDiscrete Applied Mathematics
#index3160088
#% 
#!
  
#*On the lifetime of a random binary sequence.
#@Serkan Eryilmaz
#t2011
#cDiscrete Applied Mathematics
#index3160062
#% 
#!
  
#*An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies.
#@Jianrong Dong,David Fernández-Baca,Fred R. McMorris,Robert C. Powers
#t2011
#cDiscrete Applied Mathematics
#index3160111
#% 
#!
  
#*Total domination changing and stable graphs upon vertex removal.
#@Wyatt J. Desormeaux,Teresa W. Haynes,Michael A. Henning
#t2011
#cDiscrete Applied Mathematics
#index3160138
#%2857103
#!
  
#*A complete characterization of paths that are m-step competition graphs.
#@Eva Belmont
#t2011
#cDiscrete Applied Mathematics
#index3160125
#% 
#!
  
#*On graphs of defect at most 2.
#@Ramiro Feria-Purón,Mirka Miller,Guillermo Pineda-Villavicencio
#t2011
#cDiscrete Applied Mathematics
#index3160129
#% 
#!
  
#*Degree sequences and graphs with disjoint spanning trees.
#@Hong-Jian Lai,Yanting Liang,Ping Li,Jinquan Xu
#t2011
#cDiscrete Applied Mathematics
#index3160115
#%836358
#%1062018
#!
  
#*Graph reductions, binary rank, and pivots in gene assembly.
#@Nathan Pflueger
#t2011
#cDiscrete Applied Mathematics
#index3160076
#% 
#!
  
#*Recursive merge sort with erroneous comparisons.
#@Petros Hadjicostas,K. B. Lakshmanan
#t2011
#cDiscrete Applied Mathematics
#index3160089
#%105446
#%750940
#%830800
#%832520
#%836705
#%929826
#%1059875
#%1080308
#%1093958
#%1219434
#%1343077
#!
  
#*The most vital nodes with respect to independent set and vertex cover.
#@Cristina Bazgan,Sonia Toubaline,Zsolt Tuza
#t2011
#cDiscrete Applied Mathematics
#index3160071
#% 
#!
  
#*On the forbidden induced subgraph sandwich problem.
#@Simone Dantas,Celina M. Herrera de Figueiredo,Murilo Vicente Gonçalves da Silva,Rafael B. Teixeira
#t2011
#cDiscrete Applied Mathematics
#index3160102
#% 
#!
  
#*Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.
#@Maria Chudnovsky,Bernard Ries,Yori Zwols
#t2011
#cDiscrete Applied Mathematics
#index3160139
#% 
#!
  
#*On the sizes of graphs and their powers: The undirected case.
#@David Auger,Irène Charon,Olivier Hudry,Antoine Lobstein
#t2011
#cDiscrete Applied Mathematics
#index3160085
#% 
#!
  
#*Occupation games on graphs in which the second player takes almost all vertices.
#@Alexander Shapovalov
#t2011
#cDiscrete Applied Mathematics
#index3160124
#% 
#!
  
#*The complexity of dissociation set problems in graphs.
#@Yury L. Orlovich,Alexandre Dolgui,Gerd Finke,Valery S. Gordon,Frank Werner
#t2011
#cDiscrete Applied Mathematics
#index3160110
#% 
#!
  
#*Frugal, acyclic and star colourings of graphs.
#@Ross J. Kang,Tobias Müller
#t2011
#cDiscrete Applied Mathematics
#index3160067
#% 
#!
  
#*Hamiltonian properties of locally connected graphs with bounded vertex degree.
#@Valery S. Gordon,Yury L. Orlovich,Chris N. Potts,Vitaly A. Strusevich
#t2011
#cDiscrete Applied Mathematics
#index3160128
#% 
#!
  
#*Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.
#@Maria Chudnovsky,Bernard Ries,Yori Zwols
#t2011
#cDiscrete Applied Mathematics
#index3160103
#% 
#!
  
#*Simplifying maximum flow computations: The effect of shrinking and good initial flows.
#@F. Liers,G. Pardella
#t2011
#cDiscrete Applied Mathematics
#index3160092
#% 
#!
  
#*A new Euler-Mahonian constructive bijection.
#@Vincent Vajnovszki
#t2011
#cDiscrete Applied Mathematics
#index3160063
#% 
#!
  
#*Constructive extensions of two results on graphic sequences.
#@Ankit Garg,Arpit Goel,Amitabha Tripathi
#t2011
#cDiscrete Applied Mathematics
#index3160131
#% 
#!
  
#*Average update times for fully-dynamic all-pairs shortest paths.
#@Tobias Friedrich,Nils Hebbinghaus
#t2011
#cDiscrete Applied Mathematics
#index3160140
#% 
#!
  
#*On cryptographic protocols employing asymmetric pairings - The role of Ψ revisited.
#@Sanjit Chatterjee,Alfred Menezes
#t2011
#cDiscrete Applied Mathematics
#index3160127
#% 
#!
  
#*On two-stage stochastic knapsack problems.
#@Stefanie Kosuch,Abdel Lisser
#t2011
#cDiscrete Applied Mathematics
#index3160132
#% 
#!
  
#*On the first geometric-arithmetic index of graphs.
#@Kinkar Ch. Das,Ivan Gutman,Boris Furtula
#t2011
#cDiscrete Applied Mathematics
#index3160079
#% 
#!
  
#*Local protein threading by Mixed Integer Programming.
#@Guillaume Collet,Rumen Andonov,Nicola Yanev,Jean-François Gibrat
#t2011
#cDiscrete Applied Mathematics
#index3160114
#% 
#!
  
#*Acyclic and star colorings of cographs.
#@Andrew Lyons
#t2011
#cDiscrete Applied Mathematics
#index3160091
#% 
#!
  
#*Properly colored paths and cycles.
#@Shinya Fujita,Colton Magnant
#t2011
#cDiscrete Applied Mathematics
#index3160065
#%852587
#!
  
#*Sweeping an oval to a vanishing point.
#@Adrian Dumitrescu,Minghui Jiang
#t2011
#cDiscrete Applied Mathematics
#index3160109
#%3060813
#%935039
#!
  
#*On atom-bond connectivity index of connected graphs.
#@Rundan Xing,Bo Zhou,Fengming Dong
#t2011
#cDiscrete Applied Mathematics
#index3160104
#%1270195
#%2857100
#%2857003
#!
  
#*On the b-chromatic number of regular graphs.
#@Sergio Cabello,Marko Jakovac
#t2011
#cDiscrete Applied Mathematics
#index3160068
#% 
#!
  
#*Total chromatic number of unichord-free graphs.
#@R. C. S. Machado,C. M. H. de Figueiredo
#t2011
#cDiscrete Applied Mathematics
#index3160097
#% 
#!
  
#*Resistance distances and the Kirchhoff index in Cayley graphs.
#@Xing Gao,Yanfeng Luo,Wenwen Liu
#t2011
#cDiscrete Applied Mathematics
#index3160064
#% 
#!
  
#*Incoherent majorities: The McGarvey problem in judgement aggregation.
#@Klaus Nehring,Marcus Pivato
#t2011
#cDiscrete Applied Mathematics
#index3160080
#%837636
#%974288
#!
  
#*On Harary index of graphs.
#@Kexiang Xu,Kinkar Ch. Das
#t2011
#cDiscrete Applied Mathematics
#index3160074
#%1270276
#%1270256
#!
  
#*A note on total reinforcement in graphs.
#@Michael A. Henning,Nader Jafari Rad,Joanna Raczek
#t2011
#cDiscrete Applied Mathematics
#index3160119
#% 
#!
  
#*Strong edge colouring of subcubic graphs.
#@Hervé Hocquard,Petru Valicov
#t2011
#cDiscrete Applied Mathematics
#index3160133
#%851309
#!
  
#*Visualization of quasi-median networks.
#@Konrad Schwarz,Arne Dür
#t2011
#cDiscrete Applied Mathematics
#index3160113
#%836018
#%839083
#%864212
#%2928479
#!
  
#*On forcing matching number of boron-nitrogen fullerene graphs.
#@Xiaoyan Jiang,Heping Zhang
#t2011
#cDiscrete Applied Mathematics
#index3160122
#%837359
#%838389
#%848812
#%852067
#%854655
#%1092865
#%2856970
#!
  
#*The game chromatic index of wheels.
#@Stephan Dominique Andres,Winfried Hochstättler,Christiane Schallück
#t2011
#cDiscrete Applied Mathematics
#index3160108
#% 
#!
  
#*On self-duality of branchwidth in graphs of bounded genus.
#@Ignasi Sau,Dimitrios M. Thilikos
#t2011
#cDiscrete Applied Mathematics
#index3160069
#% 
#!
  
#*A (3, 1)*-choosable theorem on toroidal graphs.
#@Li Zhang
#t2012
#cDiscrete Applied Mathematics
#index3267985
#% 
#!
  
#*Estimating satisfiability.
#@Yacine Boufkhad,Thomas Hugel
#t2012
#cDiscrete Applied Mathematics
#index3267976
#%610406
#%621145
#%811761
#%821095
#%823876
#%838660
#%951962
#%1052137
#%1052105
#%1096279
#%1281449
#!
  
#*Maximizing edge-ratio is NP-complete.
#@Steven D. Noble,Pierre Hansen,Nenad Mladenovic
#t2011
#cDiscrete Applied Mathematics
#index3267964
#%950831
#%1114029
#!
  
#*Pancyclic graphs and degree sum and neighborhood union involving distance two.
#@Kewen Zhao,Yu-Jong Tzeng,Ping Zhang
#t2012
#cDiscrete Applied Mathematics
#index3267962
#% 
#!
  
#*Scheduling an unbounded batching machine with job processing time compatibilities.
#@A. Bellanger,Adam Janiak,Mikhail Y. Kovalyov,Ammar Oulamara
#t2012
#cDiscrete Applied Mathematics
#index3267957
#%749973
#%812682
#%815091
#%815144
#%838851
#%1096466
#!
  
#*A lower bound on the eccentric connectivity index of a graph.
#@M. J. Morgan,Simon Mukwembi,Henda C. Swart
#t2012
#cDiscrete Applied Mathematics
#index3267990
#% 
#!
  
#*Counting humps in Motzkin paths.
#@Yun Ding,Rosena R. X. Du
#t2012
#cDiscrete Applied Mathematics
#index3268001
#%851525
#%994820
#!
  
#*The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes.
#@Jon-Lark Kim,Seog-Jin Kim
#t2011
#cDiscrete Applied Mathematics
#index3267986
#%838475
#%842791
#%933117
#%934690
#%977269
#%977425
#%1062072
#%1061988
#%1144640
#%2965439
#%3001809
#!
  
#*A shortest path-based approach to the multileaf collimator sequencing problem.
#@Hadrien Cambazard,Eoin O'Mahony,Barry O'Sullivan
#t2012
#cDiscrete Applied Mathematics
#index3267975
#%117338
#%118168
#%118298
#%569952
#%811949
#%815055
#%837045
#%851675
#%934811
#%1024213
#%1270236
#%1270393
#%1289874
#%2866879
#%2937117
#!
  
#*Empty pseudo-triangles in point sets.
#@Hee-Kap Ahn,Sang Won Bae,Marc J. van Kreveld,Iris Reinbacher,Bettina Speckmann
#t2011
#cDiscrete Applied Mathematics
#index3267989
#%111405
#%803462
#%804040
#%952740
#%971843
#%979229
#%2921415
#!
  
#*Bounds on the crossing resolution of complete geometric graphs.
#@Emilio Di Giacomo,Walter Didimo,Peter Eades,Seok-Hee Hong,Giuseppe Liotta
#t2012
#cDiscrete Applied Mathematics
#index3267978
#%804073
#%1215015
#%1268851
#%2852110
#%2923714
#%3246580
#!
  
#*On the complexity of isoperimetric problems on trees.
#@Amir Daneshgar,Ramin Javadi
#t2012
#cDiscrete Applied Mathematics
#index3267961
#%836068
#%934838
#%952011
#%977258
#%1032967
#%1060106
#%1270228
#%2863904
#!
  
#*On Bounded-Degree Vertex Deletion parameterized by treewidth.
#@Nadja Betzler,Robert Bredereck,Rolf Niedermeier,Johannes Uhlmann
#t2012
#cDiscrete Applied Mathematics
#index3267958
#%415419
#%416180
#%465804
#%701366
#%837809
#%887208
#%887537
#%1062115
#%1265296
#%1281453
#%1308298
#%1343046
#%2774063
#%2951312
#%3080028
#!
  
#*The signs of three-term recurrence sequences.
#@Ernest X. W. Xia,X. M. Yao
#t2011
#cDiscrete Applied Mathematics
#index3268002
#%837038
#%975633
#%1336386
#!
  
#*A linear-time algorithm for the longest path problem in rectangular grid graphs.
#@Fatemeh Keshavarz-Kohjerdi,Alireza Bagheri,Asghar Asgharian-Sardroud
#t2012
#cDiscrete Applied Mathematics
#index3267967
#% 
#!
  
#*Strong and weak edges of a graph and linkages with the vertex cover problem.
#@Qiaoming Han,Abraham P. Punnen
#t2012
#cDiscrete Applied Mathematics
#index3267983
#% 
#!
  
#*Further results on the eccentric distance sum.
#@Hongbo Hua,Shenggui Zhang,Kexiang Xu
#t2012
#cDiscrete Applied Mathematics
#index3267977
#%3116487
#!
  
#*Three value TSP and linkages with the three value linear spanning 2-forests.
#@Daniel K. Benvenuti,Abraham P. Punnen
#t2012
#cDiscrete Applied Mathematics
#index3267959
#%837435
#%1014119
#%1061939
#!
  
#*Arboricity: An acyclic hypergraph decomposition problem motivated by database theory.
#@Yeow Meng Chee,Lijun Ji,Andrew Lim,Anthony K. H. Tung
#t2012
#cDiscrete Applied Mathematics
#index3267966
#%621432
#%644067
#%848677
#%949798
#%950239
#%1051840
#%1060536
#!
  
#*On the Zagreb indices equality.
#@Hosam Abdo,Darko Dimitrov,Ivan Gutman
#t2012
#cDiscrete Applied Mathematics
#index3267973
#%3066815
#%847194
#%1270290
#!
  
#*Pancyclicity of k-ary n-cube networks with faulty vertices and edges.
#@Jing Li,Di Liu,Jun Yuan
#t2012
#cDiscrete Applied Mathematics
#index3267984
#% 
#!
  
#*Three new upper bounds on the chromatic number.
#@María Soto,André Rossi,Marc Sevaux
#t2011
#cDiscrete Applied Mathematics
#index3267982
#%838755
#%838751
#%838779
#%3480172
#!
  
#*The number of independent sets of unicyclic graphs with given matching number.
#@Gong Chen,Zhongxun Zhu
#t2012
#cDiscrete Applied Mathematics
#index3267997
#%837111
#%839098
#%1270232
#%1336439
#!
  
#*The Kirchhoff indices of join networks.
#@Enrique Bendito,Angeles Carmona,Andrés M. Encinas
#t2012
#cDiscrete Applied Mathematics
#index3267969
#%1270361
#!
  
#*Two linear-time algorithms for computing the minimum length polygon of a digital contour.
#@Jacques-Olivier Lachaud,Xavier Provençal
#t2011
#cDiscrete Applied Mathematics
#index3267955
#%111099
#%154007
#%610749
#%932911
#%947578
#%1031388
#%1089341
#%1093129
#%1226914
#%1241725
#%1241698
#%1251327
#%3004083
#!
  
#*Approximation results for a min-max location-routing problem.
#@Zhou Xu,Dongsheng Xu,Wenbin Zhu
#t2012
#cDiscrete Applied Mathematics
#index3267960
#% 
#!
  
#*Total domination in inflated graphs.
#@Michael A. Henning,Adel P. Kazemi
#t2012
#cDiscrete Applied Mathematics
#index3267995
#%1092447
#!
  
#*On bipartite graphs of defect at most 4.
#@Ramiro Feria-Purón,Guillermo Pineda-Villavicencio
#t2012
#cDiscrete Applied Mathematics
#index3267974
#%853674
#%2858772
#%2872606
#!
  
#*A revised algorithm for searching for all defective edges in a graph.
#@Ting Chen
#t2011
#cDiscrete Applied Mathematics
#index3267988
#%836560
#%838207
#!
  
#*Optimal stopping in a search for a vertex with full degree in a random graph.
#@Michal Przykucki
#t2012
#cDiscrete Applied Mathematics
#index3267979
#% 
#!
  
#*Chebyshev center based column generation.
#@Chungmok Lee,Sungsoo Park
#t2011
#cDiscrete Applied Mathematics
#index3267968
#%812021
#%814404
#%838443
#%851675
#%1013370
#%1013619
#%1014399
#%1024782
#%1289634
#%1289635
#%1289874
#%1340619
#!
  
#*On reformulated Zagreb indices.
#@Aleksandar Ilic,Bo Zhou
#t2012
#cDiscrete Applied Mathematics
#index3267981
#% 
#!
  
#*Online scheduling on three uniform machines.
#@Sheng-Yi Cai,Qi-Fan Yang
#t2012
#cDiscrete Applied Mathematics
#index3267994
#% 
#!
  
#*Ballot matrix as Catalan matrix power and related identities.
#@Stefan Stanimirovic,Predrag S. Stanimirovic,Aleksandar Ilic
#t2012
#cDiscrete Applied Mathematics
#index3267996
#% 
#!
  
#*Trees with the seven smallest and eight greatest Harary indices.
#@Kexiang Xu
#t2012
#cDiscrete Applied Mathematics
#index3267970
#% 
#!
  
#*Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words.
#@Bojan Dalbelo Basic
#t2012
#cDiscrete Applied Mathematics
#index3267998
#%1090714
#%1093124
#%1270268
#%2866824
#%3004189
#%3184474
#!
  
#*Equitable colorings of Cartesian products of graphs.
#@Wu-Hsiung Lin,Gerard J. Chang
#t2012
#cDiscrete Applied Mathematics
#index3267987
#% 
#!
  
#*Cyclic matrices of weighted digraphs.
#@Ricardo Riaza
#t2012
#cDiscrete Applied Mathematics
#index3267993
#% 
#!
  
#*A short constructive proof of A. R. Rao's characterization of potentially K-graphic sequences.
#@Jian-Hua Yin
#t2012
#cDiscrete Applied Mathematics
#index3267999
#% 
#!
  
#*On the locating chromatic number of Kneser graphs.
#@Ali Behtoei,Behnaz Omoomi
#t2011
#cDiscrete Applied Mathematics
#index3267971
#%851951
#%976040
#!
  
#*On some topological indices of the tensor products of graphs.
#@K. Pattabiraman,P. Paulraja
#t2012
#cDiscrete Applied Mathematics
#index3267992
#% 
#!
  
#*Containment relations in split graphs.
#@Petr A. Golovach,Marcin Kaminski,Daniël Paulusma,Dimitrios M. Thilikos
#t2012
#cDiscrete Applied Mathematics
#index3267972
#%660609
#%853418
#%977721
#%1024835
#%1024847
#%1336356
#%2786073
#%2918436
#%3028461
#%3028329
#%3192539
#!
  
#*Maximum induced matching problem on hhd-free graphs.
#@Chandra Mohan Krishnamurthy,R. Sritharan
#t2012
#cDiscrete Applied Mathematics
#index3267980
#% 
#!
  
#*On the relative distances of nine or ten points in the boundary of a plane convex body.
#@Zhanjun Su,Sipeng Li,Jian Shen,Liping Yuan
#t2012
#cDiscrete Applied Mathematics
#index3267965
#% 
#!
  
#*b-coloring of Kneser graphs.
#@Rangaswami Balakrishnan,T. Kavaskar
#t2012
#cDiscrete Applied Mathematics
#index3267963
#%660803
#%836512
#%837221
#%1270382
#%1336441
#%2921390
#!
  
#*On the construction of prefix-free and fix-free codes with specified codeword compositions.
#@Ali Kakhbod,Morteza Zadimoghaddam
#t2011
#cDiscrete Applied Mathematics
#index3267956
#%949650
#%1206775
#!
  
#*A simple branching scheme for vertex coloring problems.
#@Stefano Gualandi,Federico Malucelli
#t2012
#cDiscrete Applied Mathematics
#index3268000
#%814802
#!
  
#*Maximal independent sets in caterpillar graphs.
#@Carmen Ortiz,Mónica Villanueva
#t2012
#cDiscrete Applied Mathematics
#index3267991
#% 
#!
  
#*Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences.
#@Andreas Brandstädt,Vassilis Giakoumakis,Frédéric Maffray
#t2012
#cDiscrete Applied Mathematics
#index3319808
#%415308
#%835918
#%847188
#%1059992
#%1060205
#%1095504
#%1095924
#%1338763
#%1343044
#%3066812
#!
  
#*The arity gap of order-preserving functions and extensions of pseudo-Boolean functions.
#@Miguel Couceiro,Erkko Lehtonen,Tamás Waldhauser
#t2012
#cDiscrete Applied Mathematics
#index3319801
#%836743
#%838432
#%847526
#%853846
#%854045
#%1096045
#%2802974
#!
  
#*On 3-y-vertex critical graphs of diameter three.
#@Mustapha Chellali,Nader Jafari Rad,Abdollah Khodkar
#t2012
#cDiscrete Applied Mathematics
#index3319783
#% 
#!
  
#*Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs.
#@Yong Gao
#t2012
#cDiscrete Applied Mathematics
#index3319789
#% 
#!
  
#*Robust cutpoints in the logical analysis of numerical data.
#@Martin Anthony,Joel Ratsaby
#t2012
#cDiscrete Applied Mathematics
#index3319782
#%830806
#%949807
#%1013425
#%1112474
#%1343109
#!
  
#*Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube.
#@Jywe-Fei Fang,Chien-Hung Huang
#t2012
#cDiscrete Applied Mathematics
#index3319807
#%838307
#%838578
#%929772
#%933285
#%934813
#%934810
#%942829
#%988769
#%989926
#%990072
#%1024243
#%1034980
#%1078630
#%1125445
#%1125602
#%1343367
#%2875673
#!
  
#*Sturmian graphs and integer representations over numeration systems.
#@Chiara Epifanio,Christiane Frougny,Alessandra Gabriele,Filippo Mignosi,Jeffrey Shallit
#t2012
#cDiscrete Applied Mathematics
#index3319802
#%837317
#%838603
#%889407
#%1093129
#%1094329
#%3004189
#!
  
#*Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds.
#@Milica Andelic,Carlos M. da Fonseca,Slobodan K. Simic,Dejan V. Tosic
#t2012
#cDiscrete Applied Mathematics
#index3319784
#% 
#!
  
#*At least three minimal quasi-kernels.
#@Stephen Bowser,Charles Cable
#t2012
#cDiscrete Applied Mathematics
#index3319781
#%854182
#%1144540
#%1144575
#!
  
#*Computing convex quadrangulations.
#@T. Schiffer,Franz Aurenhammer,M. Demuth
#t2012
#cDiscrete Applied Mathematics
#index3319790
#%3482
#%111349
#%610559
#%780011
#%803969
#%1121138
#%2781266
#!
  
#*Boolean functions with a simple certificate for CNF complexity.
#@Ondrej Cepek,Petr Kucera,Petr Savický
#t2012
#cDiscrete Applied Mathematics
#index3319780
#%621778
#%622442
#%745030
#%798317
#%931574
#%951084
#%973055
#%1058478
#%1112878
#%1336394
#%3003624
#!
  
#*A recursive formula for weights of Boolean rotation symmetric functions.
#@Thomas W. Cusick,Dan Padgett
#t2012
#cDiscrete Applied Mathematics
#index3319785
#%17007
#%399330
#%838967
#%839067
#%3140787
#%3141916
#!
  
#*Linear coloring of sparse graphs.
#@Yingqian Wang,Qian Wu
#t2012
#cDiscrete Applied Mathematics
#index3319796
#%851947
#!
  
#*The complexity of two graph orientation problems.
#@Nicole Eggemann,Steven D. Noble
#t2012
#cDiscrete Applied Mathematics
#index3319810
#%481173
#%798793
#%887537
#%952621
#%977725
#%978754
#%1058651
#%1060735
#%1061248
#%1144554
#!
  
#*Constructing connected bicritical graphs with edge-connectivity 2.
#@Xue-Gang Chen,Shinya Fujita,Michitaka Furuya,Moo Young Sohn
#t2012
#cDiscrete Applied Mathematics
#index3319799
#% 
#!
  
#*Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope.
#@Takuya Iimura,Kazuo Murota,Akihisa Tamura
#t2012
#cDiscrete Applied Mathematics
#index3319800
#%105113
#%2891889
#!
  
#*Independence polynomials of some compound graphs.
#@Lanzhen Song,William Staton,Bing Wei
#t2012
#cDiscrete Applied Mathematics
#index3319786
#%838743
#%854797
#%978733
#%2857037
#!
  
#*An algorithm for finding the vertices of the k-additive monotone core.
#@Pedro Miranda,Michel Grabisch
#t2012
#cDiscrete Applied Mathematics
#index3319809
#%843933
#%921671
#%921492
#%1276665
#%1312484
#%2921217
#!
  
#*Combinatorics of Boolean automata circuits dynamics.
#@Jacques Demongeot,Mathilde Noual,Sylvain Sené
#t2012
#cDiscrete Applied Mathematics
#index3319795
#%827948
#%835907
#%838724
#%1027878
#%1336354
#!
  
#*A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks.
#@Drago Bokal,Bostjan Bresar,Janja Jerebic
#t2012
#cDiscrete Applied Mathematics
#index3319794
#%212049
#%2853983
#!
  
#*Global defensive alliances of trees and Cartesian product of paths and cycles.
#@Chan-Wei Chang,Ma-Lian Chia,Cheng-Ju Hsu,David Kuo,Li-Ling Lai,Fu-Hsing Wang
#t2012
#cDiscrete Applied Mathematics
#index3319787
#%410863
#%692896
#%836808
#%1093967
#%1270179
#!
  
#*1-planarity of complete multipartite graphs.
#@Július Czap,Dávid Hudák
#t2012
#cDiscrete Applied Mathematics
#index3319797
#%749883
#%950704
#!
  
#*Generalized roof duality and bisubmodular functions.
#@Vladimir Kolmogorov
#t2012
#cDiscrete Applied Mathematics
#index3319779
#%46497
#%128829
#%169720
#%836271
#%851077
#%854012
#%1031248
#%1061363
#%1273633
#%1322391
#%1340674
#%2867197
#!
  
#*Minimum average-case queries of q+1-ary search game with small sets.
#@Kun Meng,Chuang Lin,Wen An Liu,Yang Yang,Gyula O. H. Katona
#t2012
#cDiscrete Applied Mathematics
#index3319793
#%836223
#%836225
#%838244
#%838398
#%974319
#%1093958
#!
  
#*Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips.
#@Sarah Spence Adams,Paul Booth,Harold Jaffe,Denise Sakai Troxell,S. Luke Zinnen
#t2012
#cDiscrete Applied Mathematics
#index3319798
#% 
#!
  
#*Kirchhoff index in line, subdivision and total graphs of a regular graph.
#@Xing Gao,Yanfeng Luo,Wenwen Liu
#t2012
#cDiscrete Applied Mathematics
#index3319788
#%1270361
#!
  
#*Using well-solvable quadratic assignment problems for VLSI interconnect applications.
#@Ben Emanuel,Shmuel Wimer,Gershon Wolansky
#t2012
#cDiscrete Applied Mathematics
#index3319811
#%234047
#%252945
#%605207
#%610353
#%927176
#%1118132
#%1340659
#%2782957
#%2928585
#!
  
#*Boolean functions optimizing most of the cryptographic criteria.
#@Ziran Tu,Yingpu Deng
#t2012
#cDiscrete Applied Mathematics
#index3319803
#%50835
#%51236
#%119766
#%120440
#%192876
#%396257
#%842460
#%1336472
#%2951077
#%2977489
#%3066983
#%3140336
#%3256659
#%327447
#!
  
#*Bandwidth and distortion revisited.
#@Marek Cygan,Marcin Pilipczuk
#t2012
#cDiscrete Applied Mathematics
#index3319778
#%609939
#%624146
#%661081
#%1059420
#%1209564
#%1209571
#%2869677
#%3080085
#%3317469
#!
  
#*Edge fault tolerance of graphs with respect to super edge connectivity.
#@Yanmei Hong,Jixiang Meng,Zhao Zhang
#t2012
#cDiscrete Applied Mathematics
#index3319791
#%838728
#%847051
#%848540
#%849145
#%854207
#%854868
#%931027
#%1077859
#%1079135
#%1147995
#%1270272
#!
  
#*Record statistics in a random composition.
#@Arnold Knopfmacher,Toufik Mansour
#t2012
#cDiscrete Applied Mathematics
#index3319804
#%854163
#%1052052
#%1338704
#%2939941
#!
  
#*Packing chromatic number of distance graphs.
#@Jan Ekstein,Premysl Holub,Bernard Lidický
#t2012
#cDiscrete Applied Mathematics
#index3319805
#%838679
#%2857028
#%2858818
#%2857012
#%865413
#%838277
#!
  
#*The universality of iterated hashing over variable-length strings.
#@Daniel Lemire
#t2012
#cDiscrete Applied Mathematics
#index3319792
#%120221
#%120465
#%140876
#%193213
#%327243
#%436516
#%570538
#%611321
#%611314
#%611746
#%620152
#%623406
#%775000
#%775256
#%832708
#%842428
#%953454
#%2872486
#%3066942
#!
  
#*On the O(n) algorithm for checking the strong robustness of interval fuzzy matrices.
#@Ján Plávka
#t2012
#cDiscrete Applied Mathematics
#index3319806
#% 
#!
  
#*Vertex and edge Padmakar-Ivan indices of the generalized hierarchical product of graphs.
#@K. Pattabiraman,P. Paulraja
#t2012
#cDiscrete Applied Mathematics
#index3393316
#%838871
#%839092
#%2857102
#%2990183
#%3066818
#!
  
#*Recursive method to solve the problem of "Gambling with God".
#@Huang Shao,Wang Chao
#t2012
#cDiscrete Applied Mathematics
#index3393298
#% 
#!
  
#*The Traveling Salesman Problem with flexible coloring.
#@Thomas A. Roemer,Reza Ahmadi,Sriram Dasu
#t2012
#cDiscrete Applied Mathematics
#index3393293
#%92852
#%932239
#%949569
#!
  
#*Graphs of separability at most 2.
#@Ferdinando Cicalese,Martin Milanic
#t2012
#cDiscrete Applied Mathematics
#index3393274
#%228655
#%406720
#%415126
#%660576
#%836499
#%837340
#%839345
#%971764
#%975176
#%979410
#%1025594
#%1058968
#%1087123
#%1091459
#%1338763
#%2872664
#%3035978
#%3480155
#!
  
#*Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs.
#@Emeric Gioan,Christophe Paul
#t2012
#cDiscrete Applied Mathematics
#index3393299
#%73
#%224807
#%416148
#%481148
#%610766
#%620958
#%625896
#%797965
#%824963
#%825519
#%838071
#%839425
#%930182
#%935142
#%952832
#%953423
#%974454
#%975761
#%977408
#%1059504
#%1090430
#!
  
#*Generalization error bounds for the logical analysis of data.
#@Martin Anthony
#t2012
#cDiscrete Applied Mathematics
#index3393283
#%835880
#%835878
#%835932
#%949807
#%984945
#%984926
#!
  
#*k-Rainbow domatic numbers.
#@Shinya Fujita,Michitaka Furuya,Colton Magnant
#t2012
#cDiscrete Applied Mathematics
#index3393270
#%865419
#%1061459
#%1336416
#!
  
#*Collective additive tree spanners for circle graphs and polygonal graphs.
#@Feodor F. Dragan,Derek G. Corneil,Ekkehard Köhler,Yang Xiang
#t2012
#cDiscrete Applied Mathematics
#index3393256
#%210342
#%415436
#%544376
#%614640
#%620729
#%621393
#%621940
#%660557
#%661029
#%952886
#%953577
#%971709
#%1059416
#%1061140
#%1061269
#%1090079
#!
  
#*New results for the Longest Haplotype Reconstruction problem.
#@Riccardo Dondi
#t2012
#cDiscrete Applied Mathematics
#index3393317
#%186359
#%750859
#%837112
#%861707
#%861924
#%924094
#%949573
#%949588
#%973393
#%1088756
#!
  
#*NP-hardness of the sorting buffer problem on the uniform metric.
#@Yuichi Asahiro,Kenichi Kawahara,Eiji Miyano
#t2012
#cDiscrete Applied Mathematics
#index3393263
#%186453
#%267905
#%979650
#%2816221
#%2863963
#%2869220
#%3028334
#!
  
#*E-super vertex magic labelings of graphs.
#@G. Marimuthu,M. Balakrishnan
#t2012
#cDiscrete Applied Mathematics
#index3393323
#% 
#!
  
#*Testability of minimum balanced multiway cut densities.
#@Marianna Bolla,Tamás Kói,András Krámli
#t2012
#cDiscrete Applied Mathematics
#index3393320
#%211400
#%621550
#%950466
#%978715
#%979251
#!
  
#*The Tower of Hanoi problem on Path graphs.
#@Daniel Berend,Amir Sapir,Shay Solomon
#t2012
#cDiscrete Applied Mathematics
#index3393280
#% 
#!
  
#*Parameterized complexity of generalized domination problems.
#@Petr A. Golovach,Jan Kratochvíl,Ondrej Suchý
#t2012
#cDiscrete Applied Mathematics
#index3393260
#%626076
#%661057
#%865427
#%865402
#%865466
#%930355
#%1025609
#%1025677
#%1025818
#%1059080
#%1276110
#%1310272
#%2807081
#%2908521
#%2943447
#!
  
#*Wiener index of some graph operations.
#@Mehdi Eliasi,Ghaffar Raeisi,Bijan Taeri
#t2012
#cDiscrete Applied Mathematics
#index3393309
#%839092
#%854513
#%1270170
#%2990183
#!
  
#*Generalized competition indices of symmetric primitive digraphs.
#@Hwa Kyung Kim,Sang Hoon Lee
#t2012
#cDiscrete Applied Mathematics
#index3393269
#%2989138
#!
  
#*Guest editors' foreword.
#@Pinar Heggernes,Jan Kratochvíl,Andrzej Proskurowski
#t2012
#cDiscrete Applied Mathematics
#index3393296
#% 
#!
  
#*On the maximal Wiener index and related questions.
#@Andrew V. Sills,Hua Wang
#t2012
#cDiscrete Applied Mathematics
#index3393282
#%836787
#%838917
#%1336355
#!
  
#*Locally monotone Boolean and pseudo-Boolean functions.
#@Miguel Couceiro,Jean-Luc Marichal,Tamás Waldhauser
#t2012
#cDiscrete Applied Mathematics
#index3393273
#%3013018
#%836813
#%1278861
#%1013094
#%1082295
#!
  
#*Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.
#@Pinar Heggernes,Daniel Meister,Charis Papadopoulos
#t2012
#cDiscrete Applied Mathematics
#index3393322
#%481148
#%626090
#%626130
#%836522
#%971764
#%979196
#%1058968
#%1091656
#%1341596
#!
  
#*The walk distances in graphs.
#@Pavel Chebotarev
#t2012
#cDiscrete Applied Mathematics
#index3393319
#%3066779
#%3138241
#%3112707
#%2857121
#%473805
#!
  
#*Minimum decomposition into convex binary matrices.
#@Fethi Jarray,Christophe Picouleau
#t2012
#cDiscrete Applied Mathematics
#index3393310
#%837047
#%1024213
#%1289663
#!
  
#*Minimizing the error of linear separators on linearly inseparable data.
#@Boris Aronov,Delia Garijo,Yurai Núñez Rodríguez,David Rappaport,Carlos Seara,Jorge Urrutia
#t2012
#cDiscrete Applied Mathematics
#index3393285
#%837196
#%837240
#%951149
#%971555
#%1031804
#%1059456
#%1060853
#%1095768
#%1133690
#%2862740
#%1058804
#%1277124
#!
  
#*A note on connected dominating sets of distance-hereditary graphs.
#@Oliver Schaudt
#t2012
#cDiscrete Applied Mathematics
#index3393325
#%624118
#%974454
#%1058996
#%1062020
#%1095297
#!
  
#*A parallelogram tile fills the plane by translation in at most two distinct ways.
#@Alexandre Blondin Massé,Srecko Brlek,Sébastien Labbé
#t2012
#cDiscrete Applied Mathematics
#index3393272
#%158284
#%839070
#%1241708
#%3130448
#!
  
#*Weakly quasi-Hamiltonian-set-connected multipartite tournaments.
#@Yubao Guo,Mei Lu,Michel Surmacs
#t2012
#cDiscrete Applied Mathematics
#index3393268
#%851781
#%976047
#!
  
#*Unit and single point interval graphs.
#@Dieter Rautenbach,Jayme Luiz Szwarcfiter
#t2012
#cDiscrete Applied Mathematics
#index3393318
#%836507
#%931133
#%1341653
#%3066762
#!
  
#*On the difference of the domination number of a digraph and of its reverse.
#@Stefan Gyürki
#t2012
#cDiscrete Applied Mathematics
#index3393261
#%304087
#%851783
#%1125534
#%1270212
#!
  
#*On a problem of Erdős, Herzog and Schönheim.
#@Yong-Gao Chen,Cui-Ying Hu
#t2012
#cDiscrete Applied Mathematics
#index3393308
#% 
#!
  
#*Acyclic edge coloring of planar graphs without 5-cycles.
#@Qiaojun Shu,Weifan Wang,Yiqiao Wang
#t2012
#cDiscrete Applied Mathematics
#index3393297
#%17100
#%622762
#%933907
#%935134
#%1051754
#%1343069
#%2872679
#%2872615
#%2923729
#%3066861
#%3245406
#%3317551
#%3480347
#!
  
#*Girth of {C, ..., C}-free extremal graphs.
#@E. Abajo,Camino Balbuena,Ana Diánez
#t2012
#cDiscrete Applied Mathematics
#index3393303
#% 
#!
  
#*Further generalizations of the Wythoff game and the minimum excludant.
#@Vladimir Gurvich
#t2012
#cDiscrete Applied Mathematics
#index3393267
#%1089450
#!
  
#*On the model-checking of monadic second-order formulas with edge set quantifications.
#@Bruno Courcelle
#t2012
#cDiscrete Applied Mathematics
#index3393276
#%138547
#%204564
#%836522
#%887537
#%951671
#%952720
#%978691
#%1058968
#%1060875
#%1341596
#%2858857
#!
  
#*Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected.
#@Dirk Meierling,Lutz Volkmann
#t2012
#cDiscrete Applied Mathematics
#index3393294
#%847051
#%849145
#%854207
#%931027
#%1276391
#%2926171
#%3393286
#!
  
#*Generalized power domination of graphs.
#@Gerard Jennhwa Chang,Paul Dorbec,Mickaël Montassier,André Raspaud
#t2012
#cDiscrete Applied Mathematics
#index3393324
#%105386
#%204153
#%750956
#%1061459
#%1062044
#%1095285
#%1341604
#!
  
#*On spanning galaxies in digraphs.
#@Daniel Gonçalves,Frédéric Havet,Alexandre Pinlou,Stéphan Thomassé
#t2012
#cDiscrete Applied Mathematics
#index3393258
#%837424
#%851237
#%852439
#%1059078
#%2967120
#!
  
#*The Kirchhoff indexes of some composite networks.
#@C. Araúz
#t2012
#cDiscrete Applied Mathematics
#index3393312
#%975109
#%1270361
#%3267969
#!
  
#*Condorcet domains of tiling type.
#@Vladimir I. Danilov,Alexander V. Karzanov,Gleb A. Koshevoy
#t2012
#cDiscrete Applied Mathematics
#index3393289
#%975487
#!
  
#*Kernelization for cycle transversal problems.
#@Ge Xia,Yong Zhang
#t2012
#cDiscrete Applied Mathematics
#index3393307
#%623296
#%798742
#%798743
#%853864
#%973305
#%975783
#%1062115
#%1144700
#%1332032
#%2817180
#%2863789
#%2868710
#%2872645
#%2919700
#%3080082
#!
  
#*On the connectivity of p-diamond-free vertex transitive graphs.
#@Yingzhi Tian,Jixiang Meng,Zhao Zhang
#t2012
#cDiscrete Applied Mathematics
#index3393330
#%837660
#%838675
#%838869
#%854755
#%864542
#%2921435
#%3068754
#!
  
#*Hypergraphs with large domination number and with edge sizes at least three.
#@Michael A. Henning,Christian Löwenstein
#t2012
#cDiscrete Applied Mathematics
#index3393277
#%852828
#%1062020
#%1144671
#%2851828
#%2872663
#%2921318
#%3138246
#!
  
#*Proximity thresholds for matching extension in the torus and Klein bottle.
#@Robert E. L. Aldred,Michael D. Plummer
#t2012
#cDiscrete Applied Mathematics
#index3393284
#%846845
#%853431
#%2921377
#%3083379
#!
  
#*On the b-chromatic number of regular graphs without 4-cycle.
#@Saeed Shaebani
#t2012
#cDiscrete Applied Mathematics
#index3393259
#%660803
#%837221
#%838638
#%1270382
#%1336441
#%2921390
#!
  
#*Cooperative location games based on the minimum diameter spanning Steiner subgraph problem.
#@Justo Puerto,Arie Tamir,Federico Perea
#t2012
#cDiscrete Applied Mathematics
#index3393287
#%211515
#%838164
#%952999
#%1014328
#%2925946
#%3350508
#!
  
#*On the diameter and girth of zero-divisor graphs of posets.
#@M. Alizadeh,A. K. Das,Hamid Reza Maimani,M. R. Pournaki,S. Yassemi
#t2012
#cDiscrete Applied Mathematics
#index3393266
#%2921394
#!
  
#*Inferring a graph from path frequency.
#@Tatsuya Akutsu,Daiji Fukagawa,Jesper Jansson,Kunihiko Sadakane
#t2012
#cDiscrete Applied Mathematics
#index3393295
#%118487
#%334666
#%335335
#%336115
#%884934
#%930850
#%972795
#%1009356
#%1093309
#%3006861
#!
  
#*Decomposition width of matroids.
#@Daniel Král'
#t2012
#cDiscrete Applied Mathematics
#index3393291
#%228655
#%267132
#%267424
#%493799
#%620388
#%620934
#%621511
#%831337
#%865161
#%887537
#%952621
#%975823
#%978744
#%978691
#%978728
#%978720
#%979184
#%1059520
#%1060875
#%1338777
#%2858836
#!
  
#*Acyclic edge coloring of planar graphs with Δ colors.
#@Dávid Hudák,Frantisek Kardos,Borut Luzar,Roman Sotak,Riste Skrekovski
#t2012
#cDiscrete Applied Mathematics
#index3393302
#% 
#!
  
#*On the number of blocks required to access the core.
#@Sylvain Béal,Eric Rémila,Philippe Solal
#t2012
#cDiscrete Applied Mathematics
#index3393306
#% 
#!
  
#*On plane graphs with link component number equal to the nullity.
#@Yuefeng Lin,S. D. Noble,Xian'an Jin,Wenfang Cheng
#t2012
#cDiscrete Applied Mathematics
#index3393327
#%849304
#%1270183
#!
  
#*Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs.
#@Vladimir Gurvich,Mikhail Vyalyi
#t2012
#cDiscrete Applied Mathematics
#index3393254
#%853921
#%952676
#%1058572
#%1209556
#%1270305
#%2857121
#!
  
#*A note on entire choosability of plane graphs.
#@Wei Dong
#t2012
#cDiscrete Applied Mathematics
#index3393313
#%1144663
#%3126239
#!
  
#*The bottleneck 2-connected k-Steiner network problem for k≤2.
#@Marcus Brazil,Charl J. Ras,D. A. Thomas
#t2012
#cDiscrete Applied Mathematics
#index3393288
#% 
#!
  
#*On the online track assignment problem.
#@Marc Demange,Gabriele Di Stefano,Benjamin Leroy-Beaulieu
#t2012
#cDiscrete Applied Mathematics
#index3393314
#%836551
#%851236
#%933141
#%953055
#%979680
#%979597
#%1061519
#%1090991
#%1288538
#%1288671
#!
  
#*On the acyclic disconnection of multipartite tournaments.
#@Ana Paulina Figueroa,Bernardo Llano,M. Olsen,Eduardo Rivera-Campo
#t2012
#cDiscrete Applied Mathematics
#index3393292
#%851763
#!
  
#*On dynamic coloring for planar graphs and graphs of higher genus.
#@Ye Chen,Suohai Fan,Hong-Jian Lai,Huimin Song,Lei Sun
#t2012
#cDiscrete Applied Mathematics
#index3393326
#%977724
#%1270340
#%2919142
#%2967277
#!
  
#*Approximation algorithms for a geometric set cover problem.
#@Valentin E. Brimkov,Andrew Leach,Jimmy Wu,Michael Mastroianni
#t2012
#cDiscrete Applied Mathematics
#index3393321
#%2616
#%268503
#%803558
#%951041
#%2904932
#%3079912
#!
  
#*k-restricted edge-connectivity in triangle-free graphs.
#@Andreas Holtkamp,Dirk Meierling,Luis Pedro Montejano
#t2012
#cDiscrete Applied Mathematics
#index3393286
#%847051
#%854207
#%931027
#!
  
#*Vertex covers and eternal dominating sets.
#@William Klostermeyer,Christina M. Mynhardt
#t2012
#cDiscrete Applied Mathematics
#index3393305
#% 
#!
  
#*Distance three labelings of trees.
#@Jirí Fiala,Petr A. Golovach,Jan Kratochvíl,Bernard Lidický,Daniël Paulusma
#t2012
#cDiscrete Applied Mathematics
#index3393281
#%267947
#%269351
#%368303
#%408187
#%623072
#%626112
#%660612
#%837417
#%839037
#%887537
#%933117
#%953170
#%977425
#%1061170
#%1061638
#%1270136
#%2817646
#%2858753
#!
  
#*Discovering all associations in discrete data using frequent minimally infrequent attribute sets.
#@Elke Eisenschmidt,Utz-Uwe Haus
#t2012
#cDiscrete Applied Mathematics
#index3393331
#%751378
#%837012
#%887270
#%952955
#!
  
#*On the approximability of some degree-constrained subgraph problems.
#@Omid Amini,David Peleg,Stéphane Pérennes,Ignasi Sau,Saket Saurabh
#t2012
#cDiscrete Applied Mathematics
#index3393301
#%92852
#%210446
#%268601
#%484614
#%610552
#%610488
#%621218
#%622067
#%838856
#%851230
#%862335
#%952966
#%1058629
#%1060106
#%1060745
#%1061006
#%1060738
#%1281503
#%2864001
#%3399967
#!
  
#*Some remarks on inverse Wiener index problem.
#@Jirí Fink,Borut Luzar,Riste Skrekovski
#t2012
#cDiscrete Applied Mathematics
#index3393278
#%749689
#!
  
#*A non-uniform birthday problem with applications to discrete logarithms.
#@Steven D. Galbraith,Mark Holmes
#t2012
#cDiscrete Applied Mathematics
#index3393290
#%836804
#%986042
#%1307499
#%2810316
#%3142157
#!
  
#*Directed domination in oriented graphs.
#@Yair Caro,Michael A. Henning
#t2012
#cDiscrete Applied Mathematics
#index3393265
#%836438
#%837252
#%851783
#%2921425
#!
  
#*The asymptotic behavior of some indices of iterated line graphs of regular graphs.
#@Weigen Yan,Yeong-Nan Yeh,Fuji Zhang
#t2012
#cDiscrete Applied Mathematics
#index3393255
#%838534
#%1270361
#!
  
#*On the (h, k)-domination numbers of iterated line digraphs.
#@Toru Hasunuma,Mayu Otani
#t2012
#cDiscrete Applied Mathematics
#index3393328
#%750111
#%838613
#%847208
#%847634
#%851783
#%975409
#%1024273
#%1090070
#%1095738
#%1096491
#%1227752
#%1270212
#%1276067
#%3612079
#!
  
#*A strengthened analysis of an algorithm for Dominating Set in planar graphs.
#@Torben Hagerup
#t2012
#cDiscrete Applied Mathematics
#index3393300
#%186102
#%493919
#%949620
#%952547
#%971380
#%1060735
#!
  
#*Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms.
#@Tomás Feder,Pavol Hell,Jing Huang,Arash Rafiey
#t2012
#cDiscrete Applied Mathematics
#index3393315
#%837741
#%838419
#%839231
#%851168
#%971578
#%975607
#%1091696
#%1341653
#%2853924
#%3028081
#%3161820
#%3480154
#!
  
#*The sum choice number of P P.
#@Brian Heinold
#t2012
#cDiscrete Applied Mathematics
#index3393304
#% 
#!
  
#*Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids.
#@Sarah Spence Adams,Paul Booth,Denise Sakai Troxell,S. Luke Zinnen
#t2012
#cDiscrete Applied Mathematics
#index3393329
#%268734
#%472900
#%836807
#%836808
#%837826
#%974614
#%1061633
#%1270349
#%2779813
#%3130367
#%3266120
#!
  
#*Upper bounds on the Steiner diameter of a graph.
#@Patrick Ali,Peter Dankelmann,Simon Mukwembi
#t2012
#cDiscrete Applied Mathematics
#index3393279
#%975528
#!
  
#*Edge contractions in subclasses of chordal graphs.
#@Rémy Belmonte,Pinar Heggernes,Pim van 't Hof
#t2012
#cDiscrete Applied Mathematics
#index3393271
#%621355
#%838324
#%853418
#%977721
#%1024835
#%1024847
#%1309982
#%2786073
#%3028461
#%3077088
#%3192539
#%3267972
#!
  
#*A note on the parameterized complexity of unordered maximum tree orientation.
#@Sebastian Böcker,Peter Damaschke
#t2012
#cDiscrete Applied Mathematics
#index3393262
#%650747
#%973165
#%1016232
#%1265303
#%1308313
#%2869658
#%3215872
#!
  
#*An approximation algorithm for the Generalized k-Multicut problem.
#@Peng Zhang,Daming Zhu,Junfeng Luan
#t2012
#cDiscrete Applied Mathematics
#index3393257
#%46573
#%94894
#%610696
#%652534
#%823253
#%838939
#%971645
#%1013159
#%1013384
#%1058998
#%1059341
#%1059290
#%1316607
#%623387
#!
  
#*Acute triangulations of convex quadrilaterals.
#@Maddalena Cavicchioli
#t2012
#cDiscrete Applied Mathematics
#index3393264
#%467048
#%2857000
#!
  
#*An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
#@Ji Tian,T. C. E. Cheng,C. T. Ng,Jinjiang Yuan
#t2012
#cDiscrete Applied Mathematics
#index3393275
#%1061506
#%1095594
#%3126673
#%3128570
#!
  
#*The complexity of minimum convex coloring.
#@Frank Kammer,Torsten Tholey
#t2012
#cDiscrete Applied Mathematics
#index3393311
#%416177
#%621263
#%626075
#%652519
#%952731
#%973242
#%973330
#%977721
#%1058651
#%1206305
#%3146197
#!
  
#*Multiple factor Nordhaus-Gaddum type results for domination and total domination.
#@Michael A. Henning,Ernst J. Joubert,Justin Southey
#t2012
#cDiscrete Applied Mathematics
#index3393369
#%838075
#%847783
#%854219
#%2921357
#!
  
#*The complexity of flood-filling games on graphs.
#@Kitty Meeks,Alexander Scott
#t2012
#cDiscrete Applied Mathematics
#index3393334
#%1335643
#%2022
#%2823991
#!
  
#*Acyclic edge colouring of plane graphs.
#@Anna Fiedorowicz
#t2012
#cDiscrete Applied Mathematics
#index3393341
#%17100
#%622762
#%933907
#%935134
#%1051754
#%1343069
#%2872679
#%2872615
#%2923729
#%3066816
#%3066861
#%3480347
#!
  
#*A note on planar graphs with large width parameters and small grid-minors.
#@Alexander Grigoriev,Bert Marchal,Natalya Usotskaya,Ioan Todinca
#t2012
#cDiscrete Applied Mathematics
#index3393359
#%611909
#%750912
#%977725
#%977717
#%977921
#!
  
#*Vertex-magic labeling of regular graphs: Disjoint unions and assemblages.
#@I. D. Gray,Jim A. MacDougall
#t2012
#cDiscrete Applied Mathematics
#index3393338
#%1061963
#!
  
#*The competition numbers of complete multipartite graphs with many partite sets.
#@Suh-Ryung Kim,Boram Park,Yoshio Sano
#t2012
#cDiscrete Applied Mathematics
#index3393339
#%839029
#!
  
#*The solution and applications of a combinatorial problem.
#@Gaokui Xu,Shengjia Li,Qiaoping Guo,Hongwei Li
#t2012
#cDiscrete Applied Mathematics
#index3393353
#% 
#!
  
#*Trimming weighted graphs of bounded treewidth.
#@David Knipe
#t2012
#cDiscrete Applied Mathematics
#index3393349
#%2866588
#!
  
#*Edge search number of cographs.
#@Petr A. Golovach,Pinar Heggernes,Rodica Mihai
#t2012
#cDiscrete Applied Mathematics
#index3393358
#%625958
#%660858
#%661054
#%661024
#%701351
#%701440
#%750895
#%837015
#%838784
#%852826
#%887763
#%950952
#%951151
#%952688
#%953568
#%971578
#%1061054
#%1092604
#%1093978
#%1094849
#%1096114
#%1096102
#%1215881
#!
  
#*Spans of preference functions for de Bruijn sequences.
#@Abbas Alhakim
#t2012
#cDiscrete Applied Mathematics
#index3393335
#% 
#!
  
#*L(2, 1)-labelling of generalized prisms.
#@Karina Chudá,Martin Skoviera
#t2012
#cDiscrete Applied Mathematics
#index3393344
#%611669
#%847714
#%1061385
#%1061419
#%1061383
#!
  
#*Local maximum stable set greedoids stemming from very well-covered graphs.
#@Vadim E. Levit,Eugen Mandrescu
#t2012
#cDiscrete Applied Mathematics
#index3393347
#%79048
#%204226
#%701359
#%837084
#%837520
#%837522
#%838734
#%854809
#%975646
#%2818775
#%2857096
#!
  
#*Radial Moore graphs of radius three.
#@Geoffrey Exoo,Joan Gimbert,Nacho López,José Gómez
#t2012
#cDiscrete Applied Mathematics
#index3393361
#%979661
#%1079775
#%1079783
#%2926183
#!
  
#*On α-total domination in graphs.
#@Michael A. Henning,Nader Jafari Rad
#t2012
#cDiscrete Applied Mathematics
#index3393346
#% 
#!
  
#*On graph contractions and induced minors.
#@Pim van 't Hof,Marcin Kaminski,Daniël Paulusma,Stefan Szeider,Dimitrios M. Thilikos
#t2012
#cDiscrete Applied Mathematics
#index3393336
#%105019
#%219626
#%621511
#%803601
#%853418
#%887537
#%977721
#%977703
#%1024835
#%1024847
#!
  
#*On generalized Fibonacci numbers and k-distance K-matchings in graphs.
#@Andrzej Wloch
#t2012
#cDiscrete Applied Mathematics
#index3393332
#% 
#!
  
#*On the reciprocal degree distance of graphs.
#@Hongbo Hua,Shenggui Zhang
#t2012
#cDiscrete Applied Mathematics
#index3393342
#%838766
#%839008
#%1270338
#%2857078
#%2857115
#%3066806
#!
  
#*On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets.
#@Kiavash Kianfar
#t2012
#cDiscrete Applied Mathematics
#index3393351
#%837889
#%1013544
#%1340650
#%3007117
#!
  
#*On graphs for which the connected domination number is at most the total domination number.
#@Oliver Schaudt
#t2012
#cDiscrete Applied Mathematics
#index3393337
#%930005
#%1062020
#!
  
#*The complexity of surjective homomorphism problems - a survey.
#@Manuel Bodirsky,Jan Kára,Barnaby Martin
#t2012
#cDiscrete Applied Mathematics
#index3393333
#%1061081
#%2793746
#%949902
#%3161820
#%1058764
#%1062055
#%2854208
#%975607
#%3480154
#%1059157
#%1091099
#%1096564
#%3012053
#%1307647
#%1092339
#%1059676
#%837419
#%950956
#%951995
#%3063530
#%623072
#%3066805
#%2869678
#%1060601
#%1060602
#%973075
#%973076
#%3227255
#!
  
#*Super restricted edge connectivity of regular edge-transitive graphs.
#@Jin-Xin Zhou
#t2012
#cDiscrete Applied Mathematics
#index3393360
#%847051
#%849145
#%931027
#%977125
#%978748
#%979429
#%1024848
#%1024840
#%1079135
#!
  
#*On the size of identifying codes in triangle-free graphs.
#@Florent Foucaud,Ralf Klasing,Adrian Kosowski,André Raspaud
#t2012
#cDiscrete Applied Mathematics
#index3393355
#%864090
#%864512
#%1338685
#%2854235
#%2858686
#%3138262
#%3612438
#!
  
#*Greedy colorings of words.
#@Dieter Rautenbach,Zoltán Szigeti
#t2012
#cDiscrete Applied Mathematics
#index3393370
#%836693
#%1270214
#%2863988
#%3073064
#!
  
#*The hamiltonicity and path t-coloring of Sierpiński-like graphs.
#@Bing Xue,Liancui Zuo,Guojun Li
#t2012
#cDiscrete Applied Mathematics
#index3393366
#% 
#!
  
#*Collapsible graphs and Hamiltonian connectedness of line graphs.
#@Weihua Yang,Hong-Jian Lai,Hao Li,Xiaofeng Guo
#t2012
#cDiscrete Applied Mathematics
#index3393363
#%852906
#%854349
#%931027
#%977790
#%978717
#%1144381
#%1270138
#%2919143
#%2979652
#%3366574
#!
  
#*The interval ordering problem.
#@Christoph Dürr,Maurice Queyranne,Frits C. R. Spieksma,Fabrice Talla Nobibon,Gerhard J. Woeginger
#t2012
#cDiscrete Applied Mathematics
#index3393345
#% 
#!
  
#*The minimum identifying code graphs.
#@André Raspaud,Li-Da Tong
#t2012
#cDiscrete Applied Mathematics
#index3393352
#%16782
#%1089985
#!
  
#*Restricted arc-connectivity of generalized p-cycles.
#@Camino Balbuena,Pedro García-Vázquez,A. Hansberg,Luis Pedro Montejano
#t2012
#cDiscrete Applied Mathematics
#index3393348
#%836964
#%851785
#%934871
#%1276233
#!
  
#*Polynomial-time recognition of clique-width ≤3 graphs.
#@Derek G. Corneil,Michel Habib,Jean-Marc Lanlignel,Bruce A. Reed,Udi Rotics
#t2012
#cDiscrete Applied Mathematics
#index3393340
#% 
#!
  
#*Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products.
#@Eddie Cheng,László Lipták
#t2012
#cDiscrete Applied Mathematics
#index3393367
#%1024756
#%1227610
#%1276604
#%2919136
#%3070087
#%3130308
#!
  
#*The maximum degree and diameter-bounded subgraph in the mesh.
#@Mirka Miller,Hebert Pérez-Rosés,Joe Ryan
#t2012
#cDiscrete Applied Mathematics
#index3393362
#%1061265
#%832807
#%661016
#!
  
#*Total colorings of planar graphs without intersecting 5-cycles.
#@Bing Wang,Jian-Liang Wu
#t2012
#cDiscrete Applied Mathematics
#index3393357
#%852402
#%864200
#%1270171
#%1341525
#%2921530
#%2967274
#%3066813
#%3128582
#!
  
#*Balanced k-decompositions of graphs.
#@Hsiang-Chun Hsu,Gerard Jennhwa Chang
#t2012
#cDiscrete Applied Mathematics
#index3393364
#%839015
#%2975799
#!
  
#*Cournot tâtonnement and dominance solvability in finite games.
#@Nikolai S. Kukushkin
#t2012
#cDiscrete Applied Mathematics
#index3393350
#% 
#!
  
#*Vector bin packing with multiple-choice.
#@Boaz Patt-Shamir,Dror Rawitz
#t2012
#cDiscrete Applied Mathematics
#index3393368
#%2616
#%211097
#%212114
#%277994
#%812096
#%889952
#%950753
#%951513
#%1058877
#%1059237
#%1060414
#%1060110
#%1060706
#!
  
#*Clawfreeness of the powers of a graph.
#@Patrick Bahls,Nicole A. Gin
#t2012
#cDiscrete Applied Mathematics
#index3393354
#%798817
#%1144546
#!
  
#*The stochastic generalized bin packing problem.
#@Guido Perboli,Roberto Tadei,Mauro Maria Baldi
#t2012
#cDiscrete Applied Mathematics
#index3393343
#%210716
#%1060256
#%1288640
#%3063555
#!
  
#*Restricted vertex multicut on permutation graphs.
#@Charis Papadopoulos
#t2012
#cDiscrete Applied Mathematics
#index3393365
#%269277
#%661068
#%952687
#%952981
#%1058998
#%1059290
#%1061054
#%1093311
#%1242939
#%1276235
#%2869683
#%2917959
#%2918070
#%3028386
#%3028366
#!
  
#*A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs.
#@Sandi Klavzar,Khaled Salem
#t2012
#cDiscrete Applied Mathematics
#index3393356
#%838389
#%1341637
#%2857101
#!
  
#*Dynamic chromatic number of regular graphs.
#@Meysam Alishahi
#t2012
#cDiscrete Applied Mathematics
#index3480964
#%1270340
#%2967277
#!
  
#*One-to-many node-disjoint paths of hyper-star networks.
#@László Lipták,Eddie Cheng,Jong-Seok Kim,Sung Won Kim
#t2012
#cDiscrete Applied Mathematics
#index3480934
#%191433
#%942261
#%942716
#%942992
#%951394
#%975766
#%988689
#%1079924
#%1092851
#%1215857
#%2922166
#%3454319
#!
  
#*Locating-total domination in graphs.
#@Michael A. Henning,Nader Jafari Rad
#t2012
#cDiscrete Applied Mathematics
#index3480944
#%837100
#%1336376
#%3066828
#%3612438
#!
  
#*Pooling designs with surprisingly high degree of error correction in a finite vector space.
#@Jun Guo,Kaishun Wang
#t2012
#cDiscrete Applied Mathematics
#index3480955
#%848643
#%3073007
#!
  
#*Maximal hypercubes in Fibonacci and Lucas cubes.
#@Michel Mollard
#t2012
#cDiscrete Applied Mathematics
#index3480913
#%848604
#!
  
#*Improving the extraction and expansion method for large graph coloring.
#@Jin-Kao Hao,Qinghua Wu
#t2012
#cDiscrete Applied Mathematics
#index3480953
#%28122
#%549905
#%812787
#%814813
#%838242
#%838753
#%838779
#%838911
#%924317
#%2852928
#%2919151
#%3063608
#%3088942
#%3212151
#!
  
#*Online maximum k-coverage.
#@Giorgio Ausiello,Nicolas Boria,Aristotelis Giannakos,Giorgio Lucarelli,Vangelis Th. Paschos
#t2012
#cDiscrete Applied Mathematics
#index3480925
#%212228
#%406670
#%621326
#%832933
#%952914
#%1279079
#%1341501
#!
  
#*Characterization of removable elements with respect to having k disjoint bases in a matroid.
#@Ping Li,Hong-Jian Lai,Yanting Liang
#t2012
#cDiscrete Applied Mathematics
#index3480916
#%836358
#%839054
#%848677
#%853577
#%2857116
#!
  
#*Lower bounds for Ramsey numbers of K with a small subgraph removed.
#@Ye Wang,Yusheng Li
#t2012
#cDiscrete Applied Mathematics
#index3480946
#% 
#!
  
#*The global forcing number of the parallelogram polyhex.
#@Jelena Sedlar
#t2012
#cDiscrete Applied Mathematics
#index3480943
#%837313
#%837359
#%838389
#%848812
#%852067
#%1092865
#!
  
#*Maximum weight independent sets in hole- and dart-free graphs.
#@Manu Basavaraju,L. Sunil Chandran,T. Karthick
#t2012
#cDiscrete Applied Mathematics
#index3480963
#%837151
#%839265
#%933950
#%979698
#%1095504
#%1095924
#%2868703
#%3245747
#%3319808
#!
  
#*Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation.
#@Andreas Wotzlaw,Ewald Speckenmeyer,Stefan Porschen
#t2012
#cDiscrete Applied Mathematics
#index3480938
#%12217
#%16261
#%211148
#%391357
#%558731
#%623268
#%736388
#%763563
#%838580
#%950704
#%2818934
#%2863788
#%2911196
#%3027457
#%3079648
#!
  
#*Enumeration formula for (2, n)-cubes in discrete planes.
#@Eric Domenjoud,Damien Jamet,Damien Vergnaud,Laurent Vuillon
#t2012
#cDiscrete Applied Mathematics
#index3480961
#%153923
#%154227
#%1031106
#%1093487
#%1333541
#!
  
#*The matching energy of a graph.
#@Ivan Gutman,Stephan Wagner
#t2012
#cDiscrete Applied Mathematics
#index3480956
#% 
#!
  
#*Minimizing a sum of submodular functions.
#@Vladimir Kolmogorov
#t2012
#cDiscrete Applied Mathematics
#index3480935
#%127873
#%130598
#%611789
#%811989
#%836303
#%836863
#%931909
#%950462
#%1031246
#%1273631
#%1340605
#%2965811
#!
  
#*Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number.
#@A. Dehghan,A. Ahadi
#t2012
#cDiscrete Applied Mathematics
#index3480917
#%1095847
#%1270340
#%2919142
#!
  
#*Matching preclusion and conditional matching preclusion for regular interconnection networks.
#@Eddie Cheng,Marc J. Lipman,László Lipták
#t2012
#cDiscrete Applied Mathematics
#index3480924
#%941084
#%1024756
#%1079760
#%1125127
#%1227610
#%1276604
#%2866889
#%2919136
#%3070087
#%3130268
#%3393367
#%3454323
#%3454319
#!
  
#*Rooted tree statistics from Matula numbers.
#@Emeric Deutsch
#t2012
#cDiscrete Applied Mathematics
#index3480942
#%194417
#%854075
#%1336402
#%3006037
#!
  
#*On real number labelings and graph invertibility.
#@Jeong-Ok Choi,John P. Georges,David W. Mauro,Yan Wang
#t2012
#cDiscrete Applied Mathematics
#index3480962
#%854494
#%1061385
#%1061419
#%1062026
#%1061914
#%1270136
#%1336377
#%1341526
#%1341592
#!
  
#*Minsum hyperspheres in normed spaces.
#@Mark-Christoph Körner,Horst Martini,Anita Schöbel
#t2012
#cDiscrete Applied Mathematics
#index3480969
#%111182
#%812656
#%1270350
#%3135772
#!
  
#*On graphs which can or cannot induce Chinese Postman games with a non-empty core.
#@Daniel Granot,Frieda Granot
#t2012
#cDiscrete Applied Mathematics
#index3480909
#%836974
#!
  
#*Relations between gene regulatory networks and cell dynamics in Boolean models.
#@Gilles Didier,Elisabeth Remy
#t2012
#cDiscrete Applied Mathematics
#index3480936
#%838724
#%1130717
#!
  
#*The root location problem for arc-disjoint arborescences.
#@Satoru Fujishige,Naoyuki Kamiyama
#t2012
#cDiscrete Applied Mathematics
#index3480914
#%415624
#%623072
#%952499
#%1114204
#%1334106
#%1336366
#%2965448
#!
  
#*k-colored kernels.
#@Hortensia Galeana-Sánchez,Bernardo Llano,Juan José Montellano-Ballesteros
#t2012
#cDiscrete Applied Mathematics
#index3480947
#%851929
#!
  
#*Propagation time for zero forcing on a graph.
#@Leslie Hogben,My Huynh,Nicole Kingsley,Sarah Meyer,Shanise Walker,Michael Young
#t2012
#cDiscrete Applied Mathematics
#index3480923
#% 
#!
  
#*On the absolute approximation ratio for First Fit and related results.
#@Joan Boyar,György Dósa,Leah Epstein
#t2012
#cDiscrete Applied Mathematics
#index3480915
#%611536
#%611749
#%776121
#%827461
#%972333
#%1077339
#%1215010
#%2857108
#%2869620
#!
  
#*On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes.
#@Yoshikazu Aoshima,David Avis,Theresa Deering,Yoshitake Matsumoto,Sonoko Moriyama
#t2012
#cDiscrete Applied Mathematics
#index3480948
#%111308
#%622390
#%798497
#%839305
#%3215899
#!
  
#*Some results on Vizing's conjecture and related problems.
#@Marcin Pilipczuk,Michal Pilipczuk,Riste Skrekovski
#t2012
#cDiscrete Applied Mathematics
#index3480941
#%836802
#%1061333
#!
  
#*Multiflows in symmetric digraphs.
#@Aubin Jarry
#t2012
#cDiscrete Applied Mathematics
#index3480954
#%838291
#%839095
#%977721
#%1090915
#%1334099
#%3191060
#!
  
#*Small components in k-nearest neighbour graphs.
#@Mark Walters
#t2012
#cDiscrete Applied Mathematics
#index3480922
#%1141499
#!
  
#*On Opsut's conjecture for hypercompetition numbers of hypergraphs.
#@Boram Park,Suh-Ryung Kim
#t2012
#cDiscrete Applied Mathematics
#index3480919
#%838053
#%2921507
#!
  
#*On the Roman domination in the lexicographic product of graphs.
#@Tadeja Kraner Sumenjak,Polona Pavlic,Aleksandra Tepeh
#t2012
#cDiscrete Applied Mathematics
#index3480967
#%1270204
#%1341588
#%3066769
#!
  
#*Analysis of a multi-category classifier.
#@Martin Anthony,Joel Ratsaby
#t2012
#cDiscrete Applied Mathematics
#index3480940
#%830806
#%837056
#%888180
#%949637
#%949807
#%1013425
#%1058739
#%1104159
#%1112474
#%3253423
#%3319782
#!
  
#*The total bondage number of grid graphs.
#@Fu-Tao Hu,You Lu,Jun-Ming Xu
#t2012
#cDiscrete Applied Mathematics
#index3480958
#%836978
#%847580
#%848101
#%848376
#%852103
#%852815
#%854898
#%2991044
#%2990677
#%3356803
#!
  
#*Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width.
#@Gregory Gutin,Anders Yeo
#t2012
#cDiscrete Applied Mathematics
#index3480949
#%623362
#%836271
#%862104
#%950618
#%952567
#%973358
#%1052043
#%2973481
#%3268122
#!
  
#*Cluster editing with locally bounded modifications.
#@Christian Komusiewicz,Johannes Uhlmann
#t2012
#cDiscrete Applied Mathematics
#index3480910
#%741094
#%838073
#%950366
#%972274
#%1009272
#%1015519
#%1096414
#%1209575
#%1343064
#%2951337
#%2951327
#%3060807
#%3071149
#%3268129
#%3319828
#!
  
#*Scheduling tasks with exponential duration on unrelated parallel machines.
#@Mostafa Nouri,Mohammad Ghodsi
#t2012
#cDiscrete Applied Mathematics
#index3480970
#%614466
#%614676
#%820214
#%949884
#%973054
#%1013772
#%1029756
#!
  
#*Compact MILP models for optimal and Pareto-optimal LAD patterns.
#@Cui Guo,Hong Seo Ryoo
#t2012
#cDiscrete Applied Mathematics
#index3480930
#%751998
#%835932
#%837055
#%838842
#%838712
#%930086
#%1009539
#%1013425
#%1112474
#%1270160
#!
  
#*Kernelization hardness of connectivity problems in d-degenerate graphs.
#@Marek Cygan,Marcin Pilipczuk,Michal Pilipczuk,Jakub Onufry Wojtaszczyk
#t2012
#cDiscrete Applied Mathematics
#index3480937
#%661033
#%827719
#%830433
#%952767
#%978215
#%1209565
#%1219437
#%1269205
#%1308305
#%1322400
#%1338606
#%2816141
#%2817180
#%2820933
#%2863959
#%2919700
#%2924992
#%3017332
#%3065532
#%3067492
#%3130283
#%3151620
#%3273962
#%3274716
#%3274786
#%3274758
#!
  
#*Dense and sparse graph partition.
#@Julien Darlay,Nadia Brauner,Julien Moncel
#t2012
#cDiscrete Applied Mathematics
#index3480928
#%46538
#%612102
#%824573
#%1032967
#%1033810
#%1112474
#%1340461
#!
  
#*Scheduling coupled-operation jobs with exact time-lags.
#@Alessandro Condotta,Natalia V. Shakhlevich
#t2012
#cDiscrete Applied Mathematics
#index3480968
#%652546
#%837230
#%837866
#%1029994
#%1054464
#%1080475
#%1336385
#%2856995
#%3005546
#%2926875
#!
  
#*Distance edge-colourings and matchings.
#@Ross J. Kang,Putra Manggala
#t2012
#cDiscrete Applied Mathematics
#index3480911
#%830820
#%830996
#%851309
#%977268
#%979582
#%1061359
#!
  
#*An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path.
#@Alewyn P. Burger,M. van der Merwe,Jan H. van Vuuren
#t2012
#cDiscrete Applied Mathematics
#index3480939
#% 
#!
  
#*Scenario based robust line balancing: Computational complexity.
#@Alexandre Dolgui,Sergey Kovalev
#t2012
#cDiscrete Applied Mathematics
#index3480950
#%773172
#%838744
#%839048
#%2857008
#%2882528
#%2884669
#%3144757
#!
  
#*Reconfiguration of list edge-colorings in a graph.
#@Takehiro Ito,Marcin Kaminski,Erik D. Demaine
#t2012
#cDiscrete Applied Mathematics
#index3480957
#%972920
#%974774
#%1060926
#%1062073
#%1091845
#%1215000
#%1343032
#%2856616
#%2939940
#%3035953
#%3079915
#!
  
#*Necessary conditions and frame constructions for Z-cyclic patterned starter whist tournaments.
#@Sihuang Hu,Gennian Ge
#t2012
#cDiscrete Applied Mathematics
#index3480929
#%836772
#%974349
#%979154
#%2890841
#%3066831
#!
  
#*Cyclic Boolean circuits.
#@Marc D. Riedel,Jehoshua Bruck
#t2012
#cDiscrete Applied Mathematics
#index3480931
#%3670
#%133631
#%283748
#%833029
#%887699
#%951106
#%1081611
#%2944577
#%3004884
#!
  
#*Generalized roof duality.
#@Fredrik Kahl,Petter Strandmark
#t2012
#cDiscrete Applied Mathematics
#index3480951
#%127873
#%168352
#%168783
#%836271
#%1031248
#%1033676
#%1061363
#%1189461
#%1280198
#%2867197
#%2899713
#%2965811
#%2987840
#%3077720
#%3172299
#%3221727
#%3286667
#%3286465
#%3319779
#!
  
#*Computing the permanental polynomials of bipartite graphs by Pfaffian orientation.
#@Heping Zhang,Wei Li
#t2012
#cDiscrete Applied Mathematics
#index3480927
#%838389
#!
  
#*The Wiener index in iterated line graphs.
#@Martin Knor,Primoz Potocnik,Riste Skrekovski
#t2012
#cDiscrete Applied Mathematics
#index3480918
#%837331
#%849262
#%1144432
#!
  
#*On n-fold L(j, k)-and circular L(j, k)-labelings of graphs.
#@Wensong Lin,Pu Zhang
#t2012
#cDiscrete Applied Mathematics
#index3480960
#%847716
#%848356
#%854494
#%1061170
#%1061419
#%1062026
#!
  
#*A mixed integer programming model for the cyclic job-shop problem with transportation.
#@Peter Brucker,Edmund K. Burke,Sven Groenemeyer
#t2012
#cDiscrete Applied Mathematics
#index3480932
#%774915
#%837523
#%838881
#%1054402
#%1132667
#!
  
#*LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.
#@Archontia C. Giannopoulou,Paul Hunter,Dimitrios M. Thilikos
#t2012
#cDiscrete Applied Mathematics
#index3480971
#%494493
#%611130
#%619935
#%620126
#%622810
#%853875
#%864887
#%865402
#%865466
#%950952
#%952688
#%976458
#%977921
#%979169
#%1061052
#%1092604
#%1308317
#%3064966
#%3113272
#%3205463
#!
  
#*Distance spectral spread of a graph.
#@Guanglong Yu,Hailiang Zhang,Huiqiu Lin,Yarong Wu,Jinlong Shu
#t2012
#cDiscrete Applied Mathematics
#index3480965
#%2857113
#!
  
#*The maximal energy of classes of integral circulant graphs.
#@J. W. Sander,T. Sander
#t2012
#cDiscrete Applied Mathematics
#index3480926
#%832629
#%2991125
#!
  
#*On r-acyclic edge colorings of planar graphs.
#@Xin Zhang,Guanghui Wang,Yong Yu,Jinbo Li,Guizhen Liu
#t2012
#cDiscrete Applied Mathematics
#index3480945
#%622762
#%852580
#%935134
#%977820
#%1051754
#%1144449
#%2872679
#%2975769
#!
  
#*A characterization of diameter-2-critical graphs whose complements are diamond-free.
#@Teresa W. Haynes,Michael A. Henning
#t2012
#cDiscrete Applied Mathematics
#index3480921
#%850745
#%1144373
#%3126700
#!
  
#*Deterministic algorithms for multi-criteria Max-TSP.
#@Bodo Manthey
#t2012
#cDiscrete Applied Mathematics
#index3480912
#%46742
#%46706
#%186658
#%211553
#%750966
#%826839
#%827665
#%829353
#%950834
#%951251
#%1237739
#%3375761
#!
  
#*H-force sets of locally semicomplete digraphs.
#@Xinhong Zhang,Ruijuan Li,Shengjia Li
#t2012
#cDiscrete Applied Mathematics
#index3480952
#%837214
#%852606
#%976317
#%2872674
#%2872636
#!
  
#*A Riemann hypothesis analogue for near-MDS codes.
#@Dong Chan Kim,Jong Yoon Hyun
#t2012
#cDiscrete Applied Mathematics
#index3480966
#%838961
#!
  
#*Competition numbers of complete r-partite graphs.
#@Bo-Jr Li,Gerard J. Chang
#t2012
#cDiscrete Applied Mathematics
#index3480933
#%837358
#%839029
#%1270320
#%2857083
#%3245403
#%3393339
#!
  
#*Range minimization problems in path-facility location on trees.
#@Justo Puerto,Federica Ricca,Andrea Scozzari
#t2012
#cDiscrete Applied Mathematics
#index3480920
#%812140
#%481153
#%836313
#%3077044
#%837672
#%1270274
#%1024910
#%1024721
#%1014111
#%838166
#%1029767
#%838168
#!
  
#*Integer and fractional security in graphs.
#@Garth Isaak,Peter Johnson,Caleb Petrie
#t2012
#cDiscrete Applied Mathematics
#index3480959
#%838567
#!
  
#*Harmonious chromatic number of directed graphs.
#@Keith J. Edwards
#t2013
#cDiscrete Applied Mathematics
#index3595693
#% 
#!
  
#*Recognition of probe distance-hereditary graphs.
#@Maw-Shang Chang,Ling-Ju Hung,Peter Rossmanith
#t2013
#cDiscrete Applied Mathematics
#index3595684
#%17138
#%17050
#%105649
#%610809
#%620560
#%660694
#%660514
#%836957
#%839425
#%953010
#%974454
#%977408
#%1058996
#%1061985
#%1077234
#%1096043
#%1265286
#%1270225
#%1343026
#%3080031
#!
  
#*Transversals and competition numbers of complete multipartite graphs.
#@Jaromy Kuhl
#t2013
#cDiscrete Applied Mathematics
#index3595686
#% 
#!
  
#*Fibonacci (p, r)-cubes which are median graphs.
#@Lifeng Ou,Heping Zhang
#t2013
#cDiscrete Applied Mathematics
#index3595692
#%740974
#%848604
#%1062021
#%1112002
#%1125591
#!
  
#*The maximum number of minimal codewords in long codes.
#@Adel Alahmadi,Robert E. L. Aldred,Romar dela Cruz,Patrick Solé,Carsten Thomassen
#t2013
#cDiscrete Applied Mathematics
#index3595687
#%16549
#%1103857
#%1103940
#%1104967
#%1144639
#!
  
#*Excluding a small minor.
#@Guoli Ding,Cheng Liu
#t2013
#cDiscrete Applied Mathematics
#index3595685
#%977087
#%977699
#%3391121
#!
  
#*On dominating sets of maximal outerplanar graphs.
#@C. N. Campos,Y. Wakabayashi
#t2013
#cDiscrete Applied Mathematics
#index3595691
#%864844
#%2857063
#%2857097
#%2872663
#!
  
#*Bicyclic graphs with extremal values of PI index.
#@Zana Kovijanic Vukicevic,Dragan Stevanovic
#t2013
#cDiscrete Applied Mathematics
#index3595682
#% 
#!
  
#*Panconnectivity of n-dimensional torus networks with faulty vertices and edges.
#@Jun Yuan,Aixia Liu,Hongmei Wu,Jing Li
#t2013
#cDiscrete Applied Mathematics
#index3595683
#%341943
#%942404
#%942381
#%990271
#%990224
#%1078063
#%1125127
#%1124966
#%1125588
#%1126354
#%1276680
#%1276683
#%1282172
#%1341557
#%2875684
#%2967272
#!
  
#*Super restricted edge-connectivity of graphs with diameter 2.
#@Li Shang,Heping Zhang
#t2013
#cDiscrete Applied Mathematics
#index3595690
#%839011
#%931027
#%1024840
#%1270272
#%1276158
#%2926171
#!
  
#*Stability measure for a generalized assembly line balancing problem.
#@Evgeny Gurevsky,Olga Batta?a,Alexandre Dolgui
#t2013
#cDiscrete Applied Mathematics
#index3595680
#%814740
#%1014131
#%1189493
#%3318775
#!
  
#*Faster optimal algorithms for segment minimization with small maximal value.
#@Therese C. Biedl,Stephane Durocher,Céline Engelbeen,Samuel Fiorini,Maxwell Young
#t2013
#cDiscrete Applied Mathematics
#index3595689
#%46664
#%118168
#%118298
#%415329
#%569952
#%815055
#%934811
#%934801
#%1270393
#%2972277
#%3210215
#!
  
#*Relating the annihilation number and the total domination number of a tree.
#@Wyatt J. Desormeaux,Teresa W. Haynes,Michael A. Henning
#t2013
#cDiscrete Applied Mathematics
#index3595688
#%837100
#%852828
#%1144588
#%2851828
#%3066828
#!
  
#*A note on periodic schedules for linear precedence constraints.
#@Vladimir Kats,Eugene Levner
#t2013
#cDiscrete Applied Mathematics
#index3595681
#%837523
#%837745
#%839061
#%951147
#%3078477
#%3145848
#!
  
#*On minimally rainbow -connected graphs.
#@Ingo Schiermeyer
#t2013
#cDiscrete Applied Mathematics
#index3654990
#% 
#!
  
#*(, )-codes in /.
#@Sylvain Gravier,Anne Lacroix,Souad Slimani
#t2013
#cDiscrete Applied Mathematics
#index3654989
#% 
#!
  
#*Set graphs. I. Hereditarily finite sets and extensional acyclic orientations.
#@Martin Milanic,Alexandru I. Tomescu
#t2013
#cDiscrete Applied Mathematics
#index3655003
#%66580
#%622327
#%623215
#%887537
#%954960
#%1089985
#%1093049
#%1104770
#%1106770
#%1123430
#%1240599
#%1335400
#%2777448
#%3169428
#!
  
#*An integer optimization approach for reverse engineering of gene regulatory networks.
#@Roberto Cordone,Guglielmo Lulli
#t2013
#cDiscrete Applied Mathematics
#index3655002
#%156684
#%763247
#%812882
#%813608
#%1034273
#%1270137
#!
  
#*The ordered anti-median problem with distances derived from a strictly convex norm.
#@Antonio J. Lozano,Juan A. Mesa,Frank Plastria
#t2013
#cDiscrete Applied Mathematics
#index3654997
#%837195
#%2852133
#%2852910
#%2867023
#!
  
#*GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.
#@Marc Demange,Vadim V. Lozin,Christophe Picouleau,Bernard Ries
#t2013
#cDiscrete Applied Mathematics
#index3654991
#% 
#!
  
#*Fast algorithms for min independent dominating set.
#@Nicolas Bourgeois,Federico Della Croce,Bruno Escoffier,Vangelis Th. Paschos
#t2013
#cDiscrete Applied Mathematics
#index3655004
#%415395
#%465756
#%465746
#%660398
#%660658
#%931565
#%931986
#%1025658
#%1029277
#%1061520
#%1090494
#%1096539
#%1222452
#%1222833
#%1276082
#%1276102
#%1277117
#%1308321
#%2814920
#%2869677
#%3160098
#%3160123
#!
  
#*Resilience and optimization of identifiable bipartite graphs.
#@Epameinondas Fritzilas,Martin Milanic,Jér?me Monnot,Yasmin A. Rios-Solis
#t2013
#cDiscrete Applied Mathematics
#index3654994
#%838435
#%936710
#%1052495
#%1086956
#%1332006
#%1342966
#!
  
#*b-colouring the Cartesian product of trees and some other graphs.
#@Frédéric Maffray,Ana Silva
#t2013
#cDiscrete Applied Mathematics
#index3655005
#%660803
#%837221
#%1270382
#!
  
#*The uncapacitated swapping problem on a line and on a circle.
#@Shoshana Anily,Aharona Pfeffer
#t2013
#cDiscrete Applied Mathematics
#index3654996
#%838434
#%924216
#%952948
#%1058381
#%1058463
#%1058798
#%1059213
#%2852861
#%3133715
#!
  
#*The periodic capacitated arc routing problem with irregular services.
#@I. M. Monroy,Ciro-Alberto Amaya,André Langevin
#t2013
#cDiscrete Applied Mathematics
#index3654993
#%812194
#%812854
#%814394
#%1029825
#%1288405
#%2926195
#!
  
#*Tight compact models and comparative analysis for the prize collecting Steiner tree problem.
#@Mohamed Haouari,Safa Bhar Layeb,Hanif D. Sherali
#t2013
#cDiscrete Applied Mathematics
#index3654999
#%610807
#%836970
#%837594
#%837894
#%838097
#%885625
#%951211
#%1013384
#%1024718
#%1024752
#%1024906
#%1029799
#%1189391
#%1270174
#%1290170
#%2852988
#%2882513
#%3458423
#!
  
#*An independent set approach for the communication network of the GPS III system.
#@Gunnar Brinkmann,Simon Crevals,John Frye
#t2013
#cDiscrete Applied Mathematics
#index3655001
#%837870
#%1336403
#!
  
#*Randomized algorithms and upper bounds for multiple domination in graphs and networks.
#@Andrei Gagarin,Anush Poghosyan,Vadim E. Zverovich
#t2013
#cDiscrete Applied Mathematics
#index3654998
#%865419
#%1095738
#%1095730
#%2857097
#!
  
#*On the approximation of minimum cost homomorphism to bipartite graphs.
#@Monaldo Mastrolilli,Arash Rafiey
#t2013
#cDiscrete Applied Mathematics
#index3654995
#%46497
#%557745
#%660807
#%837019
#%865459
#%953187
#%1029218
#%3393315
#%3480154
#!
  
#*Finding and listing induced paths and cycles.
#@Chính T. Hoàng,Marcin Kaminski,Joe Sawada,R. Sritharan
#t2013
#cDiscrete Applied Mathematics
#index3655000
#%836704
#%851376
#%933950
#%993684
#%1061921
#!
  
#*Optimal solutions for routing problems with profits.
#@Claudia Archetti,Nicola Bianchessi,Maria Grazia Speranza
#t2013
#cDiscrete Applied Mathematics
#index3654988
#%1024839
#%1189393
#%1288548
#%3248860
#!
  
#*A survey of Nordhaus-Gaddum type relations.
#@Mustapha Aouchiche,Pierre Hansen
#t2013
#cDiscrete Applied Mathematics
#index3654992
#%831134
#%836568
#%836573
#%838075
#%838281
#%839004
#%846858
#%847194
#%847328
#%847388
#%847688
#%847783
#%847995
#%850509
#%851253
#%851198
#%852208
#%852368
#%852920
#%852939
#%853584
#%853886
#%854219
#%854570
#%854705
#%854838
#%854691
#%976412
#%1061170
#%1061419
#%1144679
#%1270276
#%1336361
#%1341588
#%2856963
#%2866894
#%2872666
#%2989529
#%3066804
#%3260467
#%2928960
#!
  
#*BIT: A Very Compact Scheme System for Microcontrollers.
#@Danny Dubé,Marc Feeley
#t2005
#cHigher-Order and Symbolic Computation
#index1006644
#%141
#%465217
#%484145
#%538378
#%545894
#%564587
#%769738
#%1123898
#!
  
#*Compiler Optimization Correctness by Temporal Logic.
#@David Lacey,Neil D. Jones,Eric Van Wyk,Carl Christian Frederiksen
#t2004
#cHigher-Order and Symbolic Computation
#index1006645
#%2348
#%81228
#%114636
#%268155
#%310148
#%484904
#%542916
#%544385
#%546170
#%546366
#%546057
#%546426
#%546735
#%625669
#%628999
#%1057199
#%1123449
#%1123677
#%1123927
#%1123979
#%3004940
#%3005873
#!
  
#*Revised Report on the Algorithmic Language Scheme.
#@Harold Abelson,R. Kent Dybvig,Christopher T. Haynes,Guillermo Juan Rozas,N. I. Adams IV,Daniel P. Friedman,Eugene E. Kohlbecker,Guy L. Steele Jr.,David H. Bartley,Robert H. Halstead Jr.,Don Oxley,Gerald J. Sussman,G. Brooks,Chris Hanson,Kent M. Pitman,Mitchell Wand
#t1998
#cHigher-Order and Symbolic Computation
#index1006646
#%2134
#%484228
#%484121
#%484290
#%542473
#%542387
#%542475
#%546120
#%546180
#%769689
#%773586
#%1006789
#!
  
#*Optimal Representations of Polymorphic Types with Subtyping.
#@Alexander Aiken,Edward L. Wimmers,Jens Palsberg
#t1999
#cHigher-Order and Symbolic Computation
#index1006650
#%188883
#%214082
#%310088
#%484208
#%522113
#%545934
#%546539
#%546496
#%546613
#%832338
#%1057173
#%1123266
#%1123807
#!
  
#*Editorial.
#@Matthias Felleisen,Julia L. Lawall,Manuel Serrano,Olin Shivers
#t2005
#cHigher-Order and Symbolic Computation
#index1006657
#% 
#!
  
#*Formal Foundations of Operational Semantics.
#@Jonathan Ford,Ian A. Mason
#t2003
#cHigher-Order and Symbolic Computation
#index1006661
#%268660
#%628728
#%773590
#%888263
#%888824
#%954891
#%1006807
#%1090983
#!
  
#*Partial Evaluation of Computation Process, Revisited.
#@Yoshihiko Futamura
#t1999
#cHigher-Order and Symbolic Computation
#index1006663
#%559993
#%949922
#%1025168
#%1091325
#%3003225
#!
  
#*Partial Evaluation of Computation Process - An Approach to a Compiler-Compiler.
#@Yoshihiko Futamura
#t1999
#cHigher-Order and Symbolic Computation
#index1006665
#% 
#!
  
#*Regular Tree Languages as an Abstract Domain in Program Specialisation.
#@John P. Gallagher,Julio C. Peralta
#t2001
#cHigher-Order and Symbolic Computation
#index1006669
#%137368
#%137808
#%214146
#%328054
#%328301
#%328708
#%486729
#%538130
#%543125
#%543283
#%546294
#%546385
#%572698
#%984251
#%984541
#%984662
#%1025032
#%1025195
#!
  
#*Integrating User-Level Threads with Processes in Scsh.
#@Martin Gasbichler,Michael Sperber
#t2005
#cHigher-Order and Symbolic Computation
#index1006671
#%484162
#%792341
#%792421
#%1006682
#%1006763
#%1006646
#%1123587
#%1123395
#!
  
#*CPS Translations and Applications: The Cube and Beyond.
#@Gilles Barthe,John Hatcliff,Morten Heine Sørensen
#t1999
#cHigher-Order and Symbolic Computation
#index1006672
#%512
#%483929
#%484217
#%486499
#%542561
#%542403
#%542831
#%542879
#%542846
#%543150
#%546291
#%546284
#%546282
#%546531
#%572836
#%625584
#%628805
#%628766
#%832635
#%1001075
#%1006719
#%1006879
#%1006889
#%1014794
#%1056774
#%1090978
#%1123581
#%1123878
#!
  
#*Editorial.
#@David A. Basin,Olivier Danvy,Robert Harper
#t2004
#cHigher-Order and Symbolic Computation
#index1006674
#% 
#!
  
#*Non-Standard Semantics for Program Slicing.
#@Roberto Giacobazzi,Isabella Mastroeni
#t2003
#cHigher-Order and Symbolic Computation
#index1006675
#%138127
#%268083
#%538138
#%542320
#%542421
#%542894
#%546062
#%546170
#%546057
#%546212
#%548029
#%578733
#%626673
#%771310
#%772823
#%888488
#%949545
#%1057106
#%1089595
#%1090236
#%1090519
#%1091476
#%1092552
#%1123534
#%1123619
#%1128154
#%3005873
#!
  
#*Linear Continuation-Passing.
#@Josh Berdine,Peter W. O'Hearn,Uday S. Reddy,Hayo Thielecke
#t2002
#cHigher-Order and Symbolic Computation
#index1006676
#%44789
#%124272
#%208375
#%484363
#%542383
#%542561
#%543265
#%546208
#%546179
#%951314
#%984491
#%1006655
#%1006933
#%1006879
#%1006889
#%1006838
#%1006837
#%1006864
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2002
#cHigher-Order and Symbolic Computation
#index1006677
#% 
#!
  
#*Partial Evaluation of the Euclidean Algorithm, Revisited.
#@Chin Soon Lee
#t1999
#cHigher-Order and Symbolic Computation
#index1006678
#%1006746
#%1006646
#%3003225
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t1999
#cHigher-Order and Symbolic Computation
#index1006680
#% 
#!
  
#*Efficiency by Incrementalization: An Introduction.
#@Yanhong A. Liu
#t2000
#cHigher-Order and Symbolic Computation
#index1006681
#%73
#%2022
#%3693
#%38688
#%38689
#%39079
#%214193
#%214192
#%289526
#%289528
#%309844
#%310170
#%471366
#%483664
#%484112
#%484279
#%542637
#%543307
#%546193
#%546196
#%546350
#%546489
#%546664
#%546657
#%546721
#%609762
#%610457
#%622966
#%629127
#%770714
#%771840
#%775196
#%776819
#%832239
#%949922
#%953565
#%972981
#%1056553
#%1056965
#%1060205
#%1068271
#%1123257
#%1123474
#%1123741
#%1123877
#%1123970
#%1123861
#%1123731
#%1123997
#%1123803
#%1127466
#%1129547
#%3001621
#%3006148
#%3006972
#%3077390
#!
  
#*Safe-for-Space Threads in Standard ML.
#@Edoardo Biagioni,Kenneth Cline,Peter Lee,Chris Okasaki,Christopher A. Stone
#t1998
#cHigher-Order and Symbolic Computation
#index1006682
#%29174
#%214182
#%484215
#%484129
#%484336
#%542475
#%546169
#%792422
#%3006784
#!
  
#*A Network Protocol Stack in Standard ML.
#@Edoardo Biagioni,Robert Harper,Peter Lee
#t2001
#cHigher-Order and Symbolic Computation
#index1006684
#%512
#%484129
#%588445
#%588785
#%588733
#%600434
#%613043
#%613149
#%1006682
#%1006931
#%1006826
#%1066150
#%1117598
#!
  
#*A Variadic Extension of Curry's Fixed-Point Combinator.
#@Mayer Goldberg
#t2005
#cHigher-Order and Symbolic Computation
#index1006687
#%546471
#!
  
#*Christopher Strachey: Recollections of His Influence.
#@Michael J. C. Gordon
#t2000
#cHigher-Order and Symbolic Computation
#index1006689
#% 
#!
  
#*Introduction.
#@Olivier Danvy,Carolyn L. Talcott
#t1999
#cHigher-Order and Symbolic Computation
#index1006691
#% 
#!
  
#*Path Dependent Analysis of Logic Programs.
#@Lunjin Lu
#t2003
#cHigher-Order and Symbolic Computation
#index1006692
#%30730
#%189034
#%214146
#%328708
#%538342
#%543289
#%543358
#%543299
#%546057
#%546579
#%548132
#%572611
#%572533
#%601171
#%601283
#%605553
#%925008
#%950197
#%984251
#%984389
#%984506
#%984357
#%984557
#%984541
#%984532
#%984662
#%984556
#%984636
#%1056621
#%1089595
#%1090191
#%1090189
#%1123365
#%1123409
#%1123371
#%1123384
#%1123620
#%1123743
#%1123876
#%3004940
#!
  
#*Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus.
#@Inge Li Gørtz,Signe Reuss,Morten Heine Sørensen
#t2003
#cHigher-Order and Symbolic Computation
#index1006694
#%484866
#%620489
#%628805
#%628766
#%980898
#!
  
#*Transformational Derivation of an Improved Alias Analysis Algorithm.
#@Deepak Goyal
#t2005
#cHigher-Order and Symbolic Computation
#index1006696
#%73
#%521998
#%530354
#%542714
#%542640
#%546017
#%546098
#%546100
#%546451
#%546777
#%971832
#%1008203
#%1056652
#%1123398
#%1123362
#%1123848
#%1123803
#%1123609
#%3169246
#!
  
#*The Second Futamura Projection for Type-Directed Partial Evaluation.
#@Bernd Grobauer,Zhe Yang
#t2001
#cHigher-Order and Symbolic Computation
#index1006698
#%17689
#%137202
#%267759
#%310167
#%484236
#%485071
#%543131
#%543166
#%546055
#%546180
#%546181
#%548143
#%981108
#%1014794
#%1123375
#%3003225
#!
  
#*The p-Calculus in Direct Style.
#@Gérard Boudol
#t1998
#cHigher-Order and Symbolic Computation
#index1006699
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t1999
#cHigher-Order and Symbolic Computation
#index1006702
#% 
#!
  
#*Higher-Order UnCurrying.
#@John Hannan,Patrick Hicks
#t2000
#cHigher-Order and Symbolic Computation
#index1006709
#%512
#%180525
#%309975
#%310000
#%484142
#%542879
#%546277
#%546531
#%950598
#%980884
#%1090469
#%1123927
#!
  
#*Christopher Strachey - Understanding Programming Languages.
#@Rod M. Burstall
#t2000
#cHigher-Order and Symbolic Computation
#index1006710
#% 
#!
  
#*From Macrogeneration to Syntactic Abstraction.
#@R. Kent Dybvig
#t2000
#cHigher-Order and Symbolic Computation
#index1006711
#%484228
#%546818
#%1006646
#%1006789
#%1006913
#!
  
#*Dependent Types for Program Termination Verification.
#@Hongwei Xi
#t2002
#cHigher-Order and Symbolic Computation
#index1006715
#%79707
#%309963
#%484851
#%542403
#%546026
#%546406
#%546334
#%546485
#%546564
#%572863
#%951750
#%980887
#%1006732
#%1056680
#%3169345
#!
  
#*Cambridge and CPL in the 1960s.
#@David Hartley
#t2000
#cHigher-Order and Symbolic Computation
#index1006723
#% 
#!
  
#*Axioms for Recursion in Call-by-Value.
#@Masahito Hasegawa,Yoshihiko Kakutani
#t2002
#cHigher-Order and Symbolic Computation
#index1006725
#%126846
#%309874
#%484299
#%485071
#%485241
#%487301
#%542561
#%887579
#%888930
#%1006659
#%1006864
#%1014916
#%1014878
#!
  
#*Slicing Software for Model Construction.
#@John Hatcliff,Matthew B. Dwyer,Hongjun Zheng
#t2000
#cHigher-Order and Symbolic Computation
#index1006727
#%16423
#%545904
#%1123427
#%364276
#%1123453
#%361680
#%1127849
#%546057
#%1123402
#%832483
#%601187
#%361839
#%79460
#%543254
#%188089
#%1128403
#%546325
#%3002627
#%3003225
#%878995
#%3006115
#%1129241
#%138127
#%626673
#%450964
#!
  
#*Bisimilarity for the Region Calculus.
#@Simon Helsen
#t2004
#cHigher-Order and Symbolic Computation
#index1006729
#%66715
#%124417
#%268660
#%310155
#%484126
#%484401
#%484811
#%485071
#%485116
#%538185
#%542344
#%542580
#%542601
#%542581
#%542505
#%545881
#%545941
#%546241
#%546028
#%546413
#%546629
#%548067
#%636128
#%886910
#%887353
#%888278
#%889653
#%980795
#%1006741
#%1006930
#%1089414
#%1091567
#%1123961
#%1123947
#!
  
#*Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation.
#@Wei-Ngan Chin,Olivier Danvy,Peter Thiemann
#t2004
#cHigher-Order and Symbolic Computation
#index1006730
#% 
#!
  
#*Functional Geometry.
#@Peter Henderson
#t2002
#cHigher-Order and Symbolic Computation
#index1006731
#%309861
#%484168
#%981040
#!
  
#*Calculating Sized Types.
#@Wei-Ngan Chin,Siau-Cheng Khoo
#t2001
#cHigher-Order and Symbolic Computation
#index1006732
#%3479
#%185515
#%486584
#%542403
#%544760
#%545444
#%546076
#%546334
#%546485
#%572863
#%605520
#%775196
#%878914
#%951750
#%1056843
#%1077810
#%1123592
#%3001986
#!
  
#*Combining Program and Data Specialization.
#@Sandrine Chirokoff,Charles Consel,Renaud Marlet
#t1999
#cHigher-Order and Symbolic Computation
#index1006734
#%546146
#%832471
#%137083
#%593408
#%1092089
#%572793
#%3003225
#%542682
#%297407
#%538303
#%289554
#%617275
#!
  
#*Implementation Strategies for First-Class Continuations.
#@William D. Clinger,Anne Hartheimer,Eric Ost
#t1999
#cHigher-Order and Symbolic Computation
#index1006736
#%141
#%516
#%512
#%465097
#%484162
#%484160
#%484197
#%484195
#%484254
#%484304
#%521966
#%522549
#%522714
#%542389
#%542476
#%542454
#%542499
#%542383
#%542475
#%542633
#%542753
#%546111
#%546799
#%600806
#%770178
#%1006646
#%1006655
#!
  
#*A Hard Act to Follow.
#@C. A. R. Hoare
#t2000
#cHigher-Order and Symbolic Computation
#index1006737
#% 
#!
  
#*Certifying Compilation and Run-Time Code Generation.
#@Luke Hornof,Trevor Jim
#t1999
#cHigher-Order and Symbolic Computation
#index1006741
#%538137
#%542399
#%137083
#%546148
#%538211
#%185519
#%538156
#%593408
#%538187
#%542742
#%546550
#%297407
#%542761
#%289554
#%188952
#%542790
#%613309
#%538255
#%542879
#%542917
#%628155
#!
  
#*Christopher Strachey: A Personal Recollection.
#@Michael Jackson
#t2000
#cHigher-Order and Symbolic Computation
#index1006743
#% 
#!
  
#*A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions.
#@Catarina Coquand
#t2002
#cHigher-Order and Symbolic Computation
#index1006744
#%713
#%628791
#%631878
#%1014622
#!
  
#*Editorial: Special Issue Dedicated to Bob Paige.
#@Olivier Danvy,Fritz Henglein,Harry G. Mairson,Alberto Pettorossi
#t2003
#cHigher-Order and Symbolic Computation
#index1006748
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Fritz Henglein,Harry G. Mairson,Alberto Pettorossi
#t2005
#cHigher-Order and Symbolic Computation
#index1006750
#% 
#!
  
#*A Generalization of Short-Cut Fusion and its Correctness Proof.
#@Patricia Johann
#t2002
#cHigher-Order and Symbolic Computation
#index1006751
#%38692
#%214213
#%214224
#%214170
#%214207
#%268855
#%309991
#%553008
#%751724
#%888824
#%980959
#%1014870
#%1089083
#!
  
#*Editorial.
#@Olivier Danvy,Takayasu Ito,Carolyn L. Talcott
#t2001
#cHigher-Order and Symbolic Computation
#index1006752
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Takayasu Ito,Carolyn L. Talcott
#t2002
#cHigher-Order and Symbolic Computation
#index1006754
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Julia L. Lawall
#t2001
#cHigher-Order and Symbolic Computation
#index1006756
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Ian A. Mason
#t2004
#cHigher-Order and Symbolic Computation
#index1006758
#% 
#!
  
#*Functional Differentiation of Computer Programs.
#@Jerzy Karczmarczuk
#t2001
#cHigher-Order and Symbolic Computation
#index1006759
#%216522
#%310004
#%1092468
#%1121387
#%1121353
#%3006743
#!
  
#*Editorial.
#@Olivier Danvy,Amr Sabry
#t2002
#cHigher-Order and Symbolic Computation
#index1006762
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2000
#cHigher-Order and Symbolic Computation
#index1006764
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2000
#cHigher-Order and Symbolic Computation
#index1006766
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2000
#cHigher-Order and Symbolic Computation
#index1006768
#% 
#!
  
#*Program Adaptation via Output-Constraint Specialization.
#@Siau-Cheng Khoo,Kun Shi
#t2004
#cHigher-Order and Symbolic Computation
#index1006769
#%138127
#%208586
#%507697
#%538194
#%538220
#%538257
#%538364
#%538207
#%542930
#%542894
#%546191
#%546797
#%566943
#%775196
#%832469
#%832490
#%1006732
#%1123788
#%3003225
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2001
#cHigher-Order and Symbolic Computation
#index1006770
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t1999
#cHigher-Order and Symbolic Computation
#index1006771
#% 
#!
  
#*An Appreciation of Bob Paige.
#@Martin Davis
#t2005
#cHigher-Order and Symbolic Computation
#index1006773
#% 
#!
  
#*Implementing Metcast in Scheme.
#@Oleg Kiselyov
#t2005
#cHigher-Order and Symbolic Computation
#index1006774
#%310011
#%526139
#%526137
#%773590
#%1067650
#!
  
#*Relativizations for the Logic-Automata Connection.
#@Nils Klarlund
#t2005
#cHigher-Order and Symbolic Computation
#index1006776
#%79171
#%79225
#%79403
#%213436
#%542750
#%625165
#%832306
#%3395079
#!
  
#*Type-Based Useless-Variable Elimination.
#@Naoki Kobayashi
#t2001
#cHigher-Order and Symbolic Computation
#index1006778
#%138127
#%384880
#%484114
#%484783
#%486688
#%542620
#%546614
#%546834
#%572617
#%572774
#%628141
#%951702
#%1090469
#%1092460
#%1123806
#%1123709
#%1123592
#%1123991
#!
  
#*Implementing Coloured Petri Nets Using a Functional Programming Language.
#@Lars Michael Kristensen,Søren Christensen
#t2004
#cHigher-Order and Symbolic Computation
#index1006782
#%2597
#%17541
#%17806
#%45040
#%45241
#%45296
#%45352
#%45454
#%45474
#%79475
#%79716
#%79824
#%208813
#%384925
#%530131
#%546377
#%625137
#%626522
#%832427
#%878825
#%878943
#%994152
#%1056847
#%1088805
#%1123449
#%1128148
#%3307122
#!
  
#*Least Reflexive Points of Relations.
#@Jules Desharnais,Bernhard Möller
#t2005
#cHigher-Order and Symbolic Computation
#index1006783
#%3537
#%39882
#%1056652
#!
  
#*Retraction Approach to CPS Transform.
#@Jakov Kucan
#t1998
#cHigher-Order and Symbolic Computation
#index1006784
#%512
#%310108
#%484256
#%485071
#%486499
#%542561
#%546180
#%546291
#%546694
#%553008
#%887579
#%888778
#%888930
#%888919
#%951568
#%1006875
#%1006889
#%214181
#!
  
#*A Generic Reification Technique for Object-Oriented Reflective Languages.
#@Rémi Douence,Mario Südholt
#t2001
#cHigher-Order and Symbolic Computation
#index1006787
#%141
#%116566
#%173139
#%484219
#%521929
#%521992
#%522015
#%522484
#%538169
#%546762
#%1006822
#%1006805
#%1006662
#%1123780
#!
  
#*Comparing Parallel Functional Languages: Programming and Performance
#@Hans-Wolfgang Loidl,Fernando Rubio,Norman Scaife,Kevin Hammond,Susumu Horiguchi,Ulrike Klusik,Rita Loogen,Greg Michaelson,Ricardo Pena,Steffen Priebe,Álvaro J. Rebón Portillo,Philip W. Trinder
#t2003
#cHigher-Order and Symbolic Computation
#index1006788
#%110751
#%188892
#%214143
#%214200
#%251463
#%384870
#%384931
#%384894
#%384959
#%530131
#%542887
#%546121
#%546726
#%586444
#%586449
#%770153
#%770472
#%790653
#%790793
#%981052
#%1025613
#%1123572
#!
  
#*My Years with Strachey.
#@Peter J. Landin
#t2000
#cHigher-Order and Symbolic Computation
#index1006790
#% 
#!
  
#*A Generalization of Jumps and Labels.
#@Peter J. Landin
#t1998
#cHigher-Order and Symbolic Computation
#index1006791
#%773588
#!
  
#*Program Synthesis from Formal Requirements Specifications Using APTS.
#@Elizabeth I. Leonard,Constance L. Heitmeyer
#t2003
#cHigher-Order and Symbolic Computation
#index1006798
#%24250
#%39079
#%79503
#%188985
#%209732
#%361685
#%526250
#%543307
#%558252
#%558219
#%601196
#%601131
#%625363
#%751383
#%760872
#%760947
#%773560
#%1008195
#%1056652
#%1123242
#%1124217
#%1127965
#%1128287
#%1128364
#%1129547
#%3006972
#!
  
#*Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC.
#@Mark Lillibridge
#t1999
#cHigher-Order and Symbolic Computation
#index1006800
#%83
#%214182
#%545897
#%546047
#%546284
#%546539
#%626659
#%628768
#%889651
#%1006719
#%1056717
#%1090983
#!
  
#*Dynamic Programming via Static Incrementalization.
#@Yanhong A. Liu,Scott D. Stoller
#t2003
#cHigher-Order and Symbolic Computation
#index1006801
#%73
#%2022
#%38685
#%38693
#%38689
#%188985
#%214193
#%214192
#%289526
#%289528
#%309844
#%309992
#%310170
#%379641
#%471366
#%483783
#%484112
#%484279
#%538190
#%538246
#%543261
#%546489
#%546657
#%546733
#%572571
#%775196
#%776819
#%832239
#%832950
#%949922
#%1056557
#%1056965
#%1056652
#%1059566
#%1080581
#%1123257
#%1123474
#%1123661
#%1123731
#%1123803
#%1127466
#%1129547
#%3006972
#%3641374
#!
  
#*Formalization and Analysis of Class Loading in Java.
#@Akihiko Tozawa,Masami Hagiya
#t2002
#cHigher-Order and Symbolic Computation
#index1006802
#%289488
#%522658
#%545886
#%546232
#%601081
#%628130
#%1123926
#!
  
#*Robert Paige (1947-1999).
#@Harry G. Mairson
#t2005
#cHigher-Order and Symbolic Computation
#index1006803
#% 
#!
  
#*Computing with Contexts.
#@Ian A. Mason
#t1999
#cHigher-Order and Symbolic Computation
#index1006807
#%310028
#%888263
#%954620
#%980736
#%1090428
#%1093321
#%1094867
#!
  
#*Algebraic Power Analysis by Abstract Interpretation.
#@Isabella Mastroeni
#t2004
#cHigher-Order and Symbolic Computation
#index1006811
#%114368
#%268083
#%289573
#%360520
#%543125
#%546062
#%546042
#%546076
#%546138
#%546057
#%546730
#%572805
#%572807
#%626531
#%653279
#%832548
#%1123971
#!
  
#*Cost-Augmented Partial Evaluation of Functional Logic Programs.
#@Germán Vidal
#t2004
#cHigher-Order and Symbolic Computation
#index1006812
#%38995
#%189078
#%309850
#%486538
#%538166
#%538106
#%538130
#%538279
#%538115
#%543217
#%546278
#%605566
#%929688
#%930675
#%949540
#%949922
#%971999
#%980885
#%984602
#%984645
#%1006879
#%1024951
#%1056902
#%1095124
#%1123254
#%3003225
#%3004973
#!
  
#*Using Circular Programs to Deforest in Accumulating Parameters.
#@Janis Voigtländer
#t2004
#cHigher-Order and Symbolic Computation
#index1006814
#%189078
#%208354
#%214027
#%213980
#%214170
#%219735
#%310000
#%310138
#%379660
#%384895
#%486660
#%538281
#%548098
#%949922
#%980936
#%1006751
#%1095124
#%1123885
#!
  
#*Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct.
#@Oscar Waddell,Dipanwita Sarkar,R. Kent Dybvig
#t2005
#cHigher-Order and Symbolic Computation
#index1006816
#%484297
#%484346
#%546818
#%600806
#%1006653
#%1006646
#%1006789
#!
  
#*Selectors Make Set-Based Analysis Too Hard.
#@Philippe Meunier,Robert Bruce Findler,Paul Steckler,Mitchell Wand
#t2005
#cHigher-Order and Symbolic Computation
#index1006817
#%2022
#%189082
#%309853
#%484166
#%484227
#%484783
#%538378
#%542620
#%545934
#%546057
#%980837
#%1006646
#%1006717
#%1056521
#%1123487
#%1123805
#%3003177
#!
  
#*Specialization Scenarios: A Pragmatic Approach to Declaring Program Specialization.
#@Anne-Françoise Le Meur,Julia L. Lawall,Charles Consel
#t2004
#cHigher-Order and Symbolic Computation
#index1006819
#%84600
#%137083
#%137619
#%297168
#%297407
#%309963
#%484141
#%522884
#%538303
#%538207
#%538339
#%542682
#%542721
#%546149
#%546399
#%617275
#%619400
#%760878
#%760976
#%930675
#%1006931
#%1067994
#%1091619
#%1092089
#%1117574
#%1123319
#%1123488
#%1123547
#%3003225
#%3169345
#!
  
#*Continuations Revisited.
#@Christopher P. Wadsworth
#t2000
#cHigher-Order and Symbolic Computation
#index1006820
#%771307
#%1006875
#!
  
#*From Language Concepts to Implementation Concepts.
#@Robert Milne
#t2000
#cHigher-Order and Symbolic Computation
#index1006823
#% 
#!
  
#*Continuation-Based Multiprocessing Revisited.
#@Mitchell Wand
#t1999
#cHigher-Order and Symbolic Computation
#index1006824
#%546088
#%771307
#%772585
#%772825
#%773590
#%773586
#%774428
#%777053
#%951235
#%3003905
#!
  
#*Continuation-Based Multiprocessing.
#@Mitchell Wand
#t1999
#cHigher-Order and Symbolic Computation
#index1006826
#% 
#!
  
#*Linear-Time Self-Interpretation of the Pure Lambda Calculus.
#@Torben Æ. Mogensen
#t2000
#cHigher-Order and Symbolic Computation
#index1006827
#%71347
#%310025
#%1057118
#%3006691
#!
  
#*Glossary for Partial Evaluation and Related Topics.
#@Torben Æ. Mogensen
#t2000
#cHigher-Order and Symbolic Computation
#index1006829
#% 
#!
  
#*Universal Regular Path Queries.
#@Oege de Moor,David Lacey,Eric Van Wyk
#t2003
#cHigher-Order and Symbolic Computation
#index1006831
#%516
#%2348
#%39079
#%81228
#%81375
#%214139
#%310148
#%542669
#%543307
#%546366
#%601131
#%625669
#%832922
#%951708
#%1008195
#%1056553
#%1089851
#%1089971
#%1123803
#%1123979
#%1138065
#%3006972
#!
  
#*Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation.
#@Luc Moreau
#t2001
#cHigher-Order and Symbolic Computation
#index1006833
#%3697
#%197065
#%197066
#%310054
#%465137
#%465113
#%465150
#%484240
#%522307
#%530176
#%530181
#%529942
#%542887
#%566564
#%770764
#%791017
#%988766
#%1057022
#%1073576
#%1123830
#%1123939
#%3005795
#!
  
#*A Syntactic Theory of Dynamic Binding.
#@Luc Moreau
#t1998
#cHigher-Order and Symbolic Computation
#index1006835
#%86
#%142
#%188794
#%214182
#%310053
#%484215
#%484217
#%484260
#%484300
#%529943
#%543265
#%546660
#%546694
#%548309
#%554626
#%626599
#%769740
#%774141
#%1006901
#%1006889
#%1090428
#%1090978
#%1090976
#%1090983
#%1123327
#%1123587
#%3003905
#%3006784
#!
  
#*From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition.
#@Yong Xiao,Amr Sabry,Zena M. Ariola
#t2001
#cHigher-Order and Symbolic Computation
#index1006836
#%309882
#%310024
#%310115
#%980760
#%1006807
#!
  
#*Secure Information Flow via Linear Continuations.
#@Steve Zdancewic,Andrew C. Myers
#t2002
#cHigher-Order and Symbolic Computation
#index1006838
#%512
#%2348
#%124068
#%214142
#%309958
#%310090
#%494716
#%542561
#%542831
#%545891
#%545916
#%546296
#%546179
#%546028
#%546320
#%546564
#%546561
#%546763
#%613235
#%771214
#%771237
#%889799
#%930723
#%970642
#%981085
#%1006719
#%1006889
#%1006887
#%1088696
#%1091506
#%1094995
#%1123775
#%3003225
#!
  
#*A Foreword to `Fundamental Concepts in Programming Languages'.
#@Peter D. Mosses
#t2000
#cHigher-Order and Symbolic Computation
#index1006839
#% 
#!
  
#*Automatic Generation of Staged Geometric Predicates.
#@Aleksandar Nanevski,Guy E. Blelloch,Robert Harper
#t2003
#cHigher-Order and Symbolic Computation
#index1006841
#%49562
#%111046
#%310059
#%650852
#%836252
#%1080909
#%1121138
#!
  
#*Explicit substitutions and higher-order syntax.
#@Neil Ghani,Tarmo Uustalu,Makoto Hamana
#t2006
#cHigher-Order and Symbolic Computation
#index1006842
#%126887
#%217010
#%309946
#%310035
#%484680
#%484682
#%548148
#%548145
#%579433
#%868242
#%980849
#%1014611
#%1014760
#%1088611
#%1093365
#%1093596
#!
  
#*A Polymorphic Environment Calculus and its Type-Inference Algorithm.
#@Shin-ya Nishizaki
#t2000
#cHigher-Order and Symbolic Computation
#index1006843
#%310094
#%546219
#%546413
#%546598
#%881889
#%887614
#%888641
#%889651
#%889732
#%950090
#%1006646
#%1006821
#%1057143
#%1090978
#%1123637
#!
  
#*Call-by-push-value: Decomposing call-by-value and call-by-name.
#@Paul Blain Levy
#t2006
#cHigher-Order and Symbolic Computation
#index1006844
#%3380
#%17255
#%124647
#%309990
#%484441
#%485071
#%888930
#%980898
#%981156
#%1014916
#%1092342
#%3005873
#!
  
#*Editorial.
#@Olivier Danvy,Oege de Moor,Julian A. Padget,Peter Thiemann
#t2006
#cHigher-Order and Symbolic Computation
#index1006846
#% 
#!
  
#*The octagon abstract domain.
#@Antoine Miné
#t2006
#cHigher-Order and Symbolic Computation
#index1006848
#%542312
#%65633
#%542398
#%542353
#%625018
#%2022
#%546057
#%984357
#%543125
#%546076
#%61357
#%547974
#%1025691
#%653279
#%572920
#%178524
#!
  
#*About permutation algebras, (pre)sheaves and named sets.
#@Fabio Gadducci,Marino Miculan,Ugo Montanari
#t2006
#cHigher-Order and Symbolic Computation
#index1006850
#%213708
#%484682
#%484804
#%888930
#%889210
#%981179
#%1090299
#%1094318
#!
  
#*An initial algebra approach to term rewriting systems with variable binders.
#@Makoto Hamana
#t2006
#cHigher-Order and Symbolic Computation
#index1006852
#%126887
#%252264
#%310126
#%484680
#%484851
#%484682
#%484702
#%484804
#%507820
#%548148
#%548137
#%548139
#%548145
#%563501
#%563476
#%625674
#%628853
#%889210
#%981132
#%994816
#%1025551
#%1089446
#%1091793
#%1094867
#%1342301
#!
  
#*Editorial.
#@Furio Honsell,Carolyn L. Talcott
#t2006
#cHigher-Order and Symbolic Computation
#index1006854
#% 
#!
  
#*Formal compiler construction in a logical framework.
#@Jason Hickey,Aleksey Nogin
#t2006
#cHigher-Order and Symbolic Computation
#index1006856
#%512
#%239091
#%245081
#%310235
#%507820
#%526159
#%542561
#%542760
#%542761
#%546550
#%625363
#%629545
#%1056751
#%1123314
#%3003854
#!
  
#*Research Retrospective.
#@Bob Paige
#t2003
#cHigher-Order and Symbolic Computation
#index1006857
#%38688
#%546017
#%546610
#%546678
#%601131
#%994411
#%1056553
#%1056652
#%1089849
#%1089971
#%1123803
#!
  
#*Expressing combinatory reduction systems derivations in the rewriting calculus.
#@Clara Bertolissi,Horatiu Cirstea,Claude Kirchner
#t2006
#cHigher-Order and Symbolic Computation
#index1006858
#%252263
#%484471
#%545902
#%563396
#%626669
#%628869
#%980782
#%1092399
#!
  
#*An NSF Proposal.
#@Robert Paige
#t2005
#cHigher-Order and Symbolic Computation
#index1006859
#%38688
#%38689
#%39079
#%39882
#%144628
#%310167
#%484136
#%543307
#%545526
#%546017
#%546196
#%546610
#%546678
#%601131
#%973120
#%994411
#%1056553
#%1056652
#%1089849
#%1089851
#%1089971
#%1123861
#%1129547
#%3003225
#%3006972
#%3169246
#!
  
#*Polymorphic typed defunctionalization and concretization.
#@François Pottier,Nadji Gauthier
#t2006
#cHigher-Order and Symbolic Computation
#index1006860
#%188857
#%309877
#%522752
#%522967
#%522991
#%545990
#%546047
#%546531
#%546641
#%546822
#%546851
#%548108
#%625597
#%626541
#%887375
#%980803
#%981048
#%1006877
#%1006879
#%1068052
#%1123571
#%1123775
#%2939390
#%1123796
#!
  
#*Reminiscences of Christopher Strachey.
#@Roger Penrose
#t2000
#cHigher-Order and Symbolic Computation
#index1006861
#% 
#!
  
#*An Introduction to Landin's ``A Generalization of Jumps and Labels''.
#@Hayo Thielecke
#t1998
#cHigher-Order and Symbolic Computation
#index1006862
#% 
#!
  
#*Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism.
#@Alberto Pettorossi,Maurizio Proietti,Sophie Renault
#t2005
#cHigher-Order and Symbolic Computation
#index1006863
#%137406
#%189078
#%328116
#%486610
#%538130
#%538384
#%543201
#%546626
#%548175
#%572699
#%832759
#%949922
#%984389
#%984602
#%1006681
#%1056547
#%1091325
#%1093253
#%1094422
#%1095124
#%1123290
#%1123949
#%1123803
#%2939523
#%3003225
#%3006699
#!
  
#*Using a Continuation Twice and Its Implications for the Expressive Power of Call/CC.
#@Hayo Thielecke
#t1999
#cHigher-Order and Symbolic Computation
#index1006864
#%126846
#%484256
#%484308
#%484641
#%546208
#%546129
#%792422
#%886910
#%889332
#%980898
#%984491
#%1006646
#%1006791
#%1056717
#%3004673
#!
  
#*Mechanising lambda-calculus using a classical first order theory of terms with permutations.
#@Michael Norrish
#t2006
#cHigher-Order and Symbolic Computation
#index1006866
#% 
#!
  
#*Continuations and Web Servers.
#@Christian Queinnec
#t2004
#cHigher-Order and Symbolic Computation
#index1006867
#%161369
#%256687
#%310093
#%380483
#%484120
#%484197
#%526241
#%554626
#%760988
#%793542
#%1006736
#%1056883
#%1067937
#%1123441
#!
  
#*Pseudo-distributive laws and axiomatics for variable binding.
#@Miki Tanaka,John Power
#t2006
#cHigher-Order and Symbolic Computation
#index1006868
#%124362
#%310237
#%310091
#%484680
#%484702
#%485071
#%484804
#%548148
#%548145
#!
  
#*Editorial.
#@Olivier Danvy,Andrzej Filinski,Jean-Louis Giavitto,Andy King,Pierre-Etienne Moreau,Carolyn L. Talcott
#t2006
#cHigher-Order and Symbolic Computation
#index1006870
#% 
#!
  
#*Optimizing Nested Loops Using Local CPS Conversion.
#@John H. Reppy
#t2002
#cHigher-Order and Symbolic Computation
#index1006871
#%512
#%81266
#%309920
#%309881
#%309958
#%413870
#%484305
#%484304
#%542561
#%542555
#%542831
#%542879
#%546222
#%600806
#%888930
#%980756
#%981048
#%1008190
#%1123527
#%1123927
#%3004940
#!
  
#*Dynamic state restoration using versioning exceptions.
#@V. Krishna Nandivada,Suresh Jagannathan
#t2006
#cHigher-Order and Symbolic Computation
#index1006872
#%512
#%2367
#%407918
#%484166
#%522256
#%538205
#%542580
#%542667
#%542533
#%542561
#%542560
#%542919
#%542743
#%544454
#%546348
#%546173
#%546349
#%546777
#%546751
#%548285
#%572667
#%889653
#%950212
#%971832
#%1064573
#%1067050
#%1073369
#%1118350
#%1118488
#%1123618
#%1123727
#%1123880
#%1123805
#%1123881
#%1123947
#!
  
#*Computational Divided Differencing and Divided-Difference Arithmetics.
#@Thomas W. Reps,Louis B. Rall
#t2003
#cHigher-Order and Symbolic Computation
#index1006873
#%138127
#%289528
#%310004
#%538246
#%542401
#%542639
#%545904
#%546193
#%546196
#%546489
#%546608
#%578733
#%579426
#%774735
#%776924
#%1006759
#%1006913
#%1056965
#%1073607
#%1123619
#%1123620
#%1123803
#%1128154
#%2871033
#%3003225
#!
  
#*Deriving escape analysis by abstract interpretation.
#@Patricia M. Hill,Fausto Spoto
#t2006
#cHigher-Order and Symbolic Computation
#index1006874
#%40115
#%81315
#%172840
#%268083
#%364107
#%521766
#%521894
#%522625
#%522699
#%522844
#%522910
#%530322
#%542327
#%542778
#%542895
#%542915
#%545949
#%546109
#%546062
#%546057
#%546709
#%548480
#%646738
#%984357
#%1078407
#%1090321
#%1092284
#%1094516
#%1123429
#%1123430
#%1123559
#%1123534
#%1123642
#%1123921
#%3005873
#!
  
#*Editorial.
#@Narciso Martí-Oliet,Grigore Rosu,Carolyn L. Talcott
#t2007
#cHigher-Order and Symbolic Computation
#index1006876
#% 
#!
  
#*Definitional Interpreters Revisited.
#@John C. Reynolds
#t1998
#cHigher-Order and Symbolic Computation
#index1006877
#%512
#%268925
#%486499
#%546291
#%546531
#%888930
#%1006719
#%1006646
#%1006655
#%1006875
#%1006879
#%1006921
#%1006791
#%1006889
#%3005070
#!
  
#*A new generic scheme for functional logic programming with constraints.
#@Francisco Javier López-Fraguas,Mario Rodríguez-Artalejo,Rafael del Vado Vírseda
#t2007
#cHigher-Order and Symbolic Computation
#index1006878
#%701
#%39040
#%71543
#%126982
#%157177
#%188822
#%188943
#%269020
#%526206
#%540364
#%543120
#%543217
#%546047
#%545973
#%546278
#%546346
#%546729
#%546730
#%548040
#%548127
#%548200
#%605266
#%626409
#%745064
#%819145
#%887809
#%949540
#%951624
#%984522
#%1088673
#%1089055
#%1090521
#%1091036
#%1093249
#%1126496
#%1126481
#%1126546
#%3004224
#%3004973
#!
  
#*Definitional Interpreters for Higher-Order Programming Languages.
#@John C. Reynolds
#t1998
#cHigher-Order and Symbolic Computation
#index1006879
#%771608
#%772823
#%773590
#%773586
#%774141
#%774426
#%1006837
#!
  
#*A rho-calculus of explicit constraint application.
#@Horatiu Cirstea,Germain Faure,Claude Kirchner
#t2007
#cHigher-Order and Symbolic Computation
#index1006880
#% 
#!
  
#*Christopher Strachey and the Cambridge CPL Compiler.
#@Martin Richards
#t2000
#cHigher-Order and Symbolic Computation
#index1006881
#% 
#!
  
#*Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types.
#@Iliano Cervesato,Mark-Oliver Stehr
#t2007
#cHigher-Order and Symbolic Computation
#index1006882
#%83870
#%84007
#%123823
#%123821
#%123892
#%123922
#%625318
#%949519
#%970600
#%1066513
#%1076169
#%1089332
#%1089620
#%1090136
#!
  
#*State-transition machines, revisited.
#@David A. Schmidt
#t2007
#cHigher-Order and Symbolic Computation
#index1006884
#%81202
#%81475
#%268353
#%268925
#%484209
#%548023
#%1006879
#%1056751
#!
  
#*On the correctness of the Krivine machine.
#@Mitchell Wand
#t2007
#cHigher-Order and Symbolic Computation
#index1006886
#%484158
#%484209
#%548023
#%981156
#!
  
#*A Per Model of Secure Information Flow in Sequential Programs.
#@Andrei Sabelfeld,David Sands
#t2001
#cHigher-Order and Symbolic Computation
#index1006887
#%124068
#%124137
#%189230
#%214224
#%484845
#%507774
#%538110
#%538197
#%543256
#%545891
#%546296
#%546763
#%613049
#%626630
#%771214
#%771237
#%807397
#%970643
#%970642
#%1056907
#%1093759
#%1123281
#!
  
#*Strongly reducing variants of the Krivine abstract machine.
#@Pierre Crégut
#t2007
#cHigher-Order and Symbolic Computation
#index1006888
#%214088
#%228709
#%309961
#%546001
#%546235
#%546376
#%548023
#%950090
#%980886
#!
  
#*Editorial.
#@Olivier Danvy,Hayo Thielecke
#t2007
#cHigher-Order and Symbolic Computation
#index1006890
#% 
#!
  
#*An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in First-Order Predicate Calculus.
#@Erik Sandewall
#t1999
#cHigher-Order and Symbolic Computation
#index1006891
#%546475
#%1006875
#!
  
#*Explaining the lazy Krivine machine using explicit substitution and addresses.
#@Frédéric Lang
#t2007
#cHigher-Order and Symbolic Computation
#index1006892
#%126977
#%309836
#%310055
#%543160
#%546398
#%600902
#%950090
#%980760
#%981136
#!
  
#*Induction, Domains, Calculi: Strachey's Contributions to Programming-Language Engineering.
#@David A. Schmidt
#t2000
#cHigher-Order and Symbolic Computation
#index1006893
#%142
#%484265
#%546296
#%546057
#%605566
#%769689
#%772823
#%773590
#%832338
#%3004673
#%3004940
#%3005279
#%3005774
#%3005514
#%3005874
#%3006385
#%3006901
#%3006784
#%3006883
#!
  
#*A proof-theoretic foundation of abortive continuations.
#@Zena M. Ariola,Hugo Herbelin,Amr Sabry
#t2007
#cHigher-Order and Symbolic Computation
#index1006894
#%309858
#%310003
#%487168
#%487301
#%546169
#%546602
#%628765
#%981156
#%1006889
#%1014776
#%1014916
#%1090983
#%1342295
#%3006129
#%477350
#!
  
#*The graphical Krivine machine.
#@Sylvain Lippi
#t2007
#cHigher-Order and Symbolic Computation
#index1006896
#%310036
#%546235
#%546368
#%546376
#%888784
#%888636
#%1014773
#%1091506
#%3006100
#!
  
#*Some Reflections on Strachey and His Work.
#@Dana S. Scott
#t2000
#cHigher-Order and Symbolic Computation
#index1006897
#%775887
#%1006875
#%1094514
#!
  
#*Improving the lazy Krivine machine.
#@Daniel P. Friedman,Abdulaziz Ghuloum,Jeremy G. Siek,Onnie Lynn Winebarger
#t2007
#cHigher-Order and Symbolic Computation
#index1006898
#%2133
#%213968
#%214088
#%484209
#%546398
#%548023
#%981136
#!
  
#*Remembrances of Bob Paige.
#@Alan Siegel
#t2005
#cHigher-Order and Symbolic Computation
#index1006899
#% 
#!
  
#*A call-by-name lambda-calculus machine.
#@Jean-Louis Krivine
#t2007
#cHigher-Order and Symbolic Computation
#index1006900
#%1092757
#%1095606
#%3006100
#!
  
#*Editorial.
#@Olivier Danvy
#t2007
#cHigher-Order and Symbolic Computation
#index1006902
#% 
#!
  
#*Specification Diagrams for Actor Systems.
#@Scott F. Smith,Carolyn L. Talcott
#t2002
#cHigher-Order and Symbolic Computation
#index1006903
#%725
#%2597
#%209639
#%559526
#%625150
#%640785
#%793494
#%980736
#%1006925
#%1056847
#%1088628
#%1090976
#%1093325
#%1123699
#%1123788
#%3003139
#%3004785
#%3005872
#%3006700
#!
  
#*The next 700 Krivine machines.
#@Rémi Douence,Pascal Fradet
#t2007
#cHigher-Order and Symbolic Computation
#index1006904
#%512
#%309836
#%310000
#%484154
#%484305
#%484158
#%484209
#%487301
#%546432
#%792452
#%981156
#%981136
#%1014776
#%1056751
#%1123428
#%1123499
#%3003026
#!
  
#*Axioms for control operators in the CPS hierarchy.
#@Yukiyoshi Kameyama
#t2007
#cHigher-Order and Symbolic Computation
#index1006906
#%214182
#%309858
#%310003
#%484215
#%484236
#%485071
#%538131
#%538129
#%542561
#%546180
#%546181
#%546169
#%546788
#%1006733
#%1006676
#%1006889
#%1342295
#!
  
#*A static simulation of dynamic delimited control.
#@Chung-chieh Shan
#t2007
#cHigher-Order and Symbolic Computation
#index1006908
#%17468
#%214182
#%235637
#%309858
#%309932
#%309936
#%310014
#%310013
#%310119
#%484215
#%484217
#%484236
#%484110
#%486499
#%542494
#%542475
#%542852
#%545898
#%546180
#%546181
#%546208
#%546169
#%546365
#%546660
#%548023
#%548108
#%548309
#%888930
#%929610
#%930032
#%951787
#%980914
#%980927
#%981133
#%981108
#%1006698
#%1006818
#%1006867
#%1006901
#%1006889
#%1056528
#%1056774
#%1056717
#%1088635
#%1095606
#!
  
#*Growing a Language.
#@Guy L. Steele Jr.
#t1999
#cHigher-Order and Symbolic Computation
#index1006909
#%521963
#%521920
#%546014
#%546595
#!
  
#*Christopher Strachey and Fundamental Concepts.
#@Joseph E. Stoy
#t2000
#cHigher-Order and Symbolic Computation
#index1006910
#% 
#!
  
#*Semantics and pragmatics of Real-Time Maude.
#@Peter Csaba Ölveczky,José Meseguer
#t2007
#cHigher-Order and Symbolic Computation
#index1006911
#%45040
#%202245
#%559520
#%651561
#%879094
#%972199
#%1088803
#%1088805
#%1090136
#%1090138
#%1093844
#%1095087
#%1128403
#!
  
#*Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols.
#@José Meseguer,Prasanna Thati
#t2007
#cHigher-Order and Symbolic Computation
#index1006912
#%38995
#%45603
#%71456
#%71543
#%79474
#%83870
#%84007
#%124056
#%126957
#%173146
#%268359
#%310095
#%484562
#%484647
#%484547
#%488602
#%530168
#%543100
#%548130
#%563543
#%625318
#%651561
#%878995
#%889398
#%933658
#%949540
#%1007099
#%1076169
#%1090136
#%1091149
#%1123453
#!
  
#*Fundamental Concepts in Programming Languages.
#@Christopher Strachey
#t2000
#cHigher-Order and Symbolic Computation
#index1006913
#%773586
#!
  
#*Implementation and use of the PLT scheme Web server.
#@Shriram Krishnamurthi,Peter Walton Hopkins,Jay A. McCarthy,Paul T. Graunke,Greg Pettyjohn,Matthias Felleisen
#t2007
#cHigher-Order and Symbolic Computation
#index1006914
#%310157
#%310093
#%361953
#%484281
#%523748
#%526143
#%526241
#%542564
#%636293
#%760988
#%795608
#%981059
#%980837
#%1006867
#%1056774
#%1056883
#%1067650
#%1123441
#%1123395
#%1141822
#%523711
#!
  
#*Continuations: A Mathematical Semantics for Handling Full Jumps.
#@Christopher Strachey,Christopher P. Wadsworth
#t2000
#cHigher-Order and Symbolic Computation
#index1006915
#% 
#!
  
#*State-transition machines for lambda-calculus expressions.
#@David A. Schmidt
#t2007
#cHigher-Order and Symbolic Computation
#index1006916
#%81202
#%81379
#%268925
#!
  
#*A Hybrid Approach to Online and Offline Partial Evaluation.
#@Eijiro Sumii,Naoki Kobayashi
#t2001
#cHigher-Order and Symbolic Computation
#index1006917
#%512
#%138361
#%188883
#%189078
#%214221
#%214109
#%309862
#%310167
#%484215
#%484141
#%484236
#%538205
#%538227
#%542423
#%546180
#%546146
#%625584
#%887274
#%888930
#%889575
#%981108
#%1014794
#%1095124
#%3003225
#!
  
#*A programmable editor for developing structured documents based on bidirectional transformations.
#@Zhenjiang Hu,Shin-Cheng Mu,Masato Takeichi
#t2008
#cHigher-Order and Symbolic Computation
#index1006918
#%467227
#%544880
#%545264
#%545347
#%546199
#%598708
#%1064572
#%1118227
#%1118417
#%1118305
#!
  
#*The First Report on Scheme Revisited.
#@Gerald J. Sussman,Guy L. Steele Jr.
#t1998
#cHigher-Order and Symbolic Computation
#index1006919
#% 
#!
  
#*Proving operational termination of membership equational programs.
#@Francisco Durán,Salvador Lucas,Claude Marché,José Meseguer,Xavier Urbain
#t2008
#cHigher-Order and Symbolic Computation
#index1006920
#%39054
#%71243
#%71942
#%268598
#%538170
#%548147
#%563698
#%651561
#%888737
#%889888
#%933183
#%980870
#%993883
#%1067535
#%1089587
#%1089620
#%1090136
#%1091536
#%1095087
#!
  
#*Scheme: A Interpreter for Extended Lambda Calculus.
#@Gerald J. Sussman,Guy L. Steele Jr.
#t1998
#cHigher-Order and Symbolic Computation
#index1006921
#%770178
#%771305
#%772995
#%773401
#%773613
#!
  
#*Efficient and flexible access control via Jones-optimal logic program specialisation.
#@Steve Barker,Michael Leuschel,Mauricio Varea
#t2008
#cHigher-Order and Symbolic Computation
#index1006922
#%2261
#%66137
#%268354
#%538130
#%538145
#%545673
#%558010
#%599712
#%674111
#%819134
#%984575
#%1025205
#%1103548
#%1118286
#%1118447
#%1126484
#%1126482
#%3003225
#!
  
#*Program transformations for light-weight CPU accounting and control in the Java virtual machine.
#@Jarle Hulaas,Walter Binder
#t2008
#cHigher-Order and Symbolic Computation
#index1006924
#%9707
#%29986
#%173081
#%214158
#%235704
#%488560
#%522091
#%522599
#%523703
#%538195
#%542314
#%542696
#%542470
#%928540
#%3006554
#!
  
#*Composable Semantic Models for Actor Theories.
#@Carolyn L. Talcott
#t1998
#cHigher-Order and Symbolic Computation
#index1006925
#%114499
#%268662
#%769523
#%980736
#!
  
#*Imperative-program transformation by instrumented-interpreter specialization.
#@Søren Debois
#t2008
#cHigher-Order and Symbolic Computation
#index1006926
#%2348
#%538232
#%542724
#%542859
#%545921
#%546366
#%1006931
#%1056897
#%3003225
#!
  
#*Editorial.
#@Julia L. Lawall,Michael Leuschel,Peter Sestoft
#t2008
#cHigher-Order and Symbolic Computation
#index1006928
#% 
#!
  
#*Abstract Models of Storage.
#@Robert D. Tennent,Dan R. Ghica
#t2000
#cHigher-Order and Symbolic Computation
#index1006929
#%268926
#%494384
#%494559
#%546274
#%546523
#%546690
#%546588
#%628879
#%772823
#%889059
#%889609
#%951316
#%951314
#%1088704
#%1089083
#%1091274
#%1093811
#%1094514
#%3001621
#!
  
#*A Retrospective on Region-Based Memory Management.
#@Mads Tofte,Lars Birkedal,Martin Elsman,Niels Hallenberg
#t2004
#cHigher-Order and Symbolic Computation
#index1006930
#%66715
#%188830
#%188892
#%309863
#%310155
#%465095
#%465223
#%484101
#%484134
#%484327
#%484401
#%526192
#%542344
#%542355
#%542610
#%542591
#%542580
#%542601
#%542581
#%542751
#%545881
#%545949
#%546047
#%545941
#%546028
#%546316
#%546413
#%546835
#%548067
#%628133
#%628952
#%636128
#%770672
#%775563
#%887353
#%889575
#%889653
#%929764
#%980795
#%1025613
#%1089414
#%1123961
#%1123947
#%546493
#!
  
#*Static and Dynamic Program Compilation by Interpreter Specialization.
#@Scott Thibault,Charles Consel,Julia L. Lawall,Renaud Marlet,Gilles Muller
#t2000
#cHigher-Order and Symbolic Computation
#index1006931
#%142
#%137083
#%214142
#%269098
#%289554
#%297407
#%309981
#%523736
#%538187
#%538185
#%538222
#%542399
#%542788
#%542917
#%546144
#%546146
#%546148
#%572793
#%588599
#%617275
#%832471
#%1006741
#%1071391
#%1093631
#%1129675
#%3003225
#!
  
#*Totally correct logic program transformations via well-founded annotations.
#@Alberto Pettorossi,Maurizio Proietti
#t2008
#cHigher-Order and Symbolic Computation
#index1006932
#% 
#!
  
#*Comparing Control Constructs by Double-Barrelled CPS.
#@Hayo Thielecke
#t2002
#cHigher-Order and Symbolic Computation
#index1006933
#%485071
#%1006646
#%1006877
#%1006879
#%1006791
#!
  
#*Semantics of roundoff error propagation in finite precision calculations.
#@Matthieu Martel
#t2006
#cHigher-Order and Symbolic Computation
#index1006934
#%49515
#%117649
#%188836
#%188911
#%538159
#%546057
#%572786
#%832535
#%994281
#%1080447
#%1123585
#%3003090
#!
  
#*Dynamic slicing of lazy functional programs based on redex trails.
#@Claudio Ochoa,Josep Silva,Germán Vidal
#t2008
#cHigher-Order and Symbolic Computation
#index1006935
#%24708
#%138127
#%538315
#%543367
#%545947
#%546278
#%546484
#%548072
#%869516
#%932255
#%980885
#%1056963
#%1123473
#%3580722
#!
  
#*Totally correct logic program transformations via well-founded annotations.
#@Alberto Pettorossi,Maurizio Proietti
#t2008
#cHigher-Order and Symbolic Computation
#index1006936
#% 
#!
  
#*Flattening tuples in an SSA intermediate representation.
#@Lukasz Ziarek,Stephen Weeks,Suresh Jagannathan
#t2008
#cHigher-Order and Symbolic Computation
#index1340015
#%189078
#%310049
#%413870
#%465210
#%484333
#%542848
#%542846
#%546348
#%546432
#%546834
#%981048
#%1006879
#%1006930
#%1006829
#%1095124
#%1123898
#%1123927
#!
  
#*An investigation of Jones optimality and BTI-universal specializers.
#@Robert Glück
#t2008
#cHigher-Order and Symbolic Computation
#index1340009
#%65609
#%65868
#%137933
#%138253
#%185727
#%214145
#%268354
#%534034
#%538142
#%538103
#%538101
#%538176
#%538345
#%542859
#%543069
#%546399
#%572699
#%930675
#%931324
#%1006760
#%1006922
#%1006926
#%1056897
#%1123438
#%3003225
#%568560
#!
  
#*Adapting functional programs to higher order logic.
#@Scott Owens,Konrad Slind
#t2008
#cHigher-Order and Symbolic Computation
#index1340010
#%71911
#%216530
#%268089
#%484215
#%486772
#%546406
#%546454
#%548108
#%572689
#%581519
#%613275
#%629539
#%629540
#%629423
#%631838
#%646847
#%776541
#%949891
#%954754
#%954873
#%954930
#%980730
#%980968
#%980833
#%980922
#%981041
#%981023
#%981203
#%980887
#%1006715
#%1089335
#!
  
#*Flow-sensitive type systems and the ambient calculus.
#@Torben Amtoft
#t2008
#cHigher-Order and Symbolic Computation
#index1340017
#%114495
#%197278
#%213642
#%220056
#%522584
#%546013
#%546450
#%546578
#%625627
#%646784
#%866883
#%887383
#%888716
#%889575
#%931496
#%1025728
#%1093763
#%1094184
#!
  
#*On the implementation of automatic differentiation tools.
#@Christian H. Bischof,Paul D. Hovland,Boyana Norris
#t2008
#cHigher-Order and Symbolic Computation
#index1340011
#%2288
#%2348
#%279664
#%310066
#%448914
#%449415
#%601284
#%773744
#%776988
#%776924
#%1006759
#%1073607
#%1121209
#%1121387
#%1121353
#%1342296
#!
  
#*Types and trace effects for object orientation.
#@Christian Skalka
#t2008
#cHigher-Order and Symbolic Computation
#index1340012
#%44793
#%83809
#%83866
#%114177
#%123870
#%173660
#%310039
#%310132
#%538199
#%542423
#%542566
#%545952
#%546047
#%546136
#%546341
#%546613
#%546916
#%546824
#%548191
#%548056
#%572903
#%615548
#%625648
#%636754
#%889653
#%970494
#%981219
#%1006930
#%1006895
#%1077763
#%1103570
#%1123631
#%1123808
#%1123807
#%1124021
#%1342298
#!
  
#*Editorial.
#@Olivier Danvy,R. Kent Dybvig,Julia L. Lawall,Peter Thiemann
#t2008
#cHigher-Order and Symbolic Computation
#index1340014
#% 
#!
  
#*Editorial.
#@Olivier Danvy,Ian A. Mason
#t2008
#cHigher-Order and Symbolic Computation
#index1340013
#% 
#!
  
#*Nesting forward-mode AD in a functional framework.
#@Jeffrey Mark Siskind,Barak A. Pearlmutter
#t2008
#cHigher-Order and Symbolic Computation
#index1340016
#%310066
#%310004
#%546940
#%776924
#%1006759
#%1342296
#%3004461
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2009
#cHigher-Order and Symbolic Computation
#index2866041
#% 
#!
  
#*Expressible sharing for functional circuit description.
#@Matthew Naylor,Colin Runciman
#t2009
#cHigher-Order and Symbolic Computation
#index2866039
#%214054
#!
  
#*Peter J. Landin (1930-2009).
#@Olivier Danvy
#t2009
#cHigher-Order and Symbolic Computation
#index2866040
#%484215
#%546208
#%548108
#%773588
#%773590
#%774426
#%1006790
#%1006820
#%1006875
#%1006877
#%1006791
#%1006837
#%1227324
#!
  
#*Visual Lisp/CLOS programming in OpenMusic.
#@Jean Bresson,Carlos Agon,Gérard Assayag
#t2009
#cHigher-Order and Symbolic Computation
#index2866050
#%640893
#%771929
#%806537
#%980739
#%2893743
#%2988178
#!
  
#*On typing delimited continuations: three new solutions to the printf problem.
#@Kenichi Asai
#t2009
#cHigher-Order and Symbolic Computation
#index2866044
#%310003
#%484215
#%495022
#%546180
#%546788
#%980910
#%980803
#%1056774
#%1342295
#!
  
#*Compilation of extended recursion in call-by-value functional languages.
#@Tom Hirschowitz,Xavier Leroy,J. B. Wells
#t2009
#cHigher-Order and Symbolic Computation
#index2866047
#%512
#%980864
#%579426
#%1056751
#%542494
#%546125
#%310197
#%309874
#%1123610
#%548079
#%1006646
#%600806
#%706519
#%310106
#%981202
#%542848
#%868906
#%1006816
#%889799
#!
  
#*Directly reflective meta-programming.
#@Aaron Stump
#t2009
#cHigher-Order and Symbolic Computation
#index2866051
#%85
#%141
#%649
#%214224
#%309930
#%484228
#%522150
#%546430
#%546453
#%546762
#%546948
#%626599
#%628892
#%774141
#%980787
#%981121
#%981125
#%1006822
#%1123990
#%2939390
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2009
#cHigher-Order and Symbolic Computation
#index2866046
#% 
#!
  
#*A type-theoretic foundation of delimited continuations.
#@Zena M. Ariola,Hugo Herbelin,Amr Sabry
#t2009
#cHigher-Order and Symbolic Computation
#index2866049
#%126846
#%214182
#%309858
#%309934
#%310003
#%328079
#%484215
#%484308
#%484110
#%485071
#%487301
#%543265
#%546180
#%546181
#%546169
#%546602
#%548309
#%628765
#%792422
#%981200
#%1006818
#%1006901
#%1006733
#%1006933
#%1006800
#%1006826
#%1007266
#%1006835
#%1090290
#%1090978
#%1090983
#%1342295
#!
  
#*A principled approach to programming with nested types in Haskell.
#@Patricia Johann,Neil Ghani
#t2009
#cHigher-Order and Symbolic Computation
#index2866048
#%213903
#%214213
#%214170
#%309944
#%309995
#%484680
#%507747
#%546311
#%546957
#%552996
#%876374
#%980906
#%980908
#%980849
#%981022
#%1006751
#%1014870
#%1025759
#%1088652
#%1089083
#%1342303
#!
  
#*A verified framework for higher-order uncurrying optimizations.
#@Zaynah Dargaye,Xavier Leroy
#t2009
#cHigher-Order and Symbolic Computation
#index2866043
#%309975
#%484473
#%542760
#%542848
#%546186
#%546432
#%546298
#%546564
#%546888
#%546911
#%546815
#%625363
#%981080
#%1006709
#%1006900
#%1056751
#%1056865
#%1123289
#%1123990
#!
  
#*Editorial.
#@Olivier Danvy,Julian A. Padget
#t2009
#cHigher-Order and Symbolic Computation
#index2866042
#% 
#!
  
#*A minimalistic look at widening operators.
#@David Monniaux
#t2009
#cHigher-Order and Symbolic Computation
#index2866045
#%65633
#%542398
#%546076
#%79493
#%546986
#!
  
#*An introduction to Landin's "Getting Rid of Labels".
#@Robert D. Tennent
#t2009
#cHigher-Order and Symbolic Computation
#index2925770
#%769685
#%771307
#%773590
#%775496
#%790653
#%832662
#%1006875
#%1006791
#!
  
#*Editorial.
#@Olivier Danvy,Carolyn L. Talcott
#t2009
#cHigher-Order and Symbolic Computation
#index2925771
#% 
#!
  
#*Calculations.
#@Peter J. Landin
#t2009
#cHigher-Order and Symbolic Computation
#index2925768
#% 
#!
  
#*The Peter Landin prize.
#@Kevin Hammond,Greg Michaelson
#t2009
#cHigher-Order and Symbolic Computation
#index2925772
#%214070
#%384970
#%384985
#%385008
#%445468
#%529298
#%546334
#%773590
#%981094
#%981130
#%1035898
#%1243460
#%1253941
#%1321722
#!
  
#*Peter Landin: a computer scientist who inspired a generation.
#@Richard Bornat
#t2009
#cHigher-Order and Symbolic Computation
#index2925767
#% 
#!
  
#*Personal recollections of Peter Landin: 1987-2009.
#@Paul Boca
#t2009
#cHigher-Order and Symbolic Computation
#index2925774
#%773590
#!
  
#*Stories about calculations: remembering Peter Landin.
#@Tony Clark
#t2009
#cHigher-Order and Symbolic Computation
#index2925773
#%3005070
#!
  
#*Getting rid of labels.
#@Peter J. Landin
#t2009
#cHigher-Order and Symbolic Computation
#index2925769
#%775278
#%775496
#!
  
#*Keeping calm in the face of change - Towards optimisation of FRP by reasoning about change.
#@Neil Sculthorpe,Henrik Nilsson
#t2010
#cHigher-Order and Symbolic Computation
#index3161642
#% 
#!
  
#*A lean specification for GADTs: system F with first-class equality proofs.
#@Arie Middelkoop,Atze Dijkstra,S. Doaitse Swierstra
#t2010
#cHigher-Order and Symbolic Computation
#index3161645
#%310150
#%309866
#%310001
#%546642
#%628973
#%628972
#%1236880
#%1247189
#%1325376
#%1326296
#!
  
#*Magic-sets for localised analysis of Java bytecode.
#@Fausto Spoto,Étienne Payet
#t2010
#cHigher-Order and Symbolic Computation
#index3161644
#%81542
#%173192
#%188860
#%209710
#%209714
#%522625
#%525838
#%526332
#%542485
#%546062
#%546076
#%546057
#%572865
#%581661
#%646868
#%722062
#%734687
#%869930
#%970642
#%984300
#%984357
#%1006921
#%1006895
#%1056567
#%1057362
#%1078407
#%1090189
#%1124004
#%2851555
#%2871334
#%3005873
#%3079243
#!
  
#*The two variable per inequality abstract domain.
#@Axel Simon,Andy King
#t2010
#cHigher-Order and Symbolic Computation
#index3161647
#%3482
#%40235
#%65633
#%81477
#%257518
#%481075
#%486773
#%526332
#%542398
#%542312
#%543125
#%546062
#%546076
#%546057
#%547974
#%572516
#%572588
#%572990
#%623263
#%775196
#%787282
#%820199
#%842933
#%878914
#%879096
#%931471
#%949698
#%951594
#%951596
#%984357
#%1006848
#%1059529
#%1059469
#%1059809
#%1093208
#%1123470
#%3006547
#!
  
#*Space-efficient gradual typing.
#@David Herman,Aaron Tomb,Cormac Flanagan
#t2010
#cHigher-Order and Symbolic Computation
#index3161641
#%173405
#%189141
#%309892
#%309928
#%310049
#%384911
#%522847
#%546186
#%546928
#%546886
#%546878
#%736106
#%981123
#%1056865
#%1123460
#%1321681
#%1343552
#!
  
#*Linearity and iterator types for Gödel's System.
#@Sandra Alves,Maribel Fernández,Mário Florido,Ian Mackie
#t2010
#cHigher-Order and Symbolic Computation
#index3161646
#% 
#!
  
#*Hume box calculus: robust system development through software transformation.
#@Gudmund Grov,Greg Michaelson
#t2010
#cHigher-Order and Symbolic Computation
#index3161643
#%2597
#%196091
#%235721
#%384990
#%471543
#%569399
#%576903
#%876129
#%949922
#%994698
#%1088628
#%1089058
#%1090542
#%1123699
#%2939527
#%3002961
#%3478863
#!
  
#*Mnemonics: type-safe bytecode generation at run time.
#@Johannes Rudolph,Peter Thiemann
#t2010
#cHigher-Order and Symbolic Computation
#index3269103
#%832338
#%235665
#%981165
#%954739
#%1091619
#%484222
#%869572
#%3580704
#%1006795
#%542721
#%310249
#%774428
#%628146
#%546596
#%310180
#%1123831
#%466745
#%2943950
#%954924
#%1123926
#%546805
#%546855
#!
  
#*Making "stricterness" more relevant.
#@Stefan Holdermans,Jurriaan Hage
#t2010
#cHigher-Order and Symbolic Computation
#index3269102
#% 
#!
  
#*Editorial.
#@John P. Gallagher,Janis Voigtländer
#t2010
#cHigher-Order and Symbolic Computation
#index3269106
#% 
#!
  
#*Generic multiset programming with discrimination-based joins and symbolic Cartesian products.
#@Fritz Henglein,Ken Friis Larsen
#t2010
#cHigher-Order and Symbolic Computation
#index3269105
#%38688
#%145248
#%209407
#%304132
#%310256
#%484275
#%523753
#%544923
#%546851
#%599326
#%599638
#%642688
#%643839
#%706462
#%832283
#%832557
#%973120
#%981082
#%1089796
#%1118189
#%1186028
#%1196252
#%1214172
#%1247186
#%1321652
#%2881973
#%3018433
#%3138993
#%3148340
#!
  
#*Context-sensitive analysis without calling-context.
#@Arun Lakhotia,Davidson R. Boccardo,Anshuman Singh,Aleardo Manacero Jr.
#t2010
#cHigher-Order and Symbolic Computation
#index3269104
#%81552
#%83992
#%86544
#%133616
#%364266
#%364270
#%538344
#%542592
#%542533
#%542715
#%542943
#%542915
#%546062
#%546084
#%546057
#%546946
#%576848
#%576898
#%581724
#%646906
#%659559
#%776547
#%918421
#%1057108
#%1094348
#%1128745
#%1310149
#%2812590
#%2863619
#%2871349
#!
  
#*More dependent types for distributed arrays.
#@Wouter Swierstra
#t2010
#cHigher-Order and Symbolic Computation
#index3395512
#%196230
#%310001
#%310180
#%521983
#%523065
#%546949
#%706469
#%832663
#%981130
#%1127718
#%3506725
#!
  
#*A multi-tier semantics for Hop.
#@Manuel Serrano,Christian Queinnec
#t2010
#cHigher-Order and Symbolic Computation
#index3395521
#%188736
#%209407
#%309930
#%546570
#%628109
#%675083
#%675060
#%778065
#%1006646
#%1006867
#%1206352
#%1253623
#%1254625
#!
  
#*Shortcut fusion rules for the derivation of circular and higher-order programs.
#@Alberto Pardo,João Paulo Fernandes,João Saraiva
#t2011
#cHigher-Order and Symbolic Computation
#index3395513
#%38692
#%81339
#%189078
#%208268
#%214087
#%214213
#%214224
#%214170
#%224600
#%310075
#%309962
#%379653
#%526328
#%538298
#%546049
#%546171
#%546936
#%706457
#%980941
#%981233
#%1006814
#%1095124
#%2939527
#!
  
#*Static consistency checking for Verilog wire interconnects - Using dependent types to check the sanity of Verilog descriptions.
#@Cherif Salama,Gregory Malecha,Walid Taha,Jim Grundy,John O'Leary
#t2011
#cHigher-Order and Symbolic Computation
#index3395520
#% 
#!
  
#*Trends in Trends in Functional Programming 1999/2000 versus 2007/2008.
#@Peter Achten,Marko C. J. D. van Eekelen,Pieter W. M. Koopman,Marco T. Morazán
#t2010
#cHigher-Order and Symbolic Computation
#index3395519
#%162
#%2608
#%188855
#%189078
#%189148
#%208409
#%209407
#%309929
#%309945
#%309871
#%310180
#%384848
#%384966
#%384860
#%384913
#%384987
#%526241
#%529969
#%530131
#%538385
#%542887
#%546047
#%546049
#%546316
#%586438
#%586447
#%586446
#%586456
#%586466
#%586444
#%586434
#%586435
#%586441
#%586443
#%586469
#%586432
#%586454
#%586445
#%586458
#%586439
#%586448
#%586450
#%586453
#%586460
#%586440
#%586451
#%586433
#%586430
#%586437
#%586462
#%586467
#%586471
#%741511
#%777739
#%790737
#%949841
#%981094
#%981136
#%1056865
#%1056970
#%1095124
#%1123226
#%1123572
#%1247189
#%1326311
#%1326301
#%1338806
#%1343552
#%2953820
#%3303882
#%3441824
#%3580703
#%546830
#!
  
#*A functional approach to generic programming using adaptive traversals.
#@Bryan Chadwick,Karl J. Lieberherr
#t2010
#cHigher-Order and Symbolic Computation
#index3395518
#%173152
#%173102
#%214207
#%310019
#%310020
#%521781
#%522880
#%523036
#%526145
#%546311
#%628144
#%628957
#%713926
#%770181
#%889799
#%935006
#%950201
#%1006646
#%1090469
#%1123397
#%1123966
#%1236883
#%1242225
#%2776186
#%2866051
#%3506723
#!
  
#*Improving type error messages for generic Java.
#@Nabil El Boustani,Jurriaan Hage
#t2011
#cHigher-Order and Symbolic Computation
#index3395517
#%188855
#%309840
#%384876
#%384989
#%523019
#%538379
#%546047
#%546371
#%568650
#%586471
#%706500
#%870539
#%987992
#%1056756
#%1056856
#%1123709
#%1321653
#%1342305
#%3580703
#%3580714
#%546830
#!
  
#*Logical approximation for program analysis.
#@Robert J. Simmons,Frank Pfenning
#t2011
#cHigher-Order and Symbolic Computation
#index3395516
#%71172
#%163683
#%219661
#%269415
#%310208
#%328060
#%538390
#%545281
#%546057
#%548129
#%548167
#%548068
#%631801
#%815218
#%819102
#%819153
#%868561
#%888247
#%951128
#%987060
#%1009855
#%1093503
#%1095574
#%1126513
#%1126511
#%1252081
#%1253596
#%1273104
#%2812581
#%2856065
#%2900970
#%2914739
#!
  
#*Side-effect localization for lazy, purely functional languages via aspects.
#@Kung Chen,Shu-Chun Weng,Jia-Yin Lin,Meng Wang,Siau-Cheng Khoo
#t2011
#cHigher-Order and Symbolic Computation
#index3395514
#%173081
#%310043
#%538287
#%542561
#%546291
#%546053
#%546821
#%546836
#%546398
#%572958
#%586448
#%713909
#%1056699
#%1124081
#%1247169
#%2776194
#%3580719
#!
  
#*Editorial.
#@Julia Lawall,Germán Puebla,Germán Vidal
#t2011
#cHigher-Order and Symbolic Computation
#index3395515
#% 
#!
  
#*Continuation-Passing C, compiling threads to events through continuations.
#@Gabriel Kerneis,Juliusz Chroboczek
#t2011
#cHigher-Order and Symbolic Computation
#index3482317
#% 
#!
  
#*Path resolution for nested recursive modules.
#@Jacques Garrigue,Keiko Nakata
#t2011
#cHigher-Order and Symbolic Computation
#index3482315
#% 
#!
  
#*A proof of Moessner's theorem by coinduction.
#@Milad Niqui,Jan J. M. M. Rutten
#t2011
#cHigher-Order and Symbolic Computation
#index3482316
#% 
#!
  
#*Programs as polygraphs: computability and complexity
#@Guillaume Bonfante,Yves Guiraud
#t2007
#cLogical Methods in Computer Science
#index819732
#% 
#!
  
#*Solving Simple Stochastic Games with Few Random Vertices
#@Hugo Gimbert,Florian Horn
#t2007
#cLogical Methods in Computer Science
#index825669
#% 
#!
  
#*Formalising the pi-calculus using nominal logic
#@Jesper Bengtson,Joachim Parrow
#t2008
#cLogical Methods in Computer Science
#index828465
#% 
#!
  
#*Algorithms for Game Metrics (Full Version)
#@Krishnendu Chatterjee,Luca de Alfaro,Rupak Majumdar,Vishwanath Raman
#t2008
#cLogical Methods in Computer Science
#index828482
#% 
#!
  
#*The Church Problem for Countable Ordinals
#@Alexander Rabinovich
#t2008
#cLogical Methods in Computer Science
#index828957
#% 
#!
  
#*The Complexity of Generalized Satisfiability for Linear Temporal Logic
#@Michael Bauland,Thomas Schneider,Henning Schnoor,Ilka Schnoor,Heribert Vollmer
#t2008
#cLogical Methods in Computer Science
#index829338
#%621778
#%485015
#%3005498
#%211625
#%889194
#%951612
#!
  
#*Beyond Language Equivalence on Visibly Pushdown Automata
#@Jirí Srba
#t2009
#cLogical Methods in Computer Science
#index829494
#% 
#!
  
#*The Safe Lambda Calculus
#@William Blum,C.-H. Luke Ong
#t2009
#cLogical Methods in Computer Science
#index829525
#% 
#!
  
#*A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
#@Koen Claessen,Jan-Willem Roorda
#t2009
#cLogical Methods in Computer Science
#index829532
#% 
#!
  
#*Cut-Simulation and Impredicativity
#@Christoph Benzmüller,Chad E. Brown,Michael Kohlhase
#t2009
#cLogical Methods in Computer Science
#index829600
#% 
#!
  
#*Neighbourhood Structures: Bisimilarity and Basic Model Theory
#@Helle Hvid Hansen,Clemens Kupke,Eric Pacuit
#t2009
#cLogical Methods in Computer Science
#index829658
#% 
#!
  
#*The Complexity of Datalog on Linear Orders
#@Martin Grohe,Götz Schwandtner
#t2009
#cLogical Methods in Computer Science
#index829771
#% 
#!
  
#*Polynomial Size Analysis of First-Order Shapely Functions
#@Olha Shkaravska,Marko C. J. D. van Eekelen,Ron van Kesteren
#t2009
#cLogical Methods in Computer Science
#index829833
#% 
#!
  
#*Antichains for the Automata-Based Approach to Model-Checking
#@Laurent Doyen,Jean-François Raskin
#t2009
#cLogical Methods in Computer Science
#index829949
#% 
#!
  
#*Footprints in Local Reasoning
#@Mohammad Raza,Philippa Gardner
#t2009
#cLogical Methods in Computer Science
#index830090
#%545974
#%545882
#%869410
#%485310
#%546344
#%1123771
#%1095600
#%485064
#%1094122
#%485149
#%213824
#!
  
#*The Omega Rule is \mathbf{\Pi_{1}^{1}}-Complete in the \lambda\beta-Calculus
#@Benedetto Intrigila,Richard Statman
#t2009
#cLogical Methods in Computer Science
#index830107
#% 
#!
  
#*Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
#@José Espírito Santo,Ralph Matthes,Luis Pinto
#t2009
#cLogical Methods in Computer Science
#index830140
#% 
#!
  
#*On tiered small jump operators
#@Jean-Yves Marion
#t2009
#cLogical Methods in Computer Science
#index830180
#% 
#!
  
#*Qualitative Logics and Equivalences for Probabilistic Systems
#@Krishnendu Chatterjee,Luca de Alfaro,Marco Faella,Axel Legay
#t2009
#cLogical Methods in Computer Science
#index830183
#% 
#!
  
#*A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
#@Ahmed Bouajjani,Cezara Dragoi,Constantin Enea,Yan Jurski,Mihaela Sighireanu
#t2009
#cLogical Methods in Computer Science
#index830226
#% 
#!
  
#*Ranking Functions for Size-Change Termination II
#@Amir M. Ben-Amram,Chin Soon Lee
#t2009
#cLogical Methods in Computer Science
#index830303
#% 
#!
  
#*Explicit fairness in testing semantics
#@Diletta Cacciagrano,Flavio Corradini,Catuscia Palamidessi
#t2009
#cLogical Methods in Computer Science
#index830542
#% 
#!
  
#*Universal Structures and the logic of Forbidden Patterns
#@Florent R. Madelaine
#t2009
#cLogical Methods in Computer Science
#index830554
#% 
#!
  
#*Two-Way Unary Temporal Logic over Trees
#@Mikolaj Bojanczyk
#t2009
#cLogical Methods in Computer Science
#index830672
#% 
#!
  
#*Simulating reachability using first-order logic with applications to verification of linked data structures
#@Tal Lev-Ami,Neil Immerman,Thomas W. Reps,Mooly Sagiv,Siddharth Srivastava,Greta Yorsh
#t2009
#cLogical Methods in Computer Science
#index830712
#% 
#!
  
#*Computably Based Locally Compact Spaces.
#@Paul Taylor
#t2006
#cLogical Methods in Computer Science
#index1006937
#% 
#!
  
#*Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
#@Luca Aceto,Wan Fokkink,Anna Ingólfsdóttir,Bas Luttik
#t2005
#cLogical Methods in Computer Science
#index1006938
#% 
#!
  
#*Strong normalization for applied lambda calculi.
#@Ulrich Berger
#t2005
#cLogical Methods in Computer Science
#index1006939
#% 
#!
  
#*An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
#@Malgorzata Biernacka,Dariusz Biernacki,Olivier Danvy
#t2005
#cLogical Methods in Computer Science
#index1006940
#% 
#!
  
#*General recursion via coinductive types.
#@Venanzio Capretta
#t2005
#cLogical Methods in Computer Science
#index1006941
#% 
#!
  
#*Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA.
#@Willem Conradie,Valentin Goranko,Dimiter Vakarelov
#t2006
#cLogical Methods in Computer Science
#index1006942
#% 
#!
  
#*The monadic second-order logic of graphs XVI : Canonical graph decompositions.
#@Bruno Courcelle
#t2006
#cLogical Methods in Computer Science
#index1006943
#% 
#!
  
#*Linear datalog and bounded path duality of relational structures.
#@Víctor Dalmau
#t2005
#cLogical Methods in Computer Science
#index1006944
#% 
#!
  
#*Extending the theory of Owicki and Gries with a logic of progress.
#@Brijesh Dongol,Doug Goldson
#t2006
#cLogical Methods in Computer Science
#index1006945
#% 
#!
  
#*Model-checking problems as a basis for parameterized intractability.
#@Jörg Flum,Martin Grohe
#t2005
#cLogical Methods in Computer Science
#index1006946
#% 
#!
  
#*Security Policies as Membranes in Systems for Global Computing.
#@Daniele Gorla,Matthew Hennessy,Vladimiro Sassone
#t2005
#cLogical Methods in Computer Science
#index1006947
#%1088823
#%1089893
#%3569059
#%114231
#%1091404
#%888213
#%546340
#%546696
#%546736
#!
  
#*The succinctness of first-order logic on linear orders.
#@Martin Grohe,Nicole Schweikardt
#t2005
#cLogical Methods in Computer Science
#index1006948
#% 
#!
  
#*Approximate reasoning for real-time probabilistic processes.
#@Vineet Gupta,Radha Jagadeesan,Prakash Panangaden
#t2006
#cLogical Methods in Computer Science
#index1006949
#% 
#!
  
#*Probabilistic Algorithmic Knowledge.
#@Joseph Y. Halpern,Riccardo Pucella
#t2005
#cLogical Methods in Computer Science
#index1006950
#% 
#!
  
#*Modularizing the Elimination of r=0 in Kleene Algebra.
#@Christopher Hardin
#t2005
#cLogical Methods in Computer Science
#index1006951
#% 
#!
  
#*On the Expressiveness of the Ambient Logic.
#@Daniel Hirschkoff,Étienne Lozes,Davide Sangiorgi
#t2006
#cLogical Methods in Computer Science
#index1006952
#% 
#!
  
#*Labelled transition systems as a Stone space.
#@Michael Huth
#t2005
#cLogical Methods in Computer Science
#index1006953
#% 
#!
  
#*Contextual equivalence for higher-order pi-calculus revisited.
#@Alan Jeffrey,Julian Rathke
#t2005
#cLogical Methods in Computer Science
#index1006954
#% 
#!
  
#*Model Checking Probabilistic Pushdown Automata.
#@Antonín Kucera,Javier Esparza,Richard Mayr
#t2006
#cLogical Methods in Computer Science
#index1006955
#% 
#!
  
#*Modal Logics of Topological Relations.
#@Carsten Lutz,Frank Wolter
#t2006
#cLogical Methods in Computer Science
#index1006956
#% 
#!
  
#*Comparing hierarchies of total functionals.
#@Dag Normann
#t2005
#cLogical Methods in Computer Science
#index1006957
#% 
#!
  
#*Internalising modified realisability in constructive type theory.
#@Erik Palmgren
#t2005
#cLogical Methods in Computer Science
#index1006958
#% 
#!
  
#*Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds.
#@Sanjit A. Seshia,Randal E. Bryant
#t2005
#cLogical Methods in Computer Science
#index1006959
#% 
#!
  
#*Almost periodic functions, constructively.
#@Bas Spitters
#t2005
#cLogical Methods in Computer Science
#index1006960
#% 
#!
  
#*A System of Interaction and Structure II: The Need for Deep Inference.
#@Alwen Tiu
#t2006
#cLogical Methods in Computer Science
#index1006961
#% 
#!
  
#*Theories for TC0 and Other Small Complexity Classes.
#@Phuong Nguyen,Stephen A. Cook
#t2006
#cLogical Methods in Computer Science
#index1006962
#% 
#!
  
#*Context-Sensitive Languages, Rational Graphs and Determinism.
#@Arnaud Carayol,Antoine Meyer
#t2006
#cLogical Methods in Computer Science
#index1006963
#% 
#!
  
#*Positional Determinacy of Games with Infinitely Many Priorities.
#@Erich Grädel,Igor Walukiewicz
#t2006
#cLogical Methods in Computer Science
#index1006964
#% 
#!
  
#*Logics for Unranked Trees: An Overview.
#@Leonid Libkin
#t2006
#cLogical Methods in Computer Science
#index1006965
#%71
#%484405
#%949691
#%484480
#%113998
#%981106
#%1064785
#%188809
#%545887
#%887537
#%1090208
#%546045
#%484695
#%484696
#%950503
#%950504
#%545075
#%950507
#%622187
#%484904
#%484923
#%545227
#%888934
#%124715
#%545332
#%1093734
#%494277
#%626617
#%204314
#%3276061
#%545402
#%545418
#%951671
#%973033
#%269126
#%1095138
#!
  
#*Generalized Majority-Minority Operations are Tractable.
#@Víctor Dalmau
#t2006
#cLogical Methods in Computer Science
#index1006966
#% 
#!
  
#*Solution of a Problem of Barendregt on Sensible lambda-Theories.
#@Benedetto Intrigila,Richard Statman
#t2006
#cLogical Methods in Computer Science
#index1006967
#% 
#!
  
#*On the complexity of XPath containment in the presence of disjunction, DTDs, and variables.
#@Frank Neven,Thomas Schwentick
#t2006
#cLogical Methods in Computer Science
#index1006968
#% 
#!
  
#*Tarski's influence on computer science.
#@Solomon Feferman
#t2006
#cLogical Methods in Computer Science
#index1006969
#% 
#!
  
#*Combining decision procedures for the reals.
#@Jeremy Avigad,Harvey Friedman
#t2006
#cLogical Methods in Computer Science
#index1006970
#% 
#!
  
#*Relational Parametricity and Control.
#@Masahito Hasegawa
#t2006
#cLogical Methods in Computer Science
#index1006971
#% 
#!
  
#*Resource Usage Analysis for the p-Calculus.
#@Naoki Kobayashi,Kohei Suenaga,Lucian Wischik
#t2006
#cLogical Methods in Computer Science
#index1006972
#% 
#!
  
#*Efficient Open World Reasoning for Planning.
#@Tamara Babaian,James G. Schmolze
#t2006
#cLogical Methods in Computer Science
#index1006973
#% 
#!
  
#*A State-Based Regression Formulation for Domains with Sensing Actions and Incomplete Information.
#@Le-Chi Tuan,Chitta Baral,Tran Cao Son
#t2006
#cLogical Methods in Computer Science
#index1006974
#% 
#!
  
#*From Proof Nets to the Free *-Autonomous Category.
#@François Lamarche,Lutz Straßburger
#t2006
#cLogical Methods in Computer Science
#index1006975
#% 
#!
  
#*Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative.
#@Kristian Støvring
#t2006
#cLogical Methods in Computer Science
#index1006976
#% 
#!
  
#*Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages.
#@Lars Birkedal,Noah Torp-Smith,Hongseok Yang
#t2006
#cLogical Methods in Computer Science
#index1006977
#% 
#!
  
#*Linear Abadi and Plotkin Logic.
#@Lars Birkedal,Rasmus Ejlers Møgelberg,Rasmus Lerchedahl Petersen
#t2006
#cLogical Methods in Computer Science
#index1006978
#% 
#!
  
#*Linear Encodings of Bounded LTL Model Checking.
#@Armin Biere,Keijo Heljanko,Tommi A. Junttila,Timo Latvala,Viktor Schuppan
#t2006
#cLogical Methods in Computer Science
#index1006979
#% 
#!
  
#*Elgot Algebras.
#@Jirí Adámek,Stefan Milius,Jiri Velebil
#t2006
#cLogical Methods in Computer Science
#index1006980
#%1088611
#%1014611
#%494960
#%950460
#%628776
#%1093597
#%485241
#!
  
#*The Completeness of Propositional Resolution: A Simple and Constructive Proof.
#@Jean H. Gallier
#t2006
#cLogical Methods in Computer Science
#index1006981
#% 
#!
  
#*The Church Synthesis Problem with Parameters.
#@Alexander Rabinovich
#t2007
#cLogical Methods in Computer Science
#index1006982
#% 
#!
  
#*Predicate Abstraction with Under-Approximation Refinement.
#@Corina S. Pasareanu,Radek Pelánek,Willem Visser
#t2007
#cLogical Methods in Computer Science
#index1006983
#% 
#!
  
#*A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.
#@Klaus Aehlig
#t2007
#cLogical Methods in Computer Science
#index1006984
#%124278
#%888303
#%628821
#%213773
#%484932
#!
  
#*Cores of Countably Categorical Structures.
#@Manuel Bodirsky
#t2007
#cLogical Methods in Computer Science
#index1006985
#% 
#!
  
#*A Normalizing Intuitionistic Set Theory with Inaccessible Sets.
#@Wojciech Moczydlowski
#t2007
#cLogical Methods in Computer Science
#index1006986
#% 
#!
  
#*Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.
#@Andreas Blass,Yuri Gurevich,Dean Rosenzweig,Benjamin Rossman
#t2007
#cLogical Methods in Computer Science
#index1006987
#% 
#!
  
#*From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata.
#@Nir Piterman
#t2007
#cLogical Methods in Computer Science
#index1006988
#% 
#!
  
#*Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.
#@Vincent Atassi,Patrick Baillot,Kazushige Terui
#t2007
#cLogical Methods in Computer Science
#index1006989
#% 
#!
  
#*Model Checking Synchronized Products of Infinite Transition Systems.
#@Stefan Wöhrle,Wolfgang Thomas
#t2007
#cLogical Methods in Computer Science
#index1006990
#% 
#!
  
#*Interactive Small-Step Algorithms I: Axiomatization.
#@Andreas Blass,Yuri Gurevich,Dean Rosenzweig,Benjamin Rossman
#t2007
#cLogical Methods in Computer Science
#index1006991
#% 
#!
  
#*Real-Time Model-Checking: Parameters everywhere.
#@Véronique Bruyère,Jean-François Raskin
#t2007
#cLogical Methods in Computer Science
#index1006992
#% 
#!
  
#*Adventures in time and space.
#@Norman Danner,James S. Royer
#t2007
#cLogical Methods in Computer Science
#index1006993
#%783621
#%1341837
#%888252
#%980947
#%1059716
#%888690
#%2939390
#!
  
#*A Characterisation of First-Order Constraint Satisfaction Problems.
#@Benoit Larose,Cynthia Loten,Claude Tardif
#t2007
#cLogical Methods in Computer Science
#index1006994
#% 
#!
  
#*Relating two standard notions of secrecy.
#@Véronique Cortier,Michaël Rusinowitch,Eugen Zalinescu
#t2007
#cLogical Methods in Computer Science
#index1006995
#%545901
#%83732
#%114088
#%123892
#%213719
#%563314
#%970599
#!
  
#*Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.
#@Parosh Aziz Abdulla,Pritha Mahata,Richard Mayr
#t2007
#cLogical Methods in Computer Science
#index1006996
#% 
#!
  
#*Predicate Abstraction via Symbolic Decision Procedures.
#@Shuvendu K. Lahiri,Thomas Ball,Byron Cook
#t2007
#cLogical Methods in Computer Science
#index1006997
#% 
#!
  
#*Expressiveness of Metric modalities for continuous time.
#@Yoram Hirshfeld,Alexander Rabinovich
#t2007
#cLogical Methods in Computer Science
#index1006998
#%949654
#%559520
#%546020
#%114400
#%268248
#%124553
#%881868
#%888245
#%1053124
#%114556
#%221167
#!
  
#*The Complexity of Model Checking Higher-Order Fixpoint Logic.
#@Roland Axelsson,Martin Lange,Rafal Somla
#t2007
#cLogical Methods in Computer Science
#index1006999
#% 
#!
  
#*Bistable Biorders: A Sequential Domain Theory.
#@James Laird
#t2007
#cLogical Methods in Computer Science
#index1007000
#% 
#!
  
#*Algorithms for Omega-Regular Games with Imperfect Information.
#@Jean-François Raskin,Krishnendu Chatterjee,Laurent Doyen,Thomas A. Henzinger
#t2007
#cLogical Methods in Computer Science
#index1007001
#%267163
#%949658
#%949951
#%601059
#%209808
#%3003862
#%268862
#%211928
#!
  
#*A Note on Shortest Developments.
#@Morten Heine Sørensen
#t2007
#cLogical Methods in Computer Science
#index1007002
#% 
#!
  
#*Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure.
#@Joost Engelfriet,Hendrik Jan Hoogeboom
#t2007
#cLogical Methods in Computer Science
#index1007003
#% 
#!
  
#*Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
#@Jörg Hoffmann,Carla P. Gomes,Bart Selman
#t2007
#cLogical Methods in Computer Science
#index1007004
#% 
#!
  
#*A proof of strong normalisation using domain theory.
#@Thierry Coquand,Arnaud Spiwack
#t2007
#cLogical Methods in Computer Science
#index1007005
#% 
#!
  
#*Generic Trace Semantics via Coinduction.
#@Ichiro Hasuo,Bart Jacobs,Ana Sokolova
#t2007
#cLogical Methods in Computer Science
#index1007006
#% 
#!
  
#*Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems.
#@Dimitar P. Guelev
#t2007
#cLogical Methods in Computer Science
#index1007007
#% 
#!
  
#*Inductive Definition and Domain Theoretic Properties of Fully Abstract Models for PCF and PCF+.
#@Vladimir Sazonov
#t2007
#cLogical Methods in Computer Science
#index1007008
#% 
#!
  
#*On the decidability and complexity of Metric Temporal Logic over finite words.
#@Joël Ouaknine,James Worrell
#t2007
#cLogical Methods in Computer Science
#index1007009
#% 
#!
  
#*Interpolant-Based Transition Relation Approximation.
#@Ranjit Jhala,Kenneth L. McMillan
#t2007
#cLogical Methods in Computer Science
#index1007010
#% 
#!
  
#*Transforming structures by set interpretations.
#@Thomas Colcombet,Christof Löding
#t2007
#cLogical Methods in Computer Science
#index1007011
#% 
#!
  
#*Logic Meets Algebra: the Case of Regular Languages.
#@Pascal Tesson,Denis Thérien
#t2007
#cLogical Methods in Computer Science
#index1007012
#% 
#!
  
#*Decisive Markov Chains.
#@Parosh Aziz Abdulla,Noomene Ben Henda,Richard Mayr
#t2007
#cLogical Methods in Computer Science
#index1007013
#% 
#!
  
#*Coinductive Proof Principles for Stochastic Processes.
#@Dexter Kozen
#t2007
#cLogical Methods in Computer Science
#index1007014
#% 
#!
  
#*Automatic Structures: Richness and Limitations.
#@Bakhadyr Khoussainov,André Nies,Sasha Rubin,Frank Stephan
#t2007
#cLogical Methods in Computer Science
#index1007015
#% 
#!
  
#*On tractability and congruence distributivity.
#@Emil W. Kiss,Matthew Valeriote
#t2007
#cLogical Methods in Computer Science
#index1007016
#% 
#!
  
#*A Theory of Explicit Substitutions with Safe and Full Composition
#@Delia Kesner
#t2009
#cLogical Methods in Computer Science
#index1222494
#% 
#!
  
#*Lindström theorems for fragments of first-order logic
#@Johan van Benthem,Balder ten Cate,Jouko A. Väänänen
#t2009
#cLogical Methods in Computer Science
#index1222559
#% 
#!
  
#*Representations of Stream Processors Using Nested Fixed Points
#@Neil Ghani,Peter Hancock,Dirk Pattinson
#t2009
#cLogical Methods in Computer Science
#index1222656
#% 
#!
  
#*Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
#@Damiano Mazza
#t2009
#cLogical Methods in Computer Science
#index1222729
#% 
#!
  
#*A Step-indexed Semantics of Imperative Objects
#@Catalin Hritcu,Jan Schwinghammer
#t2009
#cLogical Methods in Computer Science
#index1222798
#% 
#!
  
#*RPO, Second-order Contexts, and Lambda-calculus
#@Pietro Di Gianantonio,Furio Honsell,Marina Lenisa
#t2009
#cLogical Methods in Computer Science
#index1222877
#% 
#!
  
#*Relational Parametricity for Computational Effects
#@Rasmus Ejlers Møgelberg,Alex Simpson
#t2009
#cLogical Methods in Computer Science
#index1223113
#% 
#!
  
#*Generative Unbinding of Names.
#@Andrew M. Pitts,Mark R. Shinwell
#t2008
#cLogical Methods in Computer Science
#index1226453
#%309925
#%1090983
#%542561
#%3005874
#%888278
#%649
#%17700
#%889210
#%951921
#%507820
#%1094613
#%310126
#%310236
#%1095013
#!
  
#*Canonical Calculi with (n, k)-ary Quantifiers.
#@Arnon Avron,Anna Zamansky
#t2008
#cLogical Methods in Computer Science
#index1226454
#% 
#!
  
#*Characterising Testing Preorders for Finite Probabilistic Processes.
#@Yuxin Deng,Rob J. van Glabbeek,Matthew Hennessy,Carroll Morgan
#t2008
#cLogical Methods in Computer Science
#index1226455
#% 
#!
  
#*Logical Reasoning for Higher-Order Functions with Local State.
#@Nobuko Yoshida,Kohei Honda,Martin Berger
#t2008
#cLogical Methods in Computer Science
#index1226456
#%309885
#%484467
#%484702
#%772823
#%309988
#%548083
#%888263
#%546481
#%546370
#%546523
#%1117182
#%310060
#%2939390
#%889210
#%485149
#!
  
#*Coalgebraic Automata Theory: Basic Results.
#@Clemens Kupke,Yde Venema
#t2008
#cLogical Methods in Computer Science
#index1226457
#% 
#!
  
#*Call-by-Value Termination in the Untyped lambda-Calculus.
#@Neil D. Jones,Nina Bohr
#t2008
#cLogical Methods in Computer Science
#index1226458
#% 
#!
  
#*Enriched µ-Calculi Module Checking.
#@Alessandro Ferrante,Aniello Murano,Mimmo Parente
#t2008
#cLogical Methods in Computer Science
#index1226459
#% 
#!
  
#*Visibly Tree Automata with Memory and Constraints.
#@Hubert Comon-Lundh,Florent Jacquemard,Nicolas Perrin
#t2008
#cLogical Methods in Computer Science
#index1226460
#% 
#!
  
#*Multi-Objective Model Checking of Markov Decision Processes.
#@Kousha Etessami,Marta Z. Kwiatkowska,Moshe Y. Vardi,Mihalis Yannakakis
#t2008
#cLogical Methods in Computer Science
#index1226461
#% 
#!
  
#*The Complexity of Enriched Mu-Calculi.
#@Piero A. Bonatti,Carsten Lutz,Aniello Murano,Moshe Y. Vardi
#t2008
#cLogical Methods in Computer Science
#index1226462
#% 
#!
  
#*A Lower Bound on Web Services Composition.
#@Anca Muscholl,Igor Walukiewicz
#t2008
#cLogical Methods in Computer Science
#index1226463
#%642046
#%949854
#%949951
#%544986
#%1091299
#%545164
#%390152
#!
  
#*Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique.
#@Qiqi Yan
#t2008
#cLogical Methods in Computer Science
#index1226464
#% 
#!
  
#*A Rational Deconstruction of Landin's SECD Machine with the J Operator.
#@Olivier Danvy,Kevin Millikin
#t2008
#cLogical Methods in Computer Science
#index1226465
#% 
#!
  
#*A Distribution Law for CCS and a New Congruence Result for the p-calculus.
#@Daniel Hirschkoff,Damien Pous
#t2008
#cLogical Methods in Computer Science
#index1226466
#%1093507
#!
  
#*Game Refinement Relations and Metrics.
#@Luca de Alfaro,Rupak Majumdar,Vishwanath Raman,Mariëlle Stoelinga
#t2008
#cLogical Methods in Computer Science
#index1226467
#% 
#!
  
#*Model Checking Probabilistic Timed Automata with One or Two Clocks.
#@Marcin Jurdzinski,Jeremy Sproston,François Laroussinie
#t2008
#cLogical Methods in Computer Science
#index1226468
#%267209
#%886899
#%1088805
#%1127381
#%841327
#%219390
#%950037
#%619821
#%879101
#%1092833
#%1092894
#%934819
#%211928
#!
  
#*On the Expressive Power of 2-Stack Visibly Pushdown Automata.
#@Benedikt Bollig
#t2008
#cLogical Methods in Computer Science
#index1226469
#% 
#!
  
#*Interpolation in Local Theory Extensions.
#@Viorica Sofronie-Stokkermans
#t2008
#cLogical Methods in Computer Science
#index1226470
#% 
#!
  
#*Bootstrapping Inductive and Coinductive Types in HasCASL.
#@Lutz Schröder
#t2008
#cLogical Methods in Computer Science
#index1226471
#% 
#!
  
#*On the Expressiveness and Complexity of ATL.
#@François Laroussinie,Nicolas Markey,Ghassan Oreiby
#t2008
#cLogical Methods in Computer Science
#index1226472
#%484414
#%111710
#%949658
#%114072
#%79172
#%954611
#%486435
#%700
#%1091564
#%646830
#%211625
#%553006
#!
  
#*Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.
#@Matthew Hague,C.-H. Luke Ong
#t2008
#cLogical Methods in Computer Science
#index1226473
#%113987
#%949951
#%621923
#%493313
#%79838
#%62076
#%484932
#%213773
#%546802
#%722
#!
  
#*Lambda-RBAC: Programming with Role-Based Access Control.
#@Radha Jagadeesan,Alan Jeffrey,Corin Pitcher,James Riely
#t2008
#cLogical Methods in Computer Science
#index1226474
#% 
#!
  
#*Algebraic Pattern Matching in Join Calculus.
#@Qin Ma,Luc Maranget
#t2008
#cLogical Methods in Computer Science
#index1226475
#% 
#!
  
#*Rational Streams Coalgebraically.
#@Jan J. M. M. Rutten
#t2008
#cLogical Methods in Computer Science
#index1226476
#% 
#!
  
#*Independence and Concurrent Separation Logic.
#@Jonathan Hayman,Glynn Winskel
#t2008
#cLogical Methods in Computer Science
#index1226477
#% 
#!
  
#*Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
#@Paolo Baldan,Andrea Corradini,Hartmut Ehrig,Reiko Heckel,Barbara König
#t2008
#cLogical Methods in Computer Science
#index1226478
#%45073
#%228631
#%45385
#%114567
#%3498
#%1095101
#!
  
#*Separability in the Ambient Logic.
#@Étienne Lozes,Daniel Hirschkoff,Davide Sangiorgi
#t2008
#cLogical Methods in Computer Science
#index1226479
#% 
#!
  
#*Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning.
#@Samuel R. Buss,Jan Hoffmann,Jan Johannsen
#t2008
#cLogical Methods in Computer Science
#index1226480
#% 
#!
  
#*Normalisation Control in Deep Inference via Atomic Flows.
#@Alessio Guglielmi,Tom Gundersen
#t2008
#cLogical Methods in Computer Science
#index1226481
#% 
#!
  
#*Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems.
#@Franck van Breugel,Babita Sharma,James Worrell
#t2008
#cLogical Methods in Computer Science
#index1226482
#%971427
#%949736
#%114129
#%1089686
#%1089687
#%181365
#%60484
#%867128
#%484642
#%1090525
#%888651
#%1093524
#%627565
#%1095330
#!
  
#*Semi-Continuous Sized Types and Termination.
#@Andreas Abel
#t2008
#cLogical Methods in Computer Science
#index1226483
#% 
#!
  
#*Are there Hilbert-style Pure Type Systems?
#@Martin W. Bunder,Wil Dekkers
#t2008
#cLogical Methods in Computer Science
#index1226484
#% 
#!
  
#*Light Logics and the Call-by-Value Lambda Calculus.
#@Paolo Coppola,Ugo Dal Lago,Simona Ronchi Della Rocca
#t2008
#cLogical Methods in Computer Science
#index1226485
#% 
#!
  
#*On the Strength of Proof-irrelevant Type Theories.
#@Benjamin Werner
#t2008
#cLogical Methods in Computer Science
#index1226486
#% 
#!
  
#*Relational Parametricity and Separation Logic.
#@Lars Birkedal,Hongseok Yang
#t2008
#cLogical Methods in Computer Science
#index1226487
#%485004
#%1014691
#%545935
#%484467
#%951314
#%546589
#%546618
#%628879
#%485149
#%1094613
#!
  
#*Model Checking One-Clock Priced Timed Automata.
#@Patricia Bouyer,Kim Guldstrand Larsen,Nicolas Markey
#t2008
#cLogical Methods in Computer Science
#index1226488
#%1088640
#%879128
#%114408
#%1092894
#!
  
#*Recursive Concurrent Stochastic Games.
#@Kousha Etessami,Mihalis Yannakakis
#t2008
#cLogical Methods in Computer Science
#index1226489
#% 
#!
  
#*The Wadge Hierarchy of Deterministic Tree Languages.
#@Filip Murlak
#t2008
#cLogical Methods in Computer Science
#index1226490
#% 
#!
  
#*First-Order and Temporal Logics for Nested Words.
#@Rajeev Alur,Marcelo Arenas,Pablo Barceló,Kousha Etessami,Neil Immerman,Leonid Libkin
#t2008
#cLogical Methods in Computer Science
#index1226491
#% 
#!
  
#*Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.
#@Lijun Zhang,Holger Hermanns,Friedrich Eisenbrand,David N. Jansen
#t2008
#cLogical Methods in Computer Science
#index1226492
#%3005546
#%79235
#%971427
#%1127381
#%929834
#%114027
#%267655
#%1123453
#%1059273
#%954751
#%624198
#%950463
#%210909
#%114345
#%3005514
#!
  
#*Exhaustible Sets in Higher-type Computation.
#@Martín Hötzel Escardó
#t2008
#cLogical Methods in Computer Science
#index1226493
#% 
#!
  
#*Compactly Accessible Categories and Quantum Key Distribution.
#@Chris Heunen
#t2008
#cLogical Methods in Computer Science
#index1226494
#% 
#!
  
#*Normalization of IZF with Replacement.
#@Wojciech Moczydlowski
#t2008
#cLogical Methods in Computer Science
#index1226495
#% 
#!
  
#*Proving Noninterference by a Fully Complete Translation to the Simply Typed Lambda-Calculus.
#@Naokata Shikuma,Atsushi Igarashi
#t2008
#cLogical Methods in Computer Science
#index1226496
#% 
#!
  
#*An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet.
#@Alexis Bès
#t2008
#cLogical Methods in Computer Science
#index1226497
#% 
#!
  
#*Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics.
#@Robert L. Constable,Wojciech Moczydlowski
#t2008
#cLogical Methods in Computer Science
#index1226498
#% 
#!
  
#*Coinductive Formal Reasoning in Exact Real Arithmetic.
#@Milad Niqui
#t2008
#cLogical Methods in Computer Science
#index1226499
#% 
#!
  
#*Consistency and Completeness of Rewriting in the Calculus of Constructions.
#@Daria Walukiewicz-Chrzaszcz,Jacek Chrzaszcz
#t2008
#cLogical Methods in Computer Science
#index1226500
#% 
#!
  
#*Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
#@Philipp Weis,Neil Immerman
#t2009
#cLogical Methods in Computer Science
#index1268193
#% 
#!
  
#*A Type System For Call-By-Name Exceptions
#@Sylvain Lebresne
#t2009
#cLogical Methods in Computer Science
#index1268318
#% 
#!
  
#*Decidability of higher-order matching
#@Colin Stirling
#t2009
#cLogical Methods in Computer Science
#index1268438
#% 
#!
  
#*Full abstraction for nominal general references
#@Nikos Tzevelekos
#t2009
#cLogical Methods in Computer Science
#index1268476
#% 
#!
  
#*Applications of Metric Coinduction
#@Dexter Kozen,Nicholas Ruozzi
#t2009
#cLogical Methods in Computer Science
#index1268803
#% 
#!
  
#*A rich hierarchy of functionals of finite types
#@Dag Normann
#t2009
#cLogical Methods in Computer Science
#index1269030
#% 
#!
  
#*The Complexity of Infinite Computations In Models of Set Theory
#@Olivier Finkel
#t2009
#cLogical Methods in Computer Science
#index1269498
#% 
#!
  
#*Guarded Second-Order Logic, Spanning Trees, and Network Flows
#@Achim Blumensath
#t2009
#cLogical Methods in Computer Science
#index1269640
#% 
#!
  
#*Infinitary Combinatory Reduction Systems: Confluence
#@Jeroen Ketema,Jakob Grue Simonsen
#t2009
#cLogical Methods in Computer Science
#index1269693
#% 
#!
  
#*A Graph Model for Imperative Computation
#@Guy McCusker
#t2009
#cLogical Methods in Computer Science
#index1269768
#% 
#!
  
#*Bifinite Chu Spaces
#@Manfred Droste,Guo-Qiang Zhang
#t2009
#cLogical Methods in Computer Science
#index1334444
#% 
#!
  
#*Computation Tree Logic with Deadlock Detection
#@Rob J. van Glabbeek,Bas Luttik,Nikola Trcka
#t2009
#cLogical Methods in Computer Science
#index1334851
#% 
#!
  
#*O-Minimal Hybrid Reachability Games
#@Patricia Bouyer,Thomas Brihaye,Fabrice Chevalier
#t2009
#cLogical Methods in Computer Science
#index1334559
#% 
#!
  
#*Orthomodular lattices, Foulis Semigroups and Dagger Kernel Categories
#@Bart Jacobs
#t2009
#cLogical Methods in Computer Science
#index1334737
#% 
#!
  
#*Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
#@Jeroen Ketema,Jakob Grue Simonsen
#t2010
#cLogical Methods in Computer Science
#index1335043
#% 
#!
  
#*Weighted Logics for Nested Words and Algebraic Formal Power Series
#@Christian Mathissen
#t2010
#cLogical Methods in Computer Science
#index1335343
#% 
#!
  
#*On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
#@Bernard Boigelot,Julien Brusten,Véronique Bruyère
#t2010
#cLogical Methods in Computer Science
#index1335394
#% 
#!
  
#*Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
#@José L. Balcázar
#t2010
#cLogical Methods in Computer Science
#index1336201
#% 
#!
  
#*Lazy Evaluation and Delimited Control
#@Ronald Garcia,Andrew Lumsdaine,Amr Sabry
#t2010
#cLogical Methods in Computer Science
#index2853475
#%980760
#%1117278
#%484215
#%981220
#%546169
#%1090983
#%1006898
#%546297
#%538371
#%310013
#%310014
#%1006900
#%546398
#%981008
#%1006849
#%214099
#%981136
#%1006908
#%1006921
#%310160
#%934351
#%543193
#!
  
#*Spatial logics with connectedness predicates
#@Roman Kontchakov,Ian Pratt-Hartmann,Frank Wolter,Michael Zakharyaschev
#t2010
#cLogical Methods in Computer Science
#index2853500
#% 
#!
  
#*A Proof Theoretic Analysis of Intruder Theories
#@Alwen Tiu,Rajeev Goré,Jeremy E. Dawson
#t2010
#cLogical Methods in Computer Science
#index2854725
#% 
#!
  
#*Size-Change Termination, Monotonicity Constraints and Ranking Functions
#@Amir M. Ben-Amram
#t2010
#cLogical Methods in Computer Science
#index2854360
#%1124023
#%544760
#%546076
#%1124009
#%546406
#!
  
#*Classical BI: Its Semantics and Proof Theory
#@James Brotherston,Cristiano Calcagno
#t2010
#cLogical Methods in Computer Science
#index2854569
#% 
#!
  
#*Automated Verification of Practical Garbage Collectors
#@Chris Hawblitzel,Erez Petrank
#t2010
#cLogical Methods in Computer Science
#index2854045
#%521756
#%1123361
#%545935
#%542949
#%770672
#%546119
#%542520
#%79465
#%629372
#%542675
#%1123719
#%774141
#%543026
#%542751
#%546550
#%546564
#%542966
#%543044
#%546835
#!
  
#*Automatic Modular Abstractions for Template Numerical Constraints
#@David Monniaux
#t2010
#cLogical Methods in Computer Science
#index2854749
#% 
#!
  
#*Analytic Tableaux for Simple Type Theory and its First-Order Fragment
#@Chad E. Brown,Gert Smolka
#t2010
#cLogical Methods in Computer Science
#index2853835
#% 
#!
  
#*Positive Supercompilation for a Higher-Order Call-By-Value Language
#@Peter A. Jonsson,Johan Nordlander
#t2010
#cLogical Methods in Computer Science
#index2854796
#%1024951
#%949922
#%993729
#%1025028
#%214170
#%543226
#%3003225
#%2256
#%213972
#%546936
#%214056
#%1094394
#%546722
#%1057191
#%189035
#%310138
#%538257
#%214213
#%81500
#%1123949
#%189078
#!
  
#*Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
#@Luis Barguñó,Guillem Godoy,Eduard Huntingford,Ashish Tiwari
#t2010
#cLogical Methods in Computer Science
#index2854993
#% 
#!
  
#*Transforming Outermost into Context-Sensitive Rewriting
#@Jörg Endrullis,Dimitri Hendriks
#t2010
#cLogical Methods in Computer Science
#index2854846
#% 
#!
  
#*Modularity of Convergence and Strong Convergence in Infinitary Rewriting
#@Stefan Kahrs
#t2010
#cLogical Methods in Computer Science
#index2855273
#% 
#!
  
#*Unification in the Description Logic EL
#@Franz Baader,Barbara Morawska
#t2010
#cLogical Methods in Computer Science
#index2855201
#% 
#!
  
#*Local Termination: theory and practice
#@Jörg Endrullis,Roel C. de Vrijer,Johannes Waldmann
#t2010
#cLogical Methods in Computer Science
#index2855493
#% 
#!
  
#*Domain Representable Spaces Defined by Strictly Positive Induction
#@Petter Kristian Køber
#t2010
#cLogical Methods in Computer Science
#index2855551
#% 
#!
  
#*Acyclic Solos and Differential Interaction Nets
#@Thomas Ehrhard,Olivier Laurent
#t2010
#cLogical Methods in Computer Science
#index2855696
#% 
#!
  
#*Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
#@Federico Aschieri,Stefano Berardi
#t2010
#cLogical Methods in Computer Science
#index2855876
#% 
#!
  
#*Initial Algebra Semantics for Cyclic Sharing Tree Structures
#@Makoto Hamana
#t2010
#cLogical Methods in Computer Science
#index2856053
#% 
#!
  
#*Expressiveness and Closure Properties for Quantitative Languages
#@Krishnendu Chatterjee,Laurent Doyen,Thomas A. Henzinger
#t2010
#cLogical Methods in Computer Science
#index2856031
#% 
#!
  
#*Non-Deterministic Kleene Coalgebras
#@Alexandra Silva,Marcello M. Bonsangue,Jan J. M. M. Rutten
#t2010
#cLogical Methods in Computer Science
#index2856007
#% 
#!
  
#*Propositional Dynamic Logic for Message-Passing Systems
#@Benedikt Bollig,Dietrich Kuske,Ingmar Meinecke
#t2010
#cLogical Methods in Computer Science
#index2856085
#% 
#!
  
#*Well-definedness of Streams by Transformation and Termination
#@Hans Zantema
#t2010
#cLogical Methods in Computer Science
#index2856446
#% 
#!
  
#*Sampled Semantics of Timed Automata
#@Parosh Aziz Abdulla,Pavel Krcál,Wang Yi
#t2010
#cLogical Methods in Computer Science
#index2855929
#% 
#!
  
#*Weak omega-categories from intensional type theory
#@Peter LeFanu Lumsdaine
#t2010
#cLogical Methods in Computer Science
#index3066568
#% 
#!
  
#*On the Monadic Second-Order Transduction Hierarchy
#@Achim Blumensath,Bruno Courcelle
#t2010
#cLogical Methods in Computer Science
#index3066567
#% 
#!
  
#*Co-c.e. spheres and cells in computable metric spaces
#@Zvonko Iljazovic
#t2011
#cLogical Methods in Computer Science
#index3152234
#% 
#!
  
#*Banach Spaces as Data Types
#@Dag Normann
#t2011
#cLogical Methods in Computer Science
#index3151424
#% 
#!
  
#*An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
#@Oliver Friedmann
#t2011
#cLogical Methods in Computer Science
#index3153120
#% 
#!
  
#*Turing machines on represented sets, a model of computation for Analysis
#@Nazanin Tavana,Klaus Weihrauch
#t2011
#cLogical Methods in Computer Science
#index3153259
#% 
#!
  
#*Constraint solving in non-permutative nominal abstract syntax
#@Matthew R. Lakin
#t2011
#cLogical Methods in Computer Science
#index3153157
#% 
#!
  
#*Computational Models of Certain Hyperspaces of Quasi-metric Spaces
#@Vassilios Gregoriades
#t2011
#cLogical Methods in Computer Science
#index3152302
#% 
#!
  
#*Nested Hoare Triples and Frame Rules for Higher-order Store
#@Jan Schwinghammer,Lars Birkedal,Bernhard Reus,Hongseok Yang
#t2011
#cLogical Methods in Computer Science
#index3152876
#% 
#!
  
#*Algorithmic Randomness and Capacity of Closed Sets
#@Douglas Cenzer,Paul Brodhead,Ferit Toska,Sebastian Wyman
#t2011
#cLogical Methods in Computer Science
#index3152830
#% 
#!
  
#*Conway games, algebraically and coalgebraically
#@Furio Honsell,Marina Lenisa
#t2011
#cLogical Methods in Computer Science
#index3152605
#% 
#!
  
#*Power of Randomization in Automata on Infinite Strings
#@Rohit Chadha,A. Prasad Sistla,Mahesh Viswanathan
#t2011
#cLogical Methods in Computer Science
#index3152611
#% 
#!
  
#*Permission-Based Separation Logic for Message-Passing Concurrency
#@Adrian Francalanza,Julian Rathke,Vladimiro Sassone
#t2011
#cLogical Methods in Computer Science
#index3153103
#% 
#!
  
#*Composition with Target Constraints
#@Marcelo Arenas,Ronald Fagin,Alan Nash
#t2011
#cLogical Methods in Computer Science
#index3152965
#% 
#!
  
#*On the mathematical synthesis of equational logics
#@Marcelo P. Fiore,Chung-Kil Hur
#t2011
#cLogical Methods in Computer Science
#index3153025
#% 
#!
  
#*Logical Concurrency Control from Sequential Proofs
#@Jyotirmoy V. Deshmukh,G. Ramalingam,Venkatesh Prasad Ranganath,Kapil Vaswani
#t2011
#cLogical Methods in Computer Science
#index3153960
#%615548
#%542965
#%361763
#%546969
#%546906
#%601447
#%546304
#%546303
#%1123602
#%546512
#%1095600
#%774869
#%543020
#%546804
#%542967
#%625474
#!
  
#*Computational Models of Certain Hyperspaces of Quasi-metric Spaces
#@Mahdi Aliakbari,Massoud Pourmahdian
#t2011
#cLogical Methods in Computer Science
#index3154101
#% 
#!
  
#*The Complexity of Nash Equilibria in Stochastic Multiplayer Games
#@Michael Ummels,Dominik Wojtczak
#t2011
#cLogical Methods in Computer Science
#index3153796
#% 
#!
  
#*Answering Non-Monotonic Queries in Relational Data Exchange
#@André Hernich
#t2011
#cLogical Methods in Computer Science
#index3154172
#% 
#!
  
#*Attacker Control and Impact for Confidentiality and Integrity
#@Aslan Askarov,Andrew C. Myers
#t2011
#cLogical Methods in Computer Science
#index3154476
#% 
#!
  
#*Randomisation and Derandomisation in Descriptive Complexity Theory
#@Kord Eickmeyer,Martin Grohe
#t2011
#cLogical Methods in Computer Science
#index3154540
#%972704
#%209779
#%888324
#%623215
#%211462
#%3006880
#%1221772
#%887802
#%1060547
#%267765
#!
  
#*Formalization of Abstract State Transition Systems for SAT
#@Filip Maric,Predrag Janicic
#t2011
#cLogical Methods in Computer Science
#index3155188
#% 
#!
  
#*Kripke Semantics for Martin-Löf's Extensional Type Theory
#@Steven Awodey,Florian Rabe
#t2011
#cLogical Methods in Computer Science
#index3154962
#% 
#!
  
#*Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
#@Mohamed Faouzi Atig,Ahmed Bouajjani,Shaz Qadeer
#t2011
#cLogical Methods in Computer Science
#index3264311
#% 
#!
  
#*A note on the expressive power of linear orders
#@Nicole Schweikardt,Thomas Schwentick
#t2011
#cLogical Methods in Computer Science
#index3265082
#% 
#!
  
#*Proof-irrelevant model of CC with predicative induction and judgmental equality
#@Gyesik Lee,Benjamin Werner
#t2011
#cLogical Methods in Computer Science
#index3264819
#% 
#!
  
#*Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog
#@Sebastian Rudolph,Markus Krötzsch,Pascal Hitzler
#t2012
#cLogical Methods in Computer Science
#index3382691
#% 
#!
  
#*A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
#@Andrea Asperti,Wilmer Ricciotti,Claudio Sacerdoti Coen,Enrico Tassi
#t2012
#cLogical Methods in Computer Science
#index3382682
#% 
#!
  
#*Width and size of regular resolution proofs
#@Alasdair Urquhart
#t2012
#cLogical Methods in Computer Science
#index3383586
#% 
#!
  
#*Barriers in Concurrent Separation Logic: Now With Tool Support!
#@Aquinas Hobor,Cristian Gherghina
#t2012
#cLogical Methods in Computer Science
#index3383950
#% 
#!
  
#*Tree-width for first order formulae
#@Isolde Adler,Mark Weyer
#t2012
#cLogical Methods in Computer Science
#index3383389
#% 
#!
  
#*Derivation Lengths Classification of Gödel's T Extending Howard's Assignment
#@Gunnar Wilken,Andreas Weiermann
#t2012
#cLogical Methods in Computer Science
#index3383815
#% 
#!
  
#*On Global Types and Multi-Party Session
#@Giuseppe Castagna,Mariangiola Dezani-Ciancaglini,Luca Padovani
#t2012
#cLogical Methods in Computer Science
#index3383554
#% 
#!
  
#*Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability
#@Matthias Baaz,Agata Ciabattoni,Christian G. Fermüller
#t2012
#cLogical Methods in Computer Science
#index3385094
#% 
#!
  
#*On Irrelevance and Algorithmic Equality in Predicative Type Theory
#@Andreas Abel,Gabriel Scherer
#t2012
#cLogical Methods in Computer Science
#index3384178
#% 
#!
  
#*Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
#@Beniamino Accattoli,Delia Kesner
#t2012
#cLogical Methods in Computer Science
#index3384756
#% 
#!
  
#*Static Analysis of Run-Time Errors in Embedded Real-Time Parallel C Programs
#@Antoine Miné
#t2012
#cLogical Methods in Computer Science
#index3384390
#% 
#!
  
#*Quantifier-Free Interpolation of a Theory of Arrays
#@Roberto Bruttomesso,Silvio Ghilardi,Silvio Ranise
#t2012
#cLogical Methods in Computer Science
#index3384928
#% 
#!
  
#*The rapid points of a complex oscillation
#@Paul Potgieter
#t2012
#cLogical Methods in Computer Science
#index3385341
#% 
#!
  
#*On the Parameterized Intractability of Monadic Second-Order Logic
#@Stephan Kreutzer
#t2012
#cLogical Methods in Computer Science
#index3385299
#% 
#!
  
#*A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
#@Takahito Aoto,Yoshihito Toyama
#t2012
#cLogical Methods in Computer Science
#index3385774
#% 
#!
  
#*Modes of Convergence for Term Graph Rewriting
#@Patrick Bahr
#t2012
#cLogical Methods in Computer Science
#index3385472
#% 
#!
  
#*QRB-Domains and the Probabilistic Powerdomain
#@Jean Goubault-Larrecq
#t2012
#cLogical Methods in Computer Science
#index3385381
#% 
#!
  
#*Secure the Clones
#@Thomas P. Jensen,Florent Kirchner,David Pichardie
#t2012
#cLogical Methods in Computer Science
#index3385210
#% 
#!
  
#*Typing Copyless Message Passing
#@Viviana Bono,Luca Padovani
#t2012
#cLogical Methods in Computer Science
#index3385493
#%114745
#%1254604
#%628104
#%691501
#%740854
#%2864108
#%114297
#%188898
#%124721
#%485149
#%1251051
#%1213788
#%1302738
#%628154
#!
  
#*Alternating register automata on finite words and trees
#@Diego Figueira
#t2012
#cLogical Methods in Computer Science
#index3385731
#% 
#!
  
#*On the equivalence of game and denotational semantics for the probabilistic mu-calculus
#@Matteo Mio
#t2012
#cLogical Methods in Computer Science
#index3386374
#% 
#!
  
#*Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation.
#@Tobias Gärtner,Martin Ziegler
#t2011
#cLogical Methods in Computer Science
#index3470632
#% 
#!
  
#*On logical hierarchies within FO-definable languages
#@Manfred Kufleitner,Pascal Weil
#t2012
#cLogical Methods in Computer Science
#index3470613
#% 
#!
  
#*Generalized Craig Interpolation
#@Tino Teige,Martin Fränzle
#t2012
#cLogical Methods in Computer Science
#index3470962
#% 
#!
  
#*Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems
#@Diana Fischer,Lukasz Kaiser
#t2012
#cLogical Methods in Computer Science
#index3470867
#% 
#!
  
#*Point-Separable Classes of Simple Computable Planar Curves
#@Xizhong Zheng,Robert Rettinger
#t2012
#cLogical Methods in Computer Science
#index3471401
#% 
#!
  
#*Generic Fibrational Induction
#@Neil Ghani,Patricia Johann,Clément Fumex
#t2012
#cLogical Methods in Computer Science
#index3470659
#% 
#!
  
#*Weak Alternating Timed Automata
#@Pawel Parys,Igor Walukiewicz
#t2012
#cLogical Methods in Computer Science
#index3472019
#% 
#!
  
#*First steps in synthetic guarded domain theory: step-indexing in the topos of trees
#@Lars Birkedal,Rasmus Ejlers Møgelberg,Jan Schwinghammer,Kristian Støvring
#t2012
#cLogical Methods in Computer Science
#index3471604
#% 
#!
  
#*Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
#@Antonio Bucciarelli,Alberto Carraro,Thomas Ehrhard,Giulio Manzonetto
#t2012
#cLogical Methods in Computer Science
#index3472125
#% 
#!
  
#*Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
#@Jan Krajícek
#t2012
#cLogical Methods in Computer Science
#index3472225
#% 
#!
  
#*Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference
#@Wonchan Lee,Yungbum Jung,Bow-Yaw Wang,Kwangkuen Yi
#t2012
#cLogical Methods in Computer Science
#index3472432
#%886971
#%625096
#%79964
#%861733
#%1325266
#%546303
#%79908
#%2897441
#%625332
#%625460
#%1212914
#!
  
#*Linear-use CPS translations in the Enriched Effect Calculus
#@Jeff Egger,Rasmus Ejlers Møgelberg,Alex Simpson
#t2012
#cLogical Methods in Computer Science
#index3472185
#% 
#!
  
#*Reachability Analysis of Communicating Pushdown Systems
#@Alexander Heußner,Jérôme Leroux,Anca Muscholl,Grégoire Sutre
#t2012
#cLogical Methods in Computer Science
#index3472159
#% 
#!
  
#*Applying CEGAR to the Petri Net State Equation
#@Harro Wimmel,Karsten Wolf
#t2012
#cLogical Methods in Computer Science
#index3471519
#%1076669
#%79338
#%622553
#%879100
#%1092870
#%1252084
#%45552
#%45687
#!
  
#*Strongly Complete Logics for Coalgebras
#@Alexander Kurz,Jirí Rosický
#t2012
#cLogical Methods in Computer Science
#index3471533
#% 
#!
  
#*Degrees of Lookahead in Regular Infinite Games
#@Michael Holtmann,Lukasz Kaiser,Wolfgang Thomas
#t2012
#cLogical Methods in Computer Science
#index3471867
#% 
#!
  
#*Transfer Function Synthesis without Quantifier Elimination
#@Jörg Brauer,Andy King
#t2012
#cLogical Methods in Computer Science
#index3472577
#%1337505
#%2871349
#%2967662
#%2812576
#%819995
#%546057
#%546076
#%542981
#%820199
#%546986
#%1124027
#%1014081
#%994488
#%53836
#%2869777
#!
  
#*Completeness for the coalgebraic cover modality
#@Clemens Kupke,Alexander Kurz,Yde Venema
#t2012
#cLogical Methods in Computer Science
#index3473204
#% 
#!
  
#*Isomorphisms of types in the presence of higher-order references (extended version)
#@Pierre Clairambault
#t2012
#cLogical Methods in Computer Science
#index3473147
#% 
#!
  
#*Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
#@Naoki Nishida,Masahiko Sakai,Toshiki Sakabe
#t2012
#cLogical Methods in Computer Science
#index3472758
#% 
#!
  
#*Two for the Price of One: Lifting Separation Logic Assertions
#@Jacob Thamsborg,Lars Birkedal,Hongseok Yang
#t2012
#cLogical Methods in Computer Science
#index3472646
#% 
#!
  
#*Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation
#@Sylvain Conchon,Evelyne Contejean,Mohamed Iguernelala
#t2012
#cLogical Methods in Computer Science
#index3473033
#% 
#!
  
#*Parameterised Multiparty Session Types
#@Pierre-Malo Deniélou,Nobuko Yoshida,Andi Bejleri,Raymond Hu
#t2012
#cLogical Methods in Computer Science
#index3472934
#% 
#!
  
#*A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time
#@Ben C. Moszkowski
#t2012
#cLogical Methods in Computer Science
#index3474437
#% 
#!
  
#*Forward Analysis for WSTS, Part II: Complete WSTS
#@Alain Finkel,Jean Goubault-Larrecq
#t2012
#cLogical Methods in Computer Science
#index3474304
#% 
#!
  
#*Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
#@Thomas Martin Gawlitza,David Monniaux
#t2012
#cLogical Methods in Computer Science
#index3474306
#% 
#!
  
#*Wreath Products of Forest Algebras, with Applications to Tree Logics
#@Mikolaj Bojanczyk,Howard Straubing,Igor Walukiewicz
#t2012
#cLogical Methods in Computer Science
#index3474400
#% 
#!
  
#*General Bindings and Alpha-Equivalence in Nominal Isabelle
#@Christian Urban,Cezary Kaliszyk
#t2012
#cLogical Methods in Computer Science
#index3474300
#%1256613
#%309925
#%310241
#%546921
#%954877
#%889210
#%2864110
#%546878
#%485350
#%563753
#!
  
#*Model-Checking of Ordered Multi-Pushdown Automata
#@Mohamed Faouzi Atig
#t2012
#cLogical Methods in Computer Science
#index3473861
#% 
#!
  
#*Piecewise testable tree languages
#@Mikolaj Bojanczyk,Luc Segoufin,Howard Straubing
#t2012
#cLogical Methods in Computer Science
#index3473939
#% 
#!
  
#*Finite dimensional Hilbert spaces are complete for dagger compact closed categories.
#@Peter Selinger
#t2012
#cLogical Methods in Computer Science
#index3473561
#% 
#!
  
#*On Constructor Rewrite Systems and the Lambda Calculus
#@Ugo Dal Lago,Simone Martini
#t2012
#cLogical Methods in Computer Science
#index3474524
#% 
#!
  
#*Software Model Checking with Explicit Scheduler and Symbolic Threads
#@Alessandro Cimatti,Iman Narasamdya,Marco Roveri
#t2012
#cLogical Methods in Computer Science
#index3473756
#% 
#!
  
#*The General Notion of a Dot-Operator.
#@Bernd Borchert,Riccardo Silvestri
#t1997
#cIEEE Conference on Computational Complexity
#index104269
#%104854
#%104828
#%623166
#%741522
#%929695
#%930147
#%951617
#%951719
#%972750
#%1059617
#%1060548
#%1089634
#%1091868
#%1095035
#%1342077
#!
  
#*On Ranomization in Online Computation.
#@Allan Borodin,Ran El-Yaniv
#t1997
#cIEEE Conference on Computational Complexity
#index104270
#% 
#!
  
#*Quantum Certificate Complexity.
#@Scott Aaronson
#t2003
#cIEEE Conference on Computational Complexity
#index104273
#% 
#!
  
#*On the Complexity of Some Problems on Groups Input as Multiplication Tables.
#@David A. Mix Barrington,Peter Kadau,Klaus-Jörn Lange,Pierre McKenzie
#t2000
#cIEEE Conference on Computational Complexity
#index104274
#% 
#!
  
#*Limitations of Quantum Advice and One-Way Communication.
#@Scott Aaronson
#t2004
#cIEEE Conference on Computational Complexity
#index104275
#% 
#!
  
#*On Monotone Planar Circuits.
#@David A. Mix Barrington,Chi-Jen Lu,Peter Bro Miltersen,Sven Skyum
#t1999
#cIEEE Conference on Computational Complexity
#index104276
#% 
#!
  
#*QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols.
#@Scott Aaronson
#t2006
#cIEEE Conference on Computational Complexity
#index104277
#% 
#!
  
#*Oracles Are Subtle But Not Malicious.
#@Scott Aaronson
#t2006
#cIEEE Conference on Computational Complexity
#index104279
#% 
#!
  
#*Polynomials That Sign Represent Parity and Descartes Rule of Signs.
#@Saugata Basu,Nayantara Bhatnagar,Parikshit Gopalan,Richard J. Lipton
#t2004
#cIEEE Conference on Computational Complexity
#index104280
#% 
#!
  
#*The Complexity of Approximating the Entropy.
#@Tugkan Batu,Sanjoy Dasgupta,Ravi Kumar,Ronitt Rubinfeld
#t2002
#cIEEE Conference on Computational Complexity
#index104282
#% 
#!
  
#*Memoization and DPLL: Formula Caching Proof Systems.
#@Paul Beame,Russell Impagliazzo,Toniann Pitassi,Nathan Segerlind
#t2003
#cIEEE Conference on Computational Complexity
#index104284
#% 
#!
  
#*3-MANIFOLD KNOT GENUS is NP-complete.
#@Ian Agol,Joel Hass,William P. Thurston
#t2002
#cIEEE Conference on Computational Complexity
#index104285
#% 
#!
  
#*Resolution Complexity of Independent Sets in Random Graphs.
#@Paul Beame,Russell Impagliazzo,Ashish Sabharwal
#t2001
#cIEEE Conference on Computational Complexity
#index104286
#% 
#!
  
#*Towards Uniform AC - Isomorphisms.
#@Manindra Agrawal
#t2001
#cIEEE Conference on Computational Complexity
#index104287
#% 
#!
  
#*A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.
#@Paul Beame,Toniann Pitassi,Nathan Segerlind,Avi Wigderson
#t2005
#cIEEE Conference on Computational Complexity
#index104288
#% 
#!
  
#*Pseudo-Random Generators and Structure of Complete Degrees.
#@Manindra Agrawal
#t2002
#cIEEE Conference on Computational Complexity
#index104289
#% 
#!
  
#*Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems.
#@Paul Beame,Erik Vee
#t2002
#cIEEE Conference on Computational Complexity
#index104290
#% 
#!
  
#*On Derandomizing Tests for Certain Polynomial Identities.
#@Manindra Agrawal
#t2003
#cIEEE Conference on Computational Complexity
#index104291
#% 
#!
  
#*FO[<]-Uniformity.
#@Christoph Behle,Klaus-Jörn Lange
#t2006
#cIEEE Conference on Computational Complexity
#index104296
#% 
#!
  
#*An Isomorphism Theorem for Circuit Complexity.
#@Manindra Agrawal,Eric Allender
#t1996
#cIEEE Conference on Computational Complexity
#index104301
#% 
#!
  
#*A Note on Decision versus Search for Graph Automorphism.
#@Manindra Agrawal,Vikraman Arvind
#t1996
#cIEEE Conference on Computational Complexity
#index104303
#% 
#!
  
#*Gaps in Bounded Query Hierarchies.
#@Richard Beigel
#t1999
#cIEEE Conference on Computational Complexity
#index104304
#% 
#!
  
#*On TC, AC, and Arithmetic Circuits.
#@Manindra Agrawal,Eric Allender,Samir Datta
#t1997
#cIEEE Conference on Computational Complexity
#index104305
#% 
#!
  
#*Are Cook and Karp Ever the Same?
#@Richard Beigel,Lance Fortnow
#t2003
#cIEEE Conference on Computational Complexity
#index104306
#% 
#!
  
#*Circuits Over PP and PL.
#@Richard Beigel,Bin Fu
#t1997
#cIEEE Conference on Computational Complexity
#index104308
#%210806
#%268366
#%621309
#%887868
#%971485
#%973123
#%1060547
#%3001564
#!
  
#*Solving Intractable Problems with DNA Computing.
#@Richard Beigel,Bin Fu
#t1998
#cIEEE Conference on Computational Complexity
#index104310
#% 
#!
  
#*The Satisfiability Problem for Probabilistic Ordered Branching Programs.
#@Manindra Agrawal,Thomas Thierauf
#t1998
#cIEEE Conference on Computational Complexity
#index104311
#% 
#!
  
#*Sampling Short Lattice Vectors and the Closest Lattice Vector Problem.
#@Miklós Ajtai,Ravi Kumar,D. Sivakumar
#t2002
#cIEEE Conference on Computational Complexity
#index104313
#% 
#!
  
#*A Combinatorial Characterization of ResolutionWidth.
#@Albert Atserias,Víctor Dalmau
#t2003
#cIEEE Conference on Computational Complexity
#index104314
#% 
#!
  
#*Some Recent Progress on the Complexity of Lattice Problems.
#@Jin-yi Cai
#t1999
#cIEEE Conference on Computational Complexity
#index104315
#% 
#!
  
#*Toward a Model for Backtracking and Dynamic Programming.
#@Michael Alekhnovich,Allan Borodin,Joshua Buresh-Oppenheim,Russell Impagliazzo,Avner Magen,Toniann Pitassi
#t2005
#cIEEE Conference on Computational Complexity
#index104316
#% 
#!
  
#*Monotone Simulations of Nonmonotone Proofs.
#@Albert Atserias,Nicola Galesi,Pavel Pudlák
#t2001
#cIEEE Conference on Computational Complexity
#index104323
#% 
#!
  
#*A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure.
#@Jack Jie Dai
#t2001
#cIEEE Conference on Computational Complexity
#index104324
#% 
#!
  
#*Grid Graph Reachability Problems.
#@Eric Allender,David A. Mix Barrington,Tanmoy Chakraborty,Samir Datta,Sambuddha Roy
#t2006
#cIEEE Conference on Computational Complexity
#index104325
#% 
#!
  
#*Upper and Lower Bounds for Some Depth-3 Circuit Classes.
#@Richard Beigel,Alexis Maciel
#t1997
#cIEEE Conference on Computational Complexity
#index104326
#% 
#!
  
#*Uniform Circuits for Division: Consequences and Problems.
#@Eric Allender,David A. Mix Barrington,William Hesse
#t2001
#cIEEE Conference on Computational Complexity
#index104327
#% 
#!
  
#*Circuit Lower Bounds Collapse Relativized Complexity Classes.
#@Richard Beigel,Alexis Maciel
#t1999
#cIEEE Conference on Computational Complexity
#index104328
#% 
#!
  
#*On the Complexity of Numerical Analysis.
#@Eric Allender,Peter Bürgisser,Johan Kjeldgaard-Pedersen,Peter Bro Miltersen
#t2006
#cIEEE Conference on Computational Complexity
#index104329
#% 
#!
  
#*Topology Inside NC¹.
#@Eric Allender,Samir Datta,Sambuddha Roy
#t2005
#cIEEE Conference on Computational Complexity
#index104331
#% 
#!
  
#*Minimizing DNF Formulas and AC Circuits Given a Truth Table.
#@Eric Allender,Lisa Hellerstein,Paul McCabe,Toniann Pitassi,Michael E. Saks
#t2006
#cIEEE Conference on Computational Complexity
#index104334
#% 
#!
  
#*On Arithmetic Branching Programs.
#@Amos Beimel,Anna Gál
#t1998
#cIEEE Conference on Computational Complexity
#index104337
#% 
#!
  
#*Derandomization and Distinguishing Complexity.
#@Eric Allender,Michal Koucký,Detlef Ronneburger,Sambuddha Roy
#t2003
#cIEEE Conference on Computational Complexity
#index104338
#% 
#!
  
#*Stronger Separations for Random-Self-Reducibility, Rounds, and Advice.
#@László Babai,Sophie Laplante
#t1999
#cIEEE Conference on Computational Complexity
#index104339
#% 
#!
  
#*Time-Space Tradeoffs in the Counting Hierarchy.
#@Eric Allender,Michal Koucký,Detlef Ronneburger,Sambuddha Roy,V. Vinay
#t2001
#cIEEE Conference on Computational Complexity
#index104341
#% 
#!
  
#*On the Power of Nonlinear Secrect-Sharing.
#@Amos Beimel,Yuval Ishai
#t2001
#cIEEE Conference on Computational Complexity
#index104342
#% 
#!
  
#*Monotone Circuits for Weighted Threshold Functions.
#@Amos Beimel,Enav Weinreb
#t2005
#cIEEE Conference on Computational Complexity
#index104344
#% 
#!
  
#*Isolation, Matching, and Counting.
#@Eric Allender,Klaus Reinhardt
#t1998
#cIEEE Conference on Computational Complexity
#index104345
#% 
#!
  
#*A Lower Bound for Primality.
#@Eric Allender,Michael E. Saks,Igor Shparlinski
#t1999
#cIEEE Conference on Computational Complexity
#index104347
#% 
#!
  
#*Lower Bounds for Approximations by Low Degree Polynomials Over Z.
#@Noga Alon,Richard Beigel
#t2001
#cIEEE Conference on Computational Complexity
#index104351
#% 
#!
  
#*Multiparty Quantum Coin Flipping.
#@Andris Ambainis,Harry Buhrman,Yevgeniy Dodis,Hein Röhrig
#t2004
#cIEEE Conference on Computational Complexity
#index104355
#% 
#!
  
#*Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity.
#@László Babai,Peter G. Kimmel
#t1997
#cIEEE Conference on Computational Complexity
#index104356
#%619845
#%622577
#%622811
#%623312
#%933113
#%1060151
#%1060286
#!
  
#*The Communication Complexity of Enumeration, Elimination, and Selection.
#@Andris Ambainis,Harry Buhrman,William I. Gasarch,Bala Kalyanasundaram,Leen Torenvliet
#t2000
#cIEEE Conference on Computational Complexity
#index104358
#% 
#!
  
#*Hard Examples for Bounded Depth Frege.
#@Eli Ben-Sasson
#t2002
#cIEEE Conference on Computational Complexity
#index104359
#%104348
#%104437
#%210099
#%210826
#%621214
#%621778
#%621622
#%783754
#%861716
#%950043
#%951756
#%1058564
#!
  
#*Extracting Quantum Entanglement.
#@Andris Ambainis,Adam Smith,Ke Yang
#t2002
#cIEEE Conference on Computational Complexity
#index104360
#% 
#!
  
#*Space Complexity of Random Formulae in Resolution.
#@Eli Ben-Sasson,Nicola Galesi
#t2001
#cIEEE Conference on Computational Complexity
#index104361
#% 
#!
  
#*Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information.
#@Andris Ambainis,Ke Yang
#t2004
#cIEEE Conference on Computational Complexity
#index104362
#% 
#!
  
#*Short PCPs Verifiable in Polylogarithmic Time.
#@Eli Ben-Sasson,Oded Goldreich,Prahladh Harsha,Madhu Sudan,Salil P. Vadhan
#t2005
#cIEEE Conference on Computational Complexity
#index104363
#% 
#!
  
#*Short Proofs Are Narrow - Resolution Made Simple (Abstract).
#@Eli Ben-Sasson,Avi Wigderson
#t1999
#cIEEE Conference on Computational Complexity
#index104365
#% 
#!
  
#*Integer Programming as a Framework for Optimization and Approximability.
#@Ian Barland,Phokion G. Kolaitis,Madhukar N. Thakur
#t1996
#cIEEE Conference on Computational Complexity
#index104367
#% 
#!
  
#*Separating NP-Completeness Notions under Strong Hypotheses.
#@Klaus Ambos-Spies,Levke Bentzien
#t1997
#cIEEE Conference on Computational Complexity
#index104369
#%104449
#%124299
#%210115
#%622445
#%950956
#%972559
#%1088862
#%1088865
#%1093154
#!
  
#*On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.
#@Ker-I Ko,Klaus Weihrauch
#t1996
#cIEEE Conference on Computational Complexity
#index104371
#% 
#!
  
#*Hausdorff Dimension in Exponential Time.
#@Klaus Ambos-Spies,Wolfgang Merkle,Jan Reimann,Frank Stephan
#t2001
#cIEEE Conference on Computational Complexity
#index104372
#% 
#!
  
#*DNA Models and Algorithms for NP-complete Problems.
#@Eric Bach,Anne Condon,Elton Glaser,Celena Tanguay
#t1996
#cIEEE Conference on Computational Complexity
#index104373
#% 
#!
  
#*A Comparison of Weak Completeness Notions.
#@Klaus Ambos-Spies,Elvira Mayordomo,Xizhong Zheng
#t1996
#cIEEE Conference on Computational Complexity
#index104375
#% 
#!
  
#*A Lower Bound for Perceptrons and an Oracle Separation of the PP Hierarchy.
#@Christer Berg,Staffan Ulfberg
#t1997
#cIEEE Conference on Computational Complexity
#index104376
#% 
#!
  
#*Circuits and Expressions with NOn-Associative Gates.
#@Joshua Berman,Arthur Drisko,François Lemieux,Cristopher Moore,Denis Thérien
#t1997
#cIEEE Conference on Computational Complexity
#index104378
#%219454
#%621621
#%971453
#%1089230
#!
  
#*Computational Depth.
#@Luis Antunes,Lance Fortnow,Dieter van Melkebeek
#t2001
#cIEEE Conference on Computational Complexity
#index104379
#% 
#!
  
#*Computationally Private Randomizing Polynomials and Their Applications.
#@Benny Applebaum,Yuval Ishai,Eyal Kushilevitz
#t2005
#cIEEE Conference on Computational Complexity
#index104381
#% 
#!
  
#*Quantum Kolmogorov Complexity.
#@André Berthiaume,Wim van Dam,Sophie Laplante
#t2000
#cIEEE Conference on Computational Complexity
#index104382
#% 
#!
  
#*Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
#@Vikraman Arvind,Piyush P. Kurur,T. C. Vijayaraghavan
#t2005
#cIEEE Conference on Computational Complexity
#index104383
#% 
#!
  
#*Algebras of Minimal Rank over Perfect Fields.
#@Markus Bläser
#t2002
#cIEEE Conference on Computational Complexity
#index104384
#% 
#!
  
#*Solvable Group Isomorphism.
#@Vikraman Arvind,Jacobo Torán
#t2004
#cIEEE Conference on Computational Complexity
#index104385
#% 
#!
  
#*A Nonadaptive NC Checker for Permutation Group Intersection.
#@Vikraman Arvind,Jacobo Torán
#t1997
#cIEEE Conference on Computational Complexity
#index104387
#%621356
#%886942
#%949797
#%951574
#%971558
#!
  
#*Lower Bounds for Testing Bipartiteness in Dense Graphs.
#@Andrej Bogdanov,Luca Trevisan
#t2004
#cIEEE Conference on Computational Complexity
#index104388
#% 
#!
  
#*Abelian Permutation Group Problems and Logspace Counting Classes.
#@Vikraman Arvind,T. C. Vijayaraghavan
#t2004
#cIEEE Conference on Computational Complexity
#index104389
#% 
#!
  
#*More on Noncommutative Polynomial Identity Testing.
#@Andrej Bogdanov,Hoeteck Wee
#t2005
#cIEEE Conference on Computational Complexity
#index104390
#% 
#!
  
#*Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries.
#@Albert Atserias
#t2006
#cIEEE Conference on Computational Complexity
#index104391
#% 
#!
  
#*On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.
#@Beate Bollig,Martin Sauerhoff,Ingo Wegener
#t2001
#cIEEE Conference on Computational Complexity
#index104393
#% 
#!
  
#*Non-Automatizability of Bounded-Depth Frege Proofs.
#@Maria Luisa Bonet,Carlos Domingo,Ricard Gavaldà,Alexis Maciel,Toniann Pitassi
#t1999
#cIEEE Conference on Computational Complexity
#index104395
#% 
#!
  
#*Quantum query complexity and semi-definite programming.
#@Howard Barnum,Michael E. Saks,Mario Szegedy
#t2003
#cIEEE Conference on Computational Complexity
#index104402
#% 
#!
  
#*Deterministic Amplification of Space-Bounded Probabilistic Algorithms.
#@Ziv Bar-Yossef,Oded Goldreich,Avi Wigderson
#t1999
#cIEEE Conference on Computational Complexity
#index104404
#% 
#!
  
#*Reversible Simulation of Irreversible Computation.
#@Ming Li,Paul M. B. Vitányi
#t1996
#cIEEE Conference on Computational Complexity
#index104406
#% 
#!
  
#*Information Theory Methods in Communication Complexity.
#@Ziv Bar-Yossef,T. S. Jayram,Ravi Kumar,D. Sivakumar
#t2002
#cIEEE Conference on Computational Complexity
#index104407
#% 
#!
  
#*Streaming Computation of Combinatorial Objects.
#@Ziv Bar-Yossef,Luca Trevisan,Omer Reingold,Ronen Shaltiel
#t2002
#cIEEE Conference on Computational Complexity
#index104410
#% 
#!
  
#*Universal Arguments and their Applications.
#@Boaz Barak,Oded Goldreich
#t2002
#cIEEE Conference on Computational Complexity
#index104412
#% 
#!
  
#*Applications of a New Transference Theorem to Ajtai's Connection Factor.
#@Jin-yi Cai
#t1999
#cIEEE Conference on Computational Complexity
#index104413
#% 
#!
  
#*Quantum Bounded Query Complexity.
#@Harry Buhrman,Wim van Dam
#t1999
#cIEEE Conference on Computational Complexity
#index104415
#% 
#!
  
#*Quantum Algorithms for Element Distinctness.
#@Harry Buhrman,Christoph Dürr,Mark Heiligman,Peter Høyer,Frédéric Magniez,Miklos Santha,Ronald de Wolf
#t2001
#cIEEE Conference on Computational Complexity
#index104416
#% 
#!
  
#*Two Queries.
#@Harry Buhrman,Lance Fortnow
#t1998
#cIEEE Conference on Computational Complexity
#index104417
#% 
#!
  
#*Six Hypotheses in Search of a Theorem.
#@Harry Buhrman,Lance Fortnow,Leen Torenvliet
#t1997
#cIEEE Conference on Computational Complexity
#index104418
#%104321
#%104781
#%268458
#%619965
#%619998
#%620034
#%620390
#%622445
#%783618
#%861740
#%887126
#%887128
#%887122
#%887445
#%971606
#%972218
#%1059365
#%1060165
#%1060169
#%1060614
#%1060547
#%1088645
#%1091169
#%1092348
#%1095035
#!
  
#*Nonrelativizing Separations.
#@Harry Buhrman,Lance Fortnow,Thomas Thierauf
#t1998
#cIEEE Conference on Computational Complexity
#index104419
#% 
#!
  
#*New Bounds for the Language Compression Problem.
#@Harry Buhrman,Sophie Laplante,Peter Bro Miltersen
#t2000
#cIEEE Conference on Computational Complexity
#index104422
#% 
#!
  
#*Language Compression and Pseudorandom Generators.
#@Harry Buhrman,Troy Lee,Dieter van Melkebeek
#t2004
#cIEEE Conference on Computational Complexity
#index104423
#% 
#!
  
#*Hard Sets are Hard to Find.
#@Harry Buhrman,Dieter van Melkebeek
#t1998
#cIEEE Conference on Computational Complexity
#index104426
#% 
#!
  
#*Separating Complexity Classes Using Structural Properties.
#@Harry Buhrman,Leen Torenvliet
#t2004
#cIEEE Conference on Computational Complexity
#index104428
#% 
#!
  
#*Randomness is Hard.
#@Harry Buhrman,Leen Torenvliet
#t1998
#cIEEE Conference on Computational Complexity
#index104430
#% 
#!
  
#*Complicated Complementations.
#@Harry Buhrman,Leen Torenvliet
#t1999
#cIEEE Conference on Computational Complexity
#index104431
#% 
#!
  
#*Communication Complexity Lower Bounds by Polynomials.
#@Harry Buhrman,Ronald de Wolf
#t2001
#cIEEE Conference on Computational Complexity
#index104432
#% 
#!
  
#*Relativized NP Search Problems and Propositional Proof Systems.
#@Josh Buresh-Oppenheim,Tsuyoshi Morioka
#t2004
#cIEEE Conference on Computational Complexity
#index104433
#% 
#!
  
#*Making Hard Problems Harder.
#@Joshua Buresh-Oppenheim,Rahul Santhanam
#t2006
#cIEEE Conference on Computational Complexity
#index104434
#% 
#!
  
#*Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract).
#@Samuel R. Buss,Dima Grigoriev,Russell Impagliazzo,Toniann Pitassi
#t1999
#cIEEE Conference on Computational Complexity
#index104437
#%621740
#%623057
#%783554
#!
  
#*Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle.
#@Samuel R. Buss,Toniann Pitassi
#t1996
#cIEEE Conference on Computational Complexity
#index104438
#% 
#!
  
#*Circuit Bottom Fan-in and Computational Power.
#@Liming Cai,Jianer Chen,Johan Håstad
#t1997
#cIEEE Conference on Computational Complexity
#index104440
#%695
#%493292
#%621621
#%623172
#%887334
#%887497
#%930445
#%949951
#%1089839
#%3006743
#!
  
#*Optimal Hardness Results for Maximizing Agreements with Monomials.
#@Vitaly Feldman
#t2006
#cIEEE Conference on Computational Complexity
#index104441
#% 
#!
  
#*Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions.
#@Jin-yi Cai,Ajay Nerurkar
#t1998
#cIEEE Conference on Computational Complexity
#index104452
#% 
#!
  
#*The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.
#@Chris Calabro,Russell Impagliazzo,Valentine Kabanets,Ramamohan Paturi
#t2003
#cIEEE Conference on Computational Complexity
#index104454
#% 
#!
  
#*Inverting Onto Functions.
#@Stephen A. Fenner,Lance Fortnow,Ashish V. Naik,John D. Rogers
#t1996
#cIEEE Conference on Computational Complexity
#index104455
#% 
#!
  
#*A Duality between Clause Width and Clause Density for SAT.
#@Chris Calabro,Russell Impagliazzo,Ramamohan Paturi
#t2006
#cIEEE Conference on Computational Complexity
#index104456
#% 
#!
  
#*Complements of Multivalued Functions.
#@Stephen A. Fenner,Frederic Green,Steven Homer,Alan L. Selman,Thomas Thierauf,Heribert Vollmer
#t1996
#cIEEE Conference on Computational Complexity
#index104457
#% 
#!
  
#*Randomness Conductors and Constant-Degree Lossless Expanders.
#@Michael R. Capalbo,Omer Reingold,Salil P. Vadhan,Avi Wigderson
#t2002
#cIEEE Conference on Computational Complexity
#index104458
#% 
#!
  
#*Resolution Lower Bounds for the Weak Pigeonhole Principle.
#@Ran Raz
#t2002
#cIEEE Conference on Computational Complexity
#index104460
#%104754
#%124253
#%210067
#%268903
#%622920
#%622988
#%783758
#%951756
#%1089828
#!
  
#*Nondeterministic NC Computation.
#@Hervé Caussinus,Pierre McKenzie,Denis Thérien,Heribert Vollmer
#t1996
#cIEEE Conference on Computational Complexity
#index104461
#% 
#!
  
#*Error Reduction by Parallel Repetition - a Negative Result.
#@Uriel Feige,Oleg Verbitsky
#t1996
#cIEEE Conference on Computational Complexity
#index104462
#% 
#!
  
#*Lower bounds for predecessor searching in the cell probe model.
#@Pranab Sen
#t2003
#cIEEE Conference on Computational Complexity
#index104463
#% 
#!
  
#*Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness.
#@Amit Chakrabarti,Subhash Khot,Xiaodong Sun
#t2003
#cIEEE Conference on Computational Complexity
#index104464
#% 
#!
  
#*Hyper-Polynomial Hierarchies and the NP-Jump.
#@Stephen A. Fenner,Steven Homer,Randall Pruim,Marcus Schaefer
#t1997
#cIEEE Conference on Computational Complexity
#index104465
#% 
#!
  
#*On the Sensitivity of Cyclically-Invariant Boolean Functions.
#@Sourav Chakraborty
#t2005
#cIEEE Conference on Computational Complexity
#index104466
#% 
#!
  
#*Tolerant Versus Intolerant Testing for Boolean Properties.
#@Eldar Fischer,Lance Fortnow
#t2005
#cIEEE Conference on Computational Complexity
#index104467
#% 
#!
  
#*Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable.
#@Eldar Fischer,Ilan Newman
#t2002
#cIEEE Conference on Computational Complexity
#index104469
#% 
#!
  
#*A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity.
#@Jürgen Forster
#t2001
#cIEEE Conference on Computational Complexity
#index104471
#% 
#!
  
#*Comparing Notions of Full Derandomization.
#@Lance Fortnow
#t2001
#cIEEE Conference on Computational Complexity
#index104473
#% 
#!
  
#*The History of Complexity.
#@Lance Fortnow
#t2002
#cIEEE Conference on Computational Complexity
#index104475
#% 
#!
  
#*Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability.
#@Lance Fortnow
#t1997
#cIEEE Conference on Computational Complexity
#index104477
#%695
#%185539
#%210233
#%210364
#%621778
#%622986
#%783618
#%861708
#%889472
#%930677
#%949951
#%950644
#%950554
#%951341
#%951545
#%971417
#%972920
#%1059527
#%1060547
#%1060671
#%1092467
#%3594734
#!
  
#*Bounded Query Functions with Limited Output Bits.
#@Richard Chang,Jon S. Squire
#t2001
#cIEEE Conference on Computational Complexity
#index104478
#% 
#!
  
#*L-Printable Sets.
#@Lance Fortnow,Judy Goldsmith,Stephen R. Mahaney
#t1996
#cIEEE Conference on Computational Complexity
#index104479
#% 
#!
  
#*On the Complexity of Succinct Zero-Sum Games.
#@Lance Fortnow,Russell Impagliazzo,Valentine Kabanets,Christopher Umans
#t2005
#cIEEE Conference on Computational Complexity
#index104481
#% 
#!
  
#*On the Hardness of Approximating Multicut and Sparsest-Cut.
#@Shuchi Chawla,Robert Krauthgamer,Ravi Kumar,Yuval Rabani,D. Sivakumar
#t2005
#cIEEE Conference on Computational Complexity
#index104482
#% 
#!
  
#*NP with Small Advice.
#@Lance Fortnow,Adam R. Klivans
#t2005
#cIEEE Conference on Computational Complexity
#index104483
#% 
#!
  
#*Tight Lower Bounds for Certain Parameterized NP-Hard Problems.
#@Jianer Chen,Benny Chor,Mike Fellows,Xiuzhen Huang,David W. Juedes,Iyad A. Kanj,Ge Xia
#t2004
#cIEEE Conference on Computational Complexity
#index104484
#% 
#!
  
#*Time-Space Tradeoffs for Nondeterministic Computation.
#@Lance Fortnow,Dieter van Melkebeek
#t2000
#cIEEE Conference on Computational Complexity
#index104485
#% 
#!
  
#*Bounded Nondeterminism and Alternation in Parameterized Complexity Theory.
#@Yijia Chen,Jörg Flum,Martin Grohe
#t2003
#cIEEE Conference on Computational Complexity
#index104486
#% 
#!
  
#*Proving SAT does not have Small Circuits with an Application to the Two.
#@Lance Fortnow,Aduri Pavan,Samik Sengupta
#t2003
#cIEEE Conference on Computational Complexity
#index104487
#% 
#!
  
#*Tight Bound on Johnson's Algoritihm for Max-SAT.
#@Jianer Chen,Donald K. Friesen,Hao Zheng
#t1997
#cIEEE Conference on Computational Complexity
#index104488
#%209945
#%211138
#%211311
#%950456
#%951077
#%953667
#%972335
#!
  
#*An Isomorphism between Subexponential and Parameterized Complexity Theory.
#@Yijia Chen,Martin Grohe
#t2006
#cIEEE Conference on Computational Complexity
#index104490
#% 
#!
  
#*Complexity Limitations on Quantum Computation.
#@Lance Fortnow,John D. Rogers
#t1998
#cIEEE Conference on Computational Complexity
#index104491
#% 
#!
  
#*The Query Complexity of Order-Finding.
#@Richard Cleve
#t2000
#cIEEE Conference on Computational Complexity
#index104494
#% 
#!
  
#*Consequences and Limits of Nonlocal Strategies.
#@Richard Cleve,Peter Høyer,Benjamin Toner,John Watrous
#t2004
#cIEEE Conference on Computational Complexity
#index104496
#% 
#!
  
#*Quantum Algorithmic Entropy.
#@Péter Gács
#t2001
#cIEEE Conference on Computational Complexity
#index104499
#% 
#!
  
#*Computing from Partial Solutions.
#@Anna Gál,Shai Halevi,Richard J. Lipton,Erez Petrank
#t1999
#cIEEE Conference on Computational Complexity
#index104501
#% 
#!
  
#*The Complexity of Treelike Systems over lamda-Local Formulae.
#@Nicola Galesi,Neil Thapen
#t2004
#cIEEE Conference on Computational Complexity
#index104505
#% 
#!
  
#*A Short Guide to Approximation Preserving Reductions.
#@Pierluigi Crescenzi
#t1997
#cIEEE Conference on Computational Complexity
#index104512
#%105163
#%105159
#%209945
#%210090
#%211138
#%219523
#%219652
#%219918
#%622487
#%623185
#%741478
#%887571
#%930716
#%951041
#%972335
#%972447
#%1089010
#%1088831
#%1342114
#%3003185
#!
  
#*Strengths and Weaknesses of Quantum Fingerprinting.
#@Dmitry Gavinsky,Julia Kempe,Ronald de Wolf
#t2006
#cIEEE Conference on Computational Complexity
#index104515
#% 
#!
  
#*Proofs of Membership vs. Proofs of Knowledge.
#@Giovanni Di Crescenzo,Russell Impagliazzo
#t1998
#cIEEE Conference on Computational Complexity
#index104516
#% 
#!
  
#*BP(L(f)).
#@Oliver Giel
#t2000
#cIEEE Conference on Computational Complexity
#index104517
#% 
#!
  
#*Query Order and NP-Completeness.
#@Jack Jie Dai,Jack H. Lutz
#t1999
#cIEEE Conference on Computational Complexity
#index104518
#% 
#!
  
#*Properties of NP-Complete Sets.
#@Christian Glaßer,Aduri Pavan,Alan L. Selman,Samik Sengupta
#t2004
#cIEEE Conference on Computational Complexity
#index104519
#% 
#!
  
#*The Complexity of Tensor Calculus.
#@Carsten Damm,Markus Holzer,Pierre McKenzie
#t2000
#cIEEE Conference on Computational Complexity
#index104520
#% 
#!
  
#*Reductions between Disjoint NP-Pairs.
#@Christian Glaßer,Alan L. Selman,Samik Sengupta
#t2004
#cIEEE Conference on Computational Complexity
#index104521
#% 
#!
  
#*Resolution Width-Size Trade-offs for the Pigeon-Hole Principle.
#@Stefan S. Dantchev
#t2002
#cIEEE Conference on Computational Complexity
#index104522
#% 
#!
  
#*Disjoint NP-Pairs.
#@Christian Glaßer,Alan L. Selman,Samik Sengupta,Liyu Zhang
#t2003
#cIEEE Conference on Computational Complexity
#index104523
#% 
#!
  
#*Tree Resolution Proofs of the Weak Pigeon-Hole Principle.
#@Stefan S. Dantchev,Søren Riis
#t2001
#cIEEE Conference on Computational Complexity
#index104524
#% 
#!
  
#*Complexity and Expressive Power of Logic Programming.
#@Evgeny Dantsin,Thomas Eiter,Georg Gottlob,Andrei Voronkov
#t1997
#cIEEE Conference on Computational Complexity
#index104526
#%71
#%769
#%2248
#%2470
#%3148
#%3247
#%71113
#%71709
#%104549
#%104854
#%211686
#%267485
#%303989
#%303953
#%304100
#%483959
#%485370
#%487631
#%487642
#%487633
#%493694
#%544998
#%544869
#%545047
#%605338
#%622326
#%623215
#%881670
#%888324
#%889091
#%949547
#%950197
#%949951
#%950177
#%950401
#%950923
#%951104
#%951454
#%954822
#%971296
#%971294
#%972284
#%972430
#%972422
#%972899
#%972930
#%984449
#%984663
#%993442
#%1059059
#%1059617
#%1089551
#%1091036
#%1091600
#%1093891
#%1094437
#%1112579
#%1118326
#%1123744
#%1137964
#%3005147
#%3006523
#!
  
#*On Coherence, Random-self-reducibility, and Self-correction.
#@Joan Feigenbaum,Lance Fortnow,Sophie Laplante,Ashish V. Naik
#t1996
#cIEEE Conference on Computational Complexity
#index104527
#% 
#!
  
#*Better Lower Bounds for Locally Decodable Codes.
#@Amit Deshpande,Rahul Jain,Telikepalli Kavitha,Jaikumar Radhakrishnan,Satyanarayana V. Lokam
#t2002
#cIEEE Conference on Computational Complexity
#index104528
#% 
#!
  
#*The Complexity of Solving Equations over Finite Groups.
#@Mikael Goldmann,Alexander Russell
#t1999
#cIEEE Conference on Computational Complexity
#index104531
#% 
#!
  
#*Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval.
#@Oded Goldreich,Howard J. Karloff,Leonard J. Schulman,Luca Trevisan
#t2002
#cIEEE Conference on Computational Complexity
#index104533
#% 
#!
  
#*Uniformly Hard Languages.
#@Rodney G. Downey,Lance Fortnow
#t1998
#cIEEE Conference on Computational Complexity
#index104534
#% 
#!
  
#*Computational Indistinguishability: A Sample Hierarchy.
#@Oded Goldreich,Madhu Sudan
#t1998
#cIEEE Conference on Computational Complexity
#index104535
#% 
#!
  
#*Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK.
#@Oded Goldreich,Salil P. Vadhan
#t1999
#cIEEE Conference on Computational Complexity
#index104537
#% 
#!
  
#*Undecidability Results for Low Complexity Degree Structures.
#@Rodney G. Downey,André Nies
#t1997
#cIEEE Conference on Computational Complexity
#index104538
#%619850
#%929693
#%950956
#%972962
#!
  
#*Complexity Issues in Markov Decision Processes.
#@Judy Goldsmith,Martin Mundhenk
#t1998
#cIEEE Conference on Computational Complexity
#index104539
#% 
#!
  
#*A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition.
#@Pavol Duris,Juraj Hromkovic,Katsushi Inoue
#t2000
#cIEEE Conference on Computational Complexity
#index104540
#% 
#!
  
#*Constructing Ramsey Graphs from Boolean Function Representations.
#@Parikshit Gopalan
#t2006
#cIEEE Conference on Computational Complexity
#index104541
#% 
#!
  
#*Collapsing Oracle-Tape Hierarchies.
#@Georg Gottlob
#t1996
#cIEEE Conference on Computational Complexity
#index104543
#% 
#!
  
#*Three-Query PCPs with Perfect Completeness over non-Boolean Domains.
#@Lars Engebretsen,Jonas Holmerin
#t2003
#cIEEE Conference on Computational Complexity
#index104546
#% 
#!
  
#*Optimal Separation of EROW and CROWPRAMs.
#@Navin Goyal,Michael E. Saks,Srinivasan Venkatesh
#t2003
#cIEEE Conference on Computational Complexity
#index104547
#% 
#!
  
#*The Correlation Between Parity and Quadratic Polynomials Mod 3.
#@Frederic Green
#t2002
#cIEEE Conference on Computational Complexity
#index104551
#% 
#!
  
#*Relations between Average Case Complexity and Approximation Complexity.
#@Uriel Feige
#t2002
#cIEEE Conference on Computational Complexity
#index104552
#% 
#!
  
#*On the Complexity of Quantum ACC.
#@Frederic Green,Steven Homer,Chris Pollett
#t2000
#cIEEE Conference on Computational Complexity
#index104555
#% 
#!
  
#*Zero Knowledge and the Chromatic Number.
#@Uriel Feige,Joe Kilian
#t1996
#cIEEE Conference on Computational Complexity
#index104556
#% 
#!
  
#*The Inapproximability of Lattice and Coding Problems with Preprocessing.
#@Uriel Feige,Daniele Micciancio
#t2002
#cIEEE Conference on Computational Complexity
#index104558
#% 
#!
  
#*Every Linear Threshold Function has a Low-Weight Approximator.
#@Rocco A. Servedio
#t2006
#cIEEE Conference on Computational Complexity
#index104561
#% 
#!
  
#*Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.
#@Pranab Sen
#t2006
#cIEEE Conference on Computational Complexity
#index104562
#% 
#!
  
#*List Decoding with Side Information.
#@Venkatesan Guruswami
#t2003
#cIEEE Conference on Computational Complexity
#index104566
#% 
#!
  
#*On the Hardness of 4-Coloring a 3-Colorable Graph.
#@Venkatesan Guruswami,Sanjeev Khanna
#t2000
#cIEEE Conference on Computational Complexity
#index104567
#% 
#!
  
#*Hardness of Max 3SAT with No Mixed Clauses.
#@Venkatesan Guruswami,Subhash Khot
#t2005
#cIEEE Conference on Computational Complexity
#index104568
#% 
#!
  
#*The Complexity of the Covering Radius Problem on Lattices and Codes.
#@Venkatesan Guruswami,Daniele Micciancio,Oded Regev
#t2004
#cIEEE Conference on Computational Complexity
#index104569
#% 
#!
  
#*Decoding Concatenated Codes using Soft Information.
#@Venkatesan Guruswami,Madhu Sudan
#t2002
#cIEEE Conference on Computational Complexity
#index104570
#% 
#!
  
#*Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games.
#@Dan Gutfreund,Ronen Shaltiel,Amnon Ta-Shma
#t2003
#cIEEE Conference on Computational Complexity
#index104571
#% 
#!
  
#*If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances.
#@Dan Gutfreund,Ronen Shaltiel,Amnon Ta-Shma
#t2005
#cIEEE Conference on Computational Complexity
#index104572
#% 
#!
  
#*Upper Bounds for Quantum Interactive Proofs with Competing Provers.
#@Gus Gutoski
#t2005
#cIEEE Conference on Computational Complexity
#index104573
#% 
#!
  
#*Inequalities for Shannon entropies and Kolmogorov complexities.
#@Daniel Hammer,Andrei E. Romashchenko,Alexander Shen,Nikolai K. Vereshchagin
#t1997
#cIEEE Conference on Computational Complexity
#index104575
#%3006089
#!
  
#*On Modular Counting with Polynomials.
#@Kristoffer Arnsfelt Hansen
#t2006
#cIEEE Conference on Computational Complexity
#index104577
#% 
#!
  
#*Inapproximability Some history and some open problems.
#@Johan Håstad
#t2003
#cIEEE Conference on Computational Complexity
#index104578
#% 
#!
  
#*Simple Analysis of Graph Tests for Linearity and PCP.
#@Johan Håstad,Avi Wigderson
#t2001
#cIEEE Conference on Computational Complexity
#index104579
#% 
#!
  
#*Hardness of the Covering Radius Problem on Lattices.
#@Ishay Haviv,Oded Regev
#t2006
#cIEEE Conference on Computational Complexity
#index104580
#% 
#!
  
#*Acceptance by Transformation Monoids (with an Application to Local Self Reductions).
#@Ulrich Hertrampf
#t1997
#cIEEE Conference on Computational Complexity
#index104587
#%104335
#%481260
#%620030
#%620378
#%627488
#%861762
#%1015351
#%1060547
#%1089634
#!
  
#*Time Bounded Frequency Computations.
#@Maren Hinrichs,Gerd Wechsung
#t1997
#cIEEE Conference on Computational Complexity
#index104590
#%204288
#!
  
#*Small Spans in Scaled Dimension.
#@John M. Hitchcock
#t2004
#cIEEE Conference on Computational Complexity
#index104592
#% 
#!
  
#*Partial Bi-immunity and NP-Completeness.
#@John M. Hitchcock,Aduri Pavan,N. V. Vinodchandran
#t2004
#cIEEE Conference on Computational Complexity
#index104593
#% 
#!
  
#*Dimension, Entropy Rates, and Compression.
#@John M. Hitchcock,N. V. Vinodchandran
#t2004
#cIEEE Conference on Computational Complexity
#index104594
#% 
#!
  
#*The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.
#@Thanh Minh Hoang,Thomas Thierauf
#t2000
#cIEEE Conference on Computational Complexity
#index104595
#% 
#!
  
#*The Complexity of the Inertia and Some Closure Properties of GapL.
#@Thanh Minh Hoang,Thomas Thierauf
#t2005
#cIEEE Conference on Computational Complexity
#index104596
#% 
#!
  
#*Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilon.
#@Jonas Holmerin
#t2002
#cIEEE Conference on Computational Complexity
#index104598
#%210860
#%451455
#%610707
#%622980
#%623183
#%783751
#%861161
#%861924
#%949573
#%949575
#%950272
#%950618
#%1058566
#%1060340
#!
  
#*A Strong Inapproximability Gap for a Generalization of Minimum Bisection.
#@Jonas Holmerin,Subhash Khot
#t2003
#cIEEE Conference on Computational Complexity
#index104599
#% 
#!
  
#*In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time.
#@Russell Impagliazzo,Valentine Kabanets,Avi Wigderson
#t2001
#cIEEE Conference on Computational Complexity
#index104608
#% 
#!
  
#*A zero one law for RP.
#@Russell Impagliazzo,Philippe Moser
#t2003
#cIEEE Conference on Computational Complexity
#index104609
#% 
#!
  
#*Complexity of k-SAT.
#@Russell Impagliazzo,Ramamohan Paturi
#t1999
#cIEEE Conference on Computational Complexity
#index104610
#% 
#!
  
#*Computational Complexity and Phase Transitions.
#@Gabriel Istrate
#t2000
#cIEEE Conference on Computational Complexity
#index104612
#% 
#!
  
#*Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
#@Kazuo Iwama,Chuzo Iwamoto
#t1996
#cIEEE Conference on Computational Complexity
#index104613
#% 
#!
  
#*Learnability beyond AC0.
#@Jeffrey C. Jackson,Adam Klivans,Rocco A. Servedio
#t2002
#cIEEE Conference on Computational Complexity
#index104615
#% 
#!
  
#*Prior Entanglement, Message Compression and Privacy in Quantum Communication.
#@Rahul Jain,Jaikumar Radhakrishnan,Pranab Sen
#t2005
#cIEEE Conference on Computational Complexity
#index104616
#% 
#!
  
#*Average Case Complexity of Unbounded Fanin Circuits.
#@Andreas Jakoby,Rüdiger Reischuk
#t2000
#cIEEE Conference on Computational Complexity
#index104617
#% 
#!
  
#*A Note on the Hardness of Tree Isomorphism.
#@Birgit Jenner,Pierre McKenzie,Jacobo Torán
#t1998
#cIEEE Conference on Computational Complexity
#index104619
#% 
#!
  
#*The Expected Size of Heilbronn's Triangles.
#@Tao Jiang,Ming Li,Paul M. B. Vitányi
#t1999
#cIEEE Conference on Computational Complexity
#index104621
#% 
#!
  
#*Finite Limits and Monotone Computations: The Lower Bounds Criterion.
#@Stasys Jukna
#t1997
#cIEEE Conference on Computational Complexity
#index104623
#%104802
#%210882
#%621530
#%622423
#%622984
#%623324
#%783660
#%797853
#%932008
#!
  
#*Easiness Assumptions and Hardness Tests: Trading Time for Zero Error.
#@Valentine Kabanets
#t2000
#cIEEE Conference on Computational Complexity
#index104624
#% 
#!
  
#*A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.
#@Jeff Kahn,Michael E. Saks,Clifford D. Smyth
#t2000
#cIEEE Conference on Computational Complexity
#index104625
#% 
#!
  
#*On the Complexity of Intersecting Finite State Automata.
#@George Karakostas,Richard J. Lipton,Anastasios Viglas
#t2000
#cIEEE Conference on Computational Complexity
#index104626
#% 
#!
  
#*LR(k) Testing is Average Case Complete.
#@Christoph Karg
#t1997
#cIEEE Conference on Computational Complexity
#index104632
#%104789
#%120454
#%136916
#%211770
#%219969
#%546339
#%623253
#%772948
#%971495
#%972128
#%973092
#%1059915
#!
  
#*On the Ring Isomorphism and Automorphism Problems.
#@Neeraj Kayal,Nitin Saxena
#t2005
#cIEEE Conference on Computational Complexity
#index104634
#% 
#!
  
#*Polynomial Identity Testing for Depth 3 Circuits.
#@Neeraj Kayal,Nitin Saxena
#t2006
#cIEEE Conference on Computational Complexity
#index104635
#% 
#!
  
#*Constraint Satisfaction: The Approximability of Minimization Problems.
#@Sanjeev Khanna,Madhu Sudan,Luca Trevisan
#t1997
#cIEEE Conference on Computational Complexity
#index104636
#%105163
#%210090
#%211176
#%621298
#%622487
#%622488
#%622980
#%623072
#%861858
#%887571
#%888573
#%951041
#%950956
#%953214
#%971768
#%972335
#%972423
#%1013822
#%1059290
#%3003185
#!
  
#*On the Power of Unique 2-Prover 1-Round Games.
#@Subhash Khot
#t2002
#cIEEE Conference on Computational Complexity
#index104637
#% 
#!
  
#*Vertex Cover Might be Hard to Approximate to within 2-\varepsilon.
#@Subhash Khot,Oded Regev
#t2003
#cIEEE Conference on Computational Complexity
#index104638
#% 
#!
  
#*A 3-Query Non-Adaptive PCP with Perfect Completeness.
#@Subhash Khot,Rishi Saket
#t2006
#cIEEE Conference on Computational Complexity
#index104639
#% 
#!
  
#*Rectangle Size Bounds and Threshold Covers in Communication Complexity.
#@Hartmut Klauck
#t2003
#cIEEE Conference on Computational Complexity
#index104641
#% 
#!
  
#*Lower Bounds for Computation with Limited Nondeterminism.
#@Hartmut Klauck
#t1998
#cIEEE Conference on Computational Complexity
#index104642
#% 
#!
  
#*On the Resource Bounded Measure of P/poly.
#@Johannes Köbler,Wolfgang Lindner
#t1998
#cIEEE Conference on Computational Complexity
#index104645
#% 
#!
  
#*Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets.
#@Johannes Köbler,Jochen Messner
#t1998
#cIEEE Conference on Computational Complexity
#index104646
#% 
#!
  
#*VC Dimension in Circuit Complexity.
#@Pascal Koiran
#t1996
#cIEEE Conference on Computational Complexity
#index104650
#% 
#!
  
#*Universal Traversal Sequences with Backtracking.
#@Michal Koucký
#t2001
#cIEEE Conference on Computational Complexity
#index104654
#% 
#!
  
#*Circuit Lower Bounds via Ehrenfeucht-Fraisse Games.
#@Michal Koucký,Clemens Lautemann,Sebastian Poloczek,Denis Thérien
#t2006
#cIEEE Conference on Computational Complexity
#index104655
#% 
#!
  
#*An Application of Matroid Theory to the SAT Problem.
#@Oliver Kullmann
#t2000
#cIEEE Conference on Computational Complexity
#index104660
#% 
#!
  
#*Proofs, Codes, and Polynomial-Time Reducibilities.
#@Ravi Kumar,D. Sivakumar
#t1999
#cIEEE Conference on Computational Complexity
#index104661
#% 
#!
  
#*A Note on the Shortest Lattice Vector Problem.
#@Ravi Kumar,D. Sivakumar
#t1999
#cIEEE Conference on Computational Complexity
#index104662
#% 
#!
  
#*Some Results on Majority Quantifiers over Words.
#@Klaus-Jörn Lange
#t2004
#cIEEE Conference on Computational Complexity
#index104667
#% 
#!
  
#*Reversible Space Equals Deterministic Space.
#@Klaus-Jörn Lange,Pierre McKenzie,Alain Tapp
#t1997
#cIEEE Conference on Computational Complexity
#index104670
#%104406
#%211784
#%887497
#%952817
#%1058575
#!
  
#*The Quantum Adversary Method and Classical Formula Size Lower Bounds.
#@Sophie Laplante,Troy Lee,Mario Szegedy
#t2005
#cIEEE Conference on Computational Complexity
#index104672
#% 
#!
  
#*Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.
#@Sophie Laplante,Frédéric Magniez
#t2004
#cIEEE Conference on Computational Complexity
#index104673
#% 
#!
  
#*On Positive P.
#@Clemens Lautemann,Thomas Schwentick,Iain A. Stewart
#t1996
#cIEEE Conference on Computational Complexity
#index104674
#% 
#!
  
#*Resource Bounded Measure and Learnability.
#@Wolfgang Lindner,Rainer Schuler,Osamu Watanabe
#t1998
#cIEEE Conference on Computational Complexity
#index104677
#% 
#!
  
#*On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas.
#@Richard J. Lipton,Evangelos Markakis,Aranyak Mehta,Nisheeth K. Vishnoi
#t2005
#cIEEE Conference on Computational Complexity
#index104679
#% 
#!
  
#*On the Complexity of Hardness Amplification.
#@Chi-Jen Lu,Shi-Chun Tsai,Hsin-Lung Wu
#t2005
#cIEEE Conference on Computational Complexity
#index104683
#% 
#!
  
#*Dimension in Complexity Classes.
#@Jack H. Lutz
#t2000
#cIEEE Conference on Computational Complexity
#index104684
#% 
#!
  
#*Resource-Bounded Measure.
#@Jack H. Lutz
#t1998
#cIEEE Conference on Computational Complexity
#index104690
#% 
#!
  
#*The Density of Weakly Complete Problems under Adaptive Reductions.
#@Jack H. Lutz,Yong Zhao
#t1997
#cIEEE Conference on Computational Complexity
#index104693
#%619922
#%972559
#%1058348
#%1060018
#%1060169
#%1088865
#!
  
#*Theory of Periodically Specified Problems: Complexity and Approximability.
#@Madhav V. Marathe,Harry B. Hunt III,Daniel J. Rosenkrantz,Richard Edwin Stearns
#t1998
#cIEEE Conference on Computational Complexity
#index104699
#% 
#!
  
#*Quantum Arthur-Merlin Games.
#@Chris Marriott,John Watrous
#t2004
#cIEEE Conference on Computational Complexity
#index104701
#% 
#!
  
#*Parameterized Complexity of Constraint Satisfaction Problems.
#@Dániel Marx
#t2004
#cIEEE Conference on Computational Complexity
#index104702
#% 
#!
  
#*Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L.
#@Dieter van Melkebeek
#t1996
#cIEEE Conference on Computational Complexity
#index104705
#% 
#!
  
#*A Generic Time Hierarchy for Semantic Models with One Bit of Advice.
#@Dieter van Melkebeek,Konstantin Pervyshev
#t2006
#cIEEE Conference on Computational Complexity
#index104706
#% 
#!
  
#*The complexity of stochastic sequences.
#@Wolfgang Merkle
#t2003
#cIEEE Conference on Computational Complexity
#index104707
#% 
#!
  
#*Expanders from Symmetric Codes.
#@Roy Meshulam,Avi Wigderson
#t2002
#cIEEE Conference on Computational Complexity
#index104708
#%211665
#!
  
#*Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection.
#@Daniele Micciancio
#t2002
#cIEEE Conference on Computational Complexity
#index104710
#% 
#!
  
#*On the Complexity of Approximating the VC Dimension.
#@Elchanan Mossel,Christopher Umans
#t2001
#cIEEE Conference on Computational Complexity
#index104713
#% 
#!
  
#*Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y".
#@Andrei A. Muchnik,Andrei E. Romashchenko,Alexander Shen,Nikolai K. Vereshchagin
#t1999
#cIEEE Conference on Computational Complexity
#index104714
#% 
#!
  
#*Logical Operations and Kolmogorov Complexity II.
#@Andrei A. Muchnik,Nikolai K. Vereshchagin
#t2001
#cIEEE Conference on Computational Complexity
#index104715
#% 
#!
  
#*A Lower Bound for the Shortest Path Problem.
#@Ketan Mulmuley,Pradyut Shah
#t2000
#cIEEE Conference on Computational Complexity
#index104716
#% 
#!
  
#*A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP.
#@Ashish V. Naik,Alan L. Selman
#t1996
#cIEEE Conference on Computational Complexity
#index104719
#% 
#!
  
#*Universal Languages and the Power of Diagonalization.
#@Alan Nash,Russell Impagliazzo,Jeffrey B. Remmel
#t2003
#cIEEE Conference on Computational Complexity
#index104720
#% 
#!
  
#*On Communication over an Entanglement-Assisted Quantum Channel.
#@Ashwin Nayak,Julia Salzman
#t2002
#cIEEE Conference on Computational Complexity
#index104721
#% 
#!
  
#*Computing in Fault Tolerance Broadcast Networks.
#@Ilan Newman
#t2004
#cIEEE Conference on Computational Complexity
#index104722
#% 
#!
  
#*Average-Case Computations - Comparing AvgP, HP, and Nearly-P.
#@Arfst Nickelsen,Birgit Schelm
#t2005
#cIEEE Conference on Computational Complexity
#index104724
#% 
#!
  
#*Extracting Randomness: How and Why A survey.
#@Noam Nisan
#t1996
#cIEEE Conference on Computational Complexity
#index104727
#% 
#!
  
#*Hardness Amplification within NP.
#@Ryan O'Donnell
#t2002
#cIEEE Conference on Computational Complexity
#index104728
#%104786
#%108761
#%210986
#%211194
#%783586
#%861092
#%949897
#%950994
#%973009
#!
  
#*Extremal properties of polynomial threshold functions.
#@Ryan O'Donnell,Rocco A. Servedio
#t2003
#cIEEE Conference on Computational Complexity
#index104729
#% 
#!
  
#*Learning Monotone Decision Trees in Polynomial Time.
#@Ryan O'Donnell,Rocco A. Servedio
#t2006
#cIEEE Conference on Computational Complexity
#index104730
#% 
#!
  
#*The Complexity of Knowledge Representation.
#@Christos H. Papadimitriou
#t1996
#cIEEE Conference on Computational Complexity
#index104739
#% 
#!
  
#*Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness.
#@Rafael Pass
#t2006
#cIEEE Conference on Computational Complexity
#index104743
#% 
#!
  
#*Separation of NP-Completeness Notions.
#@Aduri Pavan,Alan L. Selman
#t2001
#cIEEE Conference on Computational Complexity
#index104744
#% 
#!
  
#*The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract).
#@Stephen Ponzio,Jaikumar Radhakrishnan,Srinivasan Venkatesh
#t1999
#cIEEE Conference on Computational Complexity
#index104746
#% 
#!
  
#*Quantum versus Classical Proofs and Advice.
#@Scott Aaronson,Greg Kuperberg
#t2007
#cIEEE Conference on Computational Complexity
#index104747
#% 
#!
  
#*Deterministic Polynomial Identity Testing in Non-Commutative Models.
#@Ran Raz,Amir Shpilka
#t2004
#cIEEE Conference on Computational Complexity
#index104751
#% 
#!
  
#*On the Power of Quantum Proofs.
#@Ran Raz,Amir Shpilka
#t2004
#cIEEE Conference on Computational Complexity
#index104752
#% 
#!
  
#*Arthur-Merlin Games in Boolean Decision Trees.
#@Ran Raz,Gábor Tardos,Oleg Verbitsky,Nikolai K. Vereshchagin
#t1998
#cIEEE Conference on Computational Complexity
#index104753
#% 
#!
  
#*Resolution Lower Bounds for Perfect Matching Principles.
#@Alexander A. Razborov
#t2002
#cIEEE Conference on Computational Complexity
#index104754
#% 
#!
  
#*Polynomial Vicinity Circuits and Nonlinear Lower Bounds.
#@Kenneth W. Regan
#t1997
#cIEEE Conference on Computational Complexity
#index104758
#%104477
#%104757
#%609926
#%621214
#%951209
#%951341
#%951538
#%952996
#%1060609
#%1092770
#%1093308
#!
  
#*Probabilistic Martingales and BPTIME Classes.
#@Kenneth W. Regan,D. Sivakumar
#t1998
#cIEEE Conference on Computational Complexity
#index104759
#% 
#!
  
#*Improved Inapproximability of Lattice and Coding Problems with Preprocessing.
#@Oded Regev
#t2003
#cIEEE Conference on Computational Complexity
#index104760
#% 
#!
  
#*On the Complexity of Diophantine Geometry in Low Dimensions (Abstract).
#@J. Maurice Rojas
#t1999
#cIEEE Conference on Computational Complexity
#index104763
#% 
#!
  
#*Extracting the Mutual Information for a Triple of Binary Strings.
#@Andrei E. Romashchenko
#t2003
#cIEEE Conference on Computational Complexity
#index104764
#% 
#!
  
#*Combinatorial Interpretation of Kolmogorov Complexity.
#@Andrei E. Romashchenko,Alexander Shen,Nikolai K. Vereshchagin
#t2000
#cIEEE Conference on Computational Complexity
#index104765
#% 
#!
  
#*On the Hardness of Distinguishing Mixed-State Quantum Computations.
#@Bill Rosgen
#t2005
#cIEEE Conference on Computational Complexity
#index104766
#% 
#!
  
#*Randomization and Derandomization in Space_Bounded Computation.
#@Michael E. Saks
#t1996
#cIEEE Conference on Computational Complexity
#index104769
#% 
#!
  
#*On Separators, Segregators and Time versus Space.
#@Rahul Santhanam
#t2001
#cIEEE Conference on Computational Complexity
#index104773
#% 
#!
  
#*Holographic Proofs and Derandomization.
#@Rahul Santhanam,Dieter van Melkebeek
#t2003
#cIEEE Conference on Computational Complexity
#index104774
#% 
#!
  
#*Deciding the K-Dimension is PSPACE-Complete.
#@Marcus Schaefer
#t2000
#cIEEE Conference on Computational Complexity
#index104775
#% 
#!
  
#*Graph Ramsey Theory and the Polynomial Hierarchy (Abstract).
#@Marcus Schaefer
#t1999
#cIEEE Conference on Computational Complexity
#index104776
#% 
#!
  
#*Deciding the Vapnik-Cervonenkis dimension is Sigma-complete.
#@Marcus Schäfer
#t1996
#cIEEE Conference on Computational Complexity
#index104777
#% 
#!
  
#*Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP.
#@Rainer Schuler
#t1996
#cIEEE Conference on Computational Complexity
#index104778
#% 
#!
  
#*A Note on Universal Distributions for Polynomial-Time Computable Distributions.
#@Rainer Schuler
#t1997
#cIEEE Conference on Computational Complexity
#index104779
#%932531
#%933747
#%971495
#%972128
#%973092
#%1059915
#!
  
#*Much Ado about Functions.
#@Alan L. Selman
#t1996
#cIEEE Conference on Computational Complexity
#index104781
#% 
#!
  
#*Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy.
#@Alan L. Selman,Samik Sengupta
#t2004
#cIEEE Conference on Computational Complexity
#index104782
#% 
#!
  
#*Quantum versus Classical Learnability.
#@Rocco A. Servedio,Steven J. Gortler
#t2001
#cIEEE Conference on Computational Complexity
#index104784
#% 
#!
  
#*Towards Proving Strong Direct Product Theorems.
#@Ronen Shaltiel
#t2001
#cIEEE Conference on Computational Complexity
#index104786
#% 
#!
  
#*The Law of the Iterated Logarithm for p-Random Sequences.
#@Yongge Wang
#t1996
#cIEEE Conference on Computational Complexity
#index104787
#% 
#!
  
#*How to Get More Mileage from Randomness Extractors.
#@Ronen Shaltiel
#t2006
#cIEEE Conference on Computational Complexity
#index104788
#% 
#!
  
#*Pseudorandomness for Approximate Counting and Sampling.
#@Ronen Shaltiel,Christopher Umans
#t2005
#cIEEE Conference on Computational Complexity
#index104790
#% 
#!
  
#*Affine Projections of Symmetric Polynomials.
#@Amir Shpilka
#t2001
#cIEEE Conference on Computational Complexity
#index104794
#% 
#!
  
#*Arthur and Merlin in a Quantum World.
#@John Watrous
#t2002
#cIEEE Conference on Computational Complexity
#index104795
#% 
#!
  
#*Constructions of Low-Degree and Error-Correcting in-Biased Generators.
#@Amir Shpilka
#t2006
#cIEEE Conference on Computational Complexity
#index104796
#% 
#!
  
#*Relationships Between Quantum and Classical Space-Bounded Complexity Classes.
#@John Watrous
#t1998
#cIEEE Conference on Computational Complexity
#index104797
#% 
#!
  
#*Depth-3 Arithmetic Formulae over Fields of Characteristic Zero.
#@Amir Shpilka,Avi Wigderson
#t1999
#cIEEE Conference on Computational Complexity
#index104798
#% 
#!
  
#*Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity.
#@John Watrous
#t1999
#cIEEE Conference on Computational Complexity
#index104799
#% 
#!
  
#*Minimization of Decision Trees Is Hard to Approximate.
#@Detlef Sieling
#t2003
#cIEEE Conference on Computational Complexity
#index104800
#% 
#!
  
#*On Pseudoentropy versus Compressibility.
#@Hoeteck Wee
#t2004
#cIEEE Conference on Computational Complexity
#index104801
#% 
#!
  
#*A Note on the Bottleneck Counting Argument.
#@Janos Simon,Shi-Chun Tsai
#t1997
#cIEEE Conference on Computational Complexity
#index104802
#%3670
#%210882
#%211612
#%622984
#%797853
#!
  
#*New Results on the Complexity of the Middle Bit of Multiplication.
#@Ingo Wegener,Philipp Woelfel
#t2005
#cIEEE Conference on Computational Complexity
#index104803
#% 
#!
  
#*Applications of the Sum-Product Theorem in Finite Fields.
#@Avi Wigderson
#t2006
#cIEEE Conference on Computational Complexity
#index104805
#% 
#!
  
#*Algorithmic Derandomization via Complexity Theory.
#@D. Sivakumar
#t2002
#cIEEE Conference on Computational Complexity
#index104806
#%210998
#%210999
#%219799
#%544818
#%610438
#%611289
#%622132
#%622339
#%622453
#%622548
#%622796
#%622669
#%623103
#%623276
#%623050
#%818078
#%950840
#%952561
#%972793
#%972642
#%972704
#%1060042
#%1060316
#!
  
#*On Membership Comparable Sets.
#@D. Sivakumar
#t1998
#cIEEE Conference on Computational Complexity
#index104808
#% 
#!
  
#*De-Randomizing BPP: The State of the Art.
#@Avi Wigderson
#t1999
#cIEEE Conference on Computational Complexity
#index104809
#% 
#!
  
#*Models of Computation in Coding Theory.
#@Daniel A. Spielman
#t1998
#cIEEE Conference on Computational Complexity
#index104810
#% 
#!
  
#*Better Time-Space Lower Bounds for SAT and Related Problems.
#@Ryan Williams
#t2005
#cIEEE Conference on Computational Complexity
#index104811
#% 
#!
  
#*Links Between Complexity Theory and Constrained Block Coding.
#@Larry J. Stockmeyer,Dharmendra S. Modha
#t2001
#cIEEE Conference on Computational Complexity
#index104812
#% 
#!
  
#*Pseudorandom Generators without the XOR Lemma (Abstract).
#@Madhu Sudan,Luca Trevisan,Salil P. Vadhan
#t1999
#cIEEE Conference on Computational Complexity
#index104814
#% 
#!
  
#*Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
#@Xiaoming Sun,Andrew Chi-Chih Yao,Shengyu Zhang
#t2004
#cIEEE Conference on Computational Complexity
#index104816
#% 
#!
  
#*Rapid Mixing.
#@Peter Winkler
#t2002
#cIEEE Conference on Computational Complexity
#index104817
#% 
#!
  
#*On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.
#@Philipp Woelfel
#t2002
#cIEEE Conference on Computational Complexity
#index104819
#% 
#!
  
#*Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity.
#@Ronald de Wolf
#t2000
#cIEEE Conference on Computational Complexity
#index104821
#% 
#!
  
#*The Communication Complexity of the Universal Relation.
#@Gábor Tardos,Uri Zwick
#t1997
#cIEEE Conference on Computational Complexity
#index104822
#%708
#%210514
#%211268
#%930538
#%931368
#%951418
#%972103
#%973018
#!
  
#*A Geometric Approach to Information-Theoretic Private Information Retrieval.
#@David P. Woodruff,Sergey Yekhanin
#t2005
#cIEEE Conference on Computational Complexity
#index104823
#% 
#!
  
#*Preface.
#@
#t2005
#cIEEE Conference on Computational Complexity
#index104825
#% 
#!
  
#*Learning DNF by Approximating Inclusion-Exclusion Formulae.
#@Jun Tarui,Tatsuie Tsukiji
#t1999
#cIEEE Conference on Computational Complexity
#index104826
#% 
#!
  
#*Committees.
#@
#t2005
#cIEEE Conference on Computational Complexity
#index104827
#% 
#!
  
#*Awards.
#@
#t2005
#cIEEE Conference on Computational Complexity
#index104829
#% 
#!
  
#*Preface.
#@
#t2006
#cIEEE Conference on Computational Complexity
#index104831
#% 
#!
  
#*Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines.
#@Iannis Tourlakis
#t2000
#cIEEE Conference on Computational Complexity
#index104832
#% 
#!
  
#*Committees.
#@
#t2006
#cIEEE Conference on Computational Complexity
#index104833
#% 
#!
  
#*New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.
#@Iannis Tourlakis
#t2006
#cIEEE Conference on Computational Complexity
#index104834
#% 
#!
  
#*Reviewers.
#@
#t2006
#cIEEE Conference on Computational Complexity
#index104835
#% 
#!
  
#*Awards.
#@
#t2006
#cIEEE Conference on Computational Complexity
#index104837
#% 
#!
  
#*Integer Circuit Evaluation is PSPACE-Complete.
#@Ke Yang
#t2000
#cIEEE Conference on Computational Complexity
#index104839
#% 
#!
  
#*On Statistical Query Sampling and NMR Quantum Computing.
#@Ke Yang,Avrim Blum
#t2003
#cIEEE Conference on Computational Complexity
#index104841
#% 
#!
  
#*A Survey of Optimal PCP Characterizations of NP.
#@Luca Trevisan
#t2000
#cIEEE Conference on Computational Complexity
#index104842
#% 
#!
  
#*Pseudorandomness and Average-Case Complexity via Uniform Reductions.
#@Luca Trevisan,Salil P. Vadhan
#t2002
#cIEEE Conference on Computational Complexity
#index104844
#% 
#!
  
#*Compression of Samplable Sources.
#@Luca Trevisan,Salil P. Vadhan,David Zuckerman
#t2004
#cIEEE Conference on Computational Complexity
#index104846
#% 
#!
  
#*Exposure-Resilient Extractors.
#@Marius Zimand
#t2006
#cIEEE Conference on Computational Complexity
#index104847
#% 
#!
  
#*Pseudo-Random Generators for All Hardnesses.
#@Christopher Umans
#t2002
#cIEEE Conference on Computational Complexity
#index104850
#%104608
#%104624
#%211457
#%211867
#%622218
#%622334
#%622539
#%623187
#%623102
#%861146
#%861055
#%949520
#%960453
#%972363
#%972704
#%1058645
#!
  
#*Godel and Computations (Abstract).
#@Pavel Pudlák
#t2006
#cIEEE Conference on Computational Complexity
#index104853
#% 
#!
  
#*Succinct Representation, Leaf Languages, and Projection Reductions.
#@Helmut Veith
#t1996
#cIEEE Conference on Computational Complexity
#index104854
#% 
#!
  
#*Efficient Arguments without Short PCPs.
#@Yuval Ishai,Eyal Kushilevitz,Rafail Ostrovsky
#t2007
#cIEEE Conference on Computational Complexity
#index104855
#% 
#!
  
#*How to Encode a Logical Structure by an OBDD.
#@Helmut Veith
#t1998
#cIEEE Conference on Computational Complexity
#index104856
#% 
#!
  
#*Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State.
#@Paul M. B. Vitányi
#t2000
#cIEEE Conference on Computational Complexity
#index104857
#% 
#!
  
#*Derandomization of Probabilistic Auxiliary Pushdown Automata Classes.
#@H. Venkateswaran
#t2006
#cIEEE Conference on Computational Complexity
#index104858
#% 
#!
  
#*Testing Properties of Constraint-Graphs.
#@Shirley Halevy,Oded Lachish,Ilan Newman,Dekel Tsur
#t2007
#cIEEE Conference on Computational Complexity
#index104859
#% 
#!
  
#*Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates.
#@Emanuele Viola
#t2005
#cIEEE Conference on Computational Complexity
#index104861
#% 
#!
  
#*Lower Bounds for Multi-Player Pointer Jumping.
#@Amit Chakrabarti
#t2007
#cIEEE Conference on Computational Complexity
#index104863
#% 
#!
  
#*On Operators of Higher Types.
#@Heribert Vollmer,Klaus W. Wagner
#t1997
#cIEEE Conference on Computational Complexity
#index104865
#%209946
#%209945
#%210576
#%267478
#%268799
#%619820
#%621351
#%623088
#%623050
#%951574
#%971453
#%972704
#%1015247
#%1058670
#%1060547
#%1093777
#!
  
#*Independent Minimum Length Programs to Translate between Given Strings.
#@Nikolai K. Vereshchagin,Michael V. Vyugin
#t2000
#cIEEE Conference on Computational Complexity
#index104866
#% 
#!
  
#*Time-Space Tradeoffs for Counting NP Solutions Modulo Integers.
#@Ryan Williams
#t2007
#cIEEE Conference on Computational Complexity
#index104868
#% 
#!
  
#*Hierarchies of Circuit Classes that are Closed under Complement.
#@V. Vinay
#t1996
#cIEEE Conference on Computational Complexity
#index104869
#% 
#!
  
#*The Communication Complexity of Correlation.
#@Prahladh Harsha,Rahul Jain,David A. McAllester,Jaikumar Radhakrishnan
#t2007
#cIEEE Conference on Computational Complexity
#index104870
#% 
#!
  
#*Bases Collapse in Holographic Algorithms.
#@Jin-yi Cai,Pinyan Lu
#t2007
#cIEEE Conference on Computational Complexity
#index104872
#% 
#!
  
#*Hardness vs. Randomness within Alternating Time.
#@Emanuele Viola
#t2003
#cIEEE Conference on Computational Complexity
#index104873
#% 
#!
  
#*An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity.
#@Kei Uchizawa,Eiji Takimoto
#t2007
#cIEEE Conference on Computational Complexity
#index104874
#% 
#!
  
#*On Constructing Parallel Pseudorandom Generators from One-Way Functions.
#@Emanuele Viola
#t2005
#cIEEE Conference on Computational Complexity
#index104875
#% 
#!
  
#*On the Complexity of the Monotonicity Verification.
#@Andrei A. Voronenko
#t2000
#cIEEE Conference on Computational Complexity
#index104876
#% 
#!
  
#*Quantum t-designs: t-wise Independence in the Quantum World.
#@Andris Ambainis,Joseph Emerson
#t2007
#cIEEE Conference on Computational Complexity
#index104877
#% 
#!
  
#*Directed Planar Reachability is in Unambiguous Log-Space.
#@Chris Bourke,Raghunath Tewari,N. V. Vinodchandran
#t2007
#cIEEE Conference on Computational Complexity
#index104878
#% 
#!
  
#*Parity Problems in Planar Graphs.
#@Mark Braverman,Raghav Kulkarni,Sambuddha Roy
#t2007
#cIEEE Conference on Computational Complexity
#index104879
#% 
#!
  
#*On the Theory of Matchgate Computations.
#@Jin-yi Cai,Vinay Choudhary,Pinyan Lu
#t2007
#cIEEE Conference on Computational Complexity
#index104880
#% 
#!
  
#*Bounded Queries and the NP Machine Hypothesis.
#@Richard Chang,Suresh Purini
#t2007
#cIEEE Conference on Computational Complexity
#index104881
#% 
#!
  
#*On Parameterized Path and Chordless Path Problems.
#@Yijia Chen,Jörg Flum
#t2007
#cIEEE Conference on Computational Complexity
#index104882
#% 
#!
  
#*S-T Connectivity on Digraphs with a Known Stationary Distribution.
#@Kai-Min Chung,Omer Reingold,Salil P. Vadhan
#t2007
#cIEEE Conference on Computational Complexity
#index104883
#% 
#!
  
#*Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems.
#@Richard Cleve,William Slofstra,Falk Unger,Sarvagya Upadhyay
#t2007
#cIEEE Conference on Computational Complexity
#index104884
#% 
#!
  
#*Understanding Parallel Repetition Requires Understanding Foams.
#@Uriel Feige,Guy Kindler,Ryan O'Donnell
#t2007
#cIEEE Conference on Computational Complexity
#index104885
#% 
#!
  
#*Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes.
#@Venkatesan Guruswami,Christopher Umans,Salil P. Vadhan
#t2007
#cIEEE Conference on Computational Complexity
#index104886
#% 
#!
  
#*A New Interactive Hashing Theorem.
#@Iftach Haitner,Omer Reingold
#t2007
#cIEEE Conference on Computational Complexity
#index104887
#% 
#!
  
#*The Complexity of Polynomials and Their Coefficient Functions.
#@Guillaume Malod
#t2007
#cIEEE Conference on Computational Complexity
#index104888
#% 
#!
  
#*On C-Degrees, H-Degrees and T-Degrees.
#@Wolfgang Merkle,Frank Stephan
#t2007
#cIEEE Conference on Computational Complexity
#index104889
#% 
#!
  
#*Limits on the Hardness of Lattice Problems in ell _p Norms.
#@Chris Peikert
#t2007
#cIEEE Conference on Computational Complexity
#index104890
#% 
#!
  
#*On Heuristic Time Hierarchies.
#@Konstantin Pervyshev
#t2007
#cIEEE Conference on Computational Complexity
#index104891
#% 
#!
  
#*A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
#@Grant Schoenebeck,Luca Trevisan,Madhur Tulsiani
#t2007
#cIEEE Conference on Computational Complexity
#index104892
#% 
#!
  
#*Halfspace Matrices.
#@Alexander A. Sherstov
#t2007
#cIEEE Conference on Computational Complexity
#index104893
#% 
#!
  
#*On Approximate Majority and Probabilistic Time.
#@Emanuele Viola
#t2007
#cIEEE Conference on Computational Complexity
#index104894
#% 
#!
  
#*Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols.
#@Emanuele Viola,Avi Wigderson
#t2007
#cIEEE Conference on Computational Complexity
#index104895
#% 
#!
  
#*On Derandomizing Probabilistic Sublinear-Time Algorithms.
#@Marius Zimand
#t2007
#cIEEE Conference on Computational Complexity
#index104896
#% 
#!
  
#*On Computation and Communication with Small Bias.
#@Harry Buhrman,Nikolai K. Vereshchagin,Ronald de Wolf
#t2007
#cIEEE Conference on Computational Complexity
#index104897
#% 
#!
  
#*Low-Depth Witnesses are Easy to Find.
#@Luis Antunes,Lance Fortnow,Alexandre Pinto,Andre Souto
#t2007
#cIEEE Conference on Computational Complexity
#index104898
#% 
#!
  
#*Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.
#@Kord Eickmeyer,Martin Grohe,Magdalena Grüber
#t2008
#cIEEE Conference on Computational Complexity
#index104899
#% 
#!
  
#*The Multiplicative Quantum Adversary.
#@Robert Spalek
#t2008
#cIEEE Conference on Computational Complexity
#index104900
#% 
#!
  
#*Using Entanglement in Quantum Multi-prover Interactive Proofs.
#@Julia Kempe,Hirotada Kobayashi,Keiji Matsumoto,Thomas Vidick
#t2008
#cIEEE Conference on Computational Complexity
#index104901
#% 
#!
  
#*Randomised Individual Communication Complexity.
#@Harry Buhrman,Michal Koucký,Nikolai K. Vereshchagin
#t2008
#cIEEE Conference on Computational Complexity
#index104902
#% 
#!
  
#*Hardness Amplification within NP against Deterministic Algorithms.
#@Parikshit Gopalan,Venkatesan Guruswami
#t2008
#cIEEE Conference on Computational Complexity
#index104903
#% 
#!
  
#*A Direct Product Theorem for Discrepancy.
#@Troy Lee,Adi Shraibman,Robert Spalek
#t2008
#cIEEE Conference on Computational Complexity
#index104904
#% 
#!
  
#*Towards Dimension Expanders over Finite Fields.
#@Zeev Dvir,Amir Shpilka
#t2008
#cIEEE Conference on Computational Complexity
#index104905
#% 
#!
  
#*Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity.
#@Dmitry Gavinsky,Pavel Pudlák
#t2008
#cIEEE Conference on Computational Complexity
#index104906
#% 
#!
  
#*Lower Bounds and Separations for Constant Depth Multilinear Circuits.
#@Ran Raz,Amir Yehudayoff
#t2008
#cIEEE Conference on Computational Complexity
#index104907
#% 
#!
  
#*The Sum of d Small-Bias Generators Fools Polynomials of Degree d.
#@Emanuele Viola
#t2008
#cIEEE Conference on Computational Complexity
#index104908
#% 
#!
  
#*On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs.
#@Nathan Segerlind
#t2008
#cIEEE Conference on Computational Complexity
#index104909
#% 
#!
  
#*Communication Complexity under Product and Nonproduct Distributions.
#@Alexander A. Sherstov
#t2008
#cIEEE Conference on Computational Complexity
#index104910
#% 
#!
  
#*Learning Complexity vs. Communication Complexity.
#@Nati Linial,Adi Shraibman
#t2008
#cIEEE Conference on Computational Complexity
#index104911
#% 
#!
  
#*Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.
#@Troy Lee,Adi Shraibman
#t2008
#cIEEE Conference on Computational Complexity
#index104912
#% 
#!
  
#*Noisy Interpolating Sets for Low Degree Polynomials.
#@Zeev Dvir,Amir Shpilka
#t2008
#cIEEE Conference on Computational Complexity
#index104913
#% 
#!
  
#*New Results on Noncommutative and Commutative Polynomial Identity Testing.
#@Vikraman Arvind,Partha Mukhopadhyay,Srikanth Srinivasan
#t2008
#cIEEE Conference on Computational Complexity
#index104914
#% 
#!
  
#*Approximation Resistant Predicates from Pairwise Independence.
#@Per Austrin,Elchanan Mossel
#t2008
#cIEEE Conference on Computational Complexity
#index104915
#% 
#!
  
#*Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes.
#@Venkatesan Guruswami,Atri Rudra
#t2008
#cIEEE Conference on Computational Complexity
#index104916
#% 
#!
  
#*NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.
#@Harry Buhrman,John M. Hitchcock
#t2008
#cIEEE Conference on Computational Complexity
#index104917
#% 
#!
  
#*Amplifying ZPP^SAT[1] and the Two Queries Problem.
#@Richard Chang,Suresh Purini
#t2008
#cIEEE Conference on Computational Complexity
#index104918
#% 
#!
  
#*Amplifying Lower Bounds by Means of Self-Reducibility.
#@Eric Allender,Michal Koucký
#t2008
#cIEEE Conference on Computational Complexity
#index104919
#% 
#!
  
#*Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size.
#@Kristoffer Arnsfelt Hansen
#t2008
#cIEEE Conference on Computational Complexity
#index104920
#% 
#!
  
#*2-Transitivity Is Insufficient for Local Testability.
#@Elena Grigorescu,Tali Kaufman,Madhu Sudan
#t2008
#cIEEE Conference on Computational Complexity
#index104921
#% 
#!
  
#*Quantum Expanders: Motivation and Constructions.
#@Avraham Ben-Aroya,Oded Schwartz,Amnon Ta-Shma
#t2008
#cIEEE Conference on Computational Complexity
#index104922
#% 
#!
  
#*Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.
#@Alexander A. Sherstov
#t2008
#cIEEE Conference on Computational Complexity
#index104923
#% 
#!
  
#*The Quantum Moment Problem and Bounds on Entangled Multi-prover Games.
#@Andrew C. Doherty,Yeong-Cherng Liang,Ben Toner,Stephanie Wehner
#t2008
#cIEEE Conference on Computational Complexity
#index104924
#% 
#!
  
#*Constraint Logic: A Uniform Framework for Modeling Computation as Games.
#@Erik D. Demaine,Robert A. Hearn
#t2008
#cIEEE Conference on Computational Complexity
#index104925
#% 
#!
  
#*Detecting Rational Points on Hypersurfaces over Finite Fields.
#@Swastik Kopparty,Sergey Yekhanin
#t2008
#cIEEE Conference on Computational Complexity
#index104926
#% 
#!
  
#*Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
#@Tsuyoshi Ito,Hirotada Kobayashi,Daniel Preda,Xiaoming Sun,Andrew Chi-Chih Yao
#t2008
#cIEEE Conference on Computational Complexity
#index104927
#% 
#!
  
#*Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
#@Kiran S. Kedlaya,Sergey Yekhanin
#t2008
#cIEEE Conference on Computational Complexity
#index104928
#% 
#!
  
#*The Power of Unentanglement.
#@Scott Aaronson,Salman Beigi,Andrew Drucker,Bill Fefferman,Peter W. Shor
#t2008
#cIEEE Conference on Computational Complexity
#index104929
#% 
#!
  
#*Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In.
#@Zohar Shay Karnin,Amir Shpilka
#t2008
#cIEEE Conference on Computational Complexity
#index104930
#% 
#!
  
#*Increasing the Gap between Descriptional Complexity and Algorithmic Probability.
#@Adam R. Day
#t2009
#cIEEE Conference on Computational Complexity
#index1304357
#% 
#!
  
#*Extractors for Low-Weight Affine Sources.
#@Anup Rao
#t2009
#cIEEE Conference on Computational Complexity
#index1304358
#% 
#!
  
#*Extractors for Varieties.
#@Zeev Dvir
#t2009
#cIEEE Conference on Computational Complexity
#index1304359
#% 
#!
  
#*Every Permutation CSP of arity 3 is Approximation Resistant.
#@Moses Charikar,Venkatesan Guruswami,Rajsekar Manokaran
#t2009
#cIEEE Conference on Computational Complexity
#index1304360
#% 
#!
  
#*Planar Graph Isomorphism is in Log-Space.
#@Samir Datta,Nutan Limaye,Prajakta Nimbhorkar,Thomas Thierauf,Fabian Wagner
#t2009
#cIEEE Conference on Computational Complexity
#index1304361
#% 
#!
  
#*An Approximation Algorithm for Approximation Rank.
#@Troy Lee,Adi Shraibman
#t2009
#cIEEE Conference on Computational Complexity
#index1304362
#% 
#!
  
#*The Complexity of the Annihilating Polynomial.
#@Neeraj Kayal
#t2009
#cIEEE Conference on Computational Complexity
#index1304363
#% 
#!
  
#*Parallel Approximation of Non-interactive Zero-sum Quantum Games.
#@Rahul Jain,John Watrous
#t2009
#cIEEE Conference on Computational Complexity
#index1304364
#% 
#!
  
#*The Proof Complexity of Polynomial Identities.
#@Pavel Hrubes,Iddo Tzameret
#t2009
#cIEEE Conference on Computational Complexity
#index1304365
#% 
#!
  
#*New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques.
#@Rahul Jain,Hartmut Klauck
#t2009
#cIEEE Conference on Computational Complexity
#index1304366
#% 
#!
  
#*Worst-Case Running Times for Average-Case Algorithms.
#@Luis Filipe Coelho Antunes,Lance Fortnow
#t2009
#cIEEE Conference on Computational Complexity
#index1304367
#% 
#!
  
#*Are PCPs Inherent in Efficient Arguments?
#@Guy N. Rothblum,Salil P. Vadhan
#t2009
#cIEEE Conference on Computational Complexity
#index1304368
#% 
#!
  
#*Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution.
#@Luca Trevisan,Madhur Tulsiani,Salil P. Vadhan
#t2009
#cIEEE Conference on Computational Complexity
#index1304369
#% 
#!
  
#*A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences.
#@Joshua Brody,Amit Chakrabarti
#t2009
#cIEEE Conference on Computational Complexity
#index1304370
#% 
#!
  
#*Lower Bounds on Quantum Multiparty Communication Complexity.
#@Troy Lee,Gideon Schechtman,Adi Shraibman
#t2009
#cIEEE Conference on Computational Complexity
#index1304371
#% 
#!
  
#*Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in.
#@Zohar Shay Karnin,Amir Shpilka
#t2009
#cIEEE Conference on Computational Complexity
#index1304372
#% 
#!
  
#*The Maximum Communication Complexity of Multi-Party Pointer Jumping.
#@Joshua Brody
#t2009
#cIEEE Conference on Computational Complexity
#index1304373
#% 
#!
  
#*Quantum Copy-Protection and Quantum Money.
#@Scott Aaronson
#t2009
#cIEEE Conference on Computational Complexity
#index1304374
#% 
#!
  
#*A New Characterization of ACC and Probabilistic CC.
#@Kristoffer Arnsfelt Hansen,Michal Koucký
#t2009
#cIEEE Conference on Computational Complexity
#index1304375
#% 
#!
  
#*Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies.
#@Tsuyoshi Ito,Hirotada Kobayashi,Keiji Matsumoto
#t2009
#cIEEE Conference on Computational Complexity
#index1304376
#% 
#!
  
#*Fixed-Polynomial Size Circuit Bounds.
#@Lance Fortnow,Rahul Santhanam,Ryan Williams
#t2009
#cIEEE Conference on Computational Complexity
#index1304377
#% 
#!
  
#*Poly-logarithmic Independence Fools AC Circuits.
#@Mark Braverman
#t2009
#cIEEE Conference on Computational Complexity
#index1304378
#% 
#!
  
#*Improved Approximation of Linear Threshold Functions.
#@Ilias Diakonikolas,Rocco A. Servedio
#t2009
#cIEEE Conference on Computational Complexity
#index1304379
#% 
#!
  
#*Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete.
#@Akitoshi Kawamura
#t2009
#cIEEE Conference on Computational Complexity
#index1304380
#% 
#!
  
#*Locally Testable Codes Require Redundant Testers.
#@Eli Ben-Sasson,Venkatesan Guruswami,Tali Kaufman,Madhu Sudan,Michael Viderman
#t2009
#cIEEE Conference on Computational Complexity
#index1304381
#% 
#!
  
#*On the Communication Complexity of Read-Once AC^0 Formulae.
#@T. S. Jayram,Swastik Kopparty,Prasad Raghavendra
#t2009
#cIEEE Conference on Computational Complexity
#index1304382
#% 
#!
  
#*k-Subgraph Isomorphism on AC Circuits.
#@Kazuyuki Amano
#t2009
#cIEEE Conference on Computational Complexity
#index1304383
#% 
#!
  
#*Lower Bounds on the Randomized Communication Complexity of Read-Once Functions.
#@Nikos Leonardos,Michael Saks
#t2009
#cIEEE Conference on Computational Complexity
#index1304384
#% 
#!
  
#*Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma.
#@Ronen Shaltiel
#t2009
#cIEEE Conference on Computational Complexity
#index1304385
#% 
#!
  
#*Multitask Efficiencies in the Decision Tree Model.
#@Andrew Drucker
#t2009
#cIEEE Conference on Computational Complexity
#index1304386
#% 
#!
  
#*A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent.
#@Pascal Koiran,Sylvain Perifel
#t2009
#cIEEE Conference on Computational Complexity
#index1304387
#% 
#!
  
#*Infinite vs. Finite Space-Bounded Randomized Computations.
#@Richard Královic
#t2009
#cIEEE Conference on Computational Complexity
#index1304388
#% 
#!
  
#*An Almost Optimal Rank Bound for Depth-3 Identities.
#@Nitin Saxena,C. Seshadhri
#t2009
#cIEEE Conference on Computational Complexity
#index1304389
#% 
#!
  
#*On the Complexity of Boolean Functions in Different Characteristics.
#@Parikshit Gopalan,Shachar Lovett,Amir Shpilka
#t2009
#cIEEE Conference on Computational Complexity
#index1304390
#% 
#!
  
#*Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs.
#@Per Austrin,Subhash Khot,Muli Safra
#t2009
#cIEEE Conference on Computational Complexity
#index1304391
#% 
#!
  
#*One-Way Functions and the Berman-Hartmanis Conjecture.
#@Manindra Agrawal,Osamu Watanabe
#t2009
#cIEEE Conference on Computational Complexity
#index1304392
#% 
#!
  
#*On Basing ZK ≠ BPP on the Hardness of PAC Learning.
#@David Xiao
#t2009
#cIEEE Conference on Computational Complexity
#index1304393
#% 
#!
  
#*No Strong Parallel Repetition with Entangled and Non-signaling Provers.
#@Julia Kempe,Oded Regev
#t2010
#cIEEE Conference on Computational Complexity
#index2780789
#% 
#!
  
#*Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010
#@
#t2010
#cIEEE Conference on Computational Complexity
#index2780781
#% 
#!
  
#*18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark
#@
#t2003
#cIEEE Conference on Computational Complexity
#index2780774
#% 
#!
  
#*Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA
#@
#t2008
#cIEEE Conference on Computational Complexity
#index2780782
#% 
#!
  
#*The Learning with Errors Problem (Invited Survey).
#@Oded Regev
#t2010
#cIEEE Conference on Computational Complexity
#index2780800
#% 
#!
  
#*On the Unique Games Conjecture (Invited Survey).
#@Subhash Khot
#t2010
#cIEEE Conference on Computational Complexity
#index2780790
#% 
#!
  
#*On the Matching Problem for Special Graph Classes.
#@Thanh Minh Hoang
#t2010
#cIEEE Conference on Computational Complexity
#index2780795
#% 
#!
  
#*The Program-Enumeration Bottleneck in Average-Case Complexity Theory.
#@Luca Trevisan
#t2010
#cIEEE Conference on Computational Complexity
#index2780809
#% 
#!
  
#*Parallel Repetition of Two Prover Games (Invited Survey).
#@Ran Raz
#t2010
#cIEEE Conference on Computational Complexity
#index2780780
#% 
#!
  
#*Completely Inapproximable Monotone and Antimonotone Parameterized Problems.
#@Dániel Marx
#t2010
#cIEEE Conference on Computational Complexity
#index2780808
#% 
#!
  
#*Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata.
#@Eric Allender,Klaus-Jörn Lange
#t2010
#cIEEE Conference on Computational Complexity
#index2780787
#% 
#!
  
#*Trade-Off Lower Bounds for Stack Machines.
#@Matei David,Periklis A. Papakonstantinou
#t2010
#cIEEE Conference on Computational Complexity
#index2780802
#% 
#!
  
#*Derandomizing from Random Strings.
#@Harry Buhrman,Lance Fortnow,Michal Koucký,Bruno Loff
#t2010
#cIEEE Conference on Computational Complexity
#index2780801
#% 
#!
  
#*Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
#@Dan Gutfreund,Akinori Kawachi
#t2010
#cIEEE Conference on Computational Complexity
#index2780807
#% 
#!
  
#*Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009
#@
#t2009
#cIEEE Conference on Computational Complexity
#index2780779
#% 
#!
  
#*Fooling Functions of Halfspaces under Product Distributions.
#@Parikshit Gopalan,Ryan O'Donnell,Yi Wu,David Zuckerman
#t2010
#cIEEE Conference on Computational Complexity
#index2780796
#% 
#!
  
#*Lower Bounds for Testing Function Isomorphism.
#@Eric Blais,Ryan O'Donnell
#t2010
#cIEEE Conference on Computational Complexity
#index2780788
#% 
#!
  
#*Communication Complexity with Synchronized Clocks.
#@Russell Impagliazzo,Ryan Williams
#t2010
#cIEEE Conference on Computational Complexity
#index2780793
#% 
#!
  
#*A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
#@Iftach Haitner,Mohammad Mahmoody,David Xiao
#t2010
#cIEEE Conference on Computational Complexity
#index2780806
#% 
#!
  
#*Simple Affine Extractors Using Dimension Expansion.
#@Matt DeVos,Ariel Gabizon
#t2010
#cIEEE Conference on Computational Complexity
#index2780785
#% 
#!
  
#*On the Relative Strength of Pebbling and Resolution.
#@Jakob Nordström
#t2010
#cIEEE Conference on Computational Complexity
#index2780804
#% 
#!
  
#*22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA
#@
#t2007
#cIEEE Conference on Computational Complexity
#index2780778
#% 
#!
  
#*The Partition Bound for Classical Communication Complexity and Query Complexity.
#@Rahul Jain,Hartmut Klauck
#t2010
#cIEEE Conference on Computational Complexity
#index2780794
#% 
#!
  
#*The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions.
#@Daniel M. Kane
#t2010
#cIEEE Conference on Computational Complexity
#index2780803
#% 
#!
  
#*On Matrix Rigidity and Locally Self-Correctable Codes.
#@Zeev Dvir
#t2010
#cIEEE Conference on Computational Complexity
#index2780786
#% 
#!
  
#*Spectral Algorithms for Unique Games.
#@Alexandra Kolla
#t2010
#cIEEE Conference on Computational Complexity
#index2780791
#% 
#!
  
#*21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic
#@
#t2006
#cIEEE Conference on Computational Complexity
#index2780777
#% 
#!
  
#*Relationless Completeness and Separations.
#@Pavel Hrubes,Avi Wigderson,Amir Yehudayoff
#t2010
#cIEEE Conference on Computational Complexity
#index2780783
#% 
#!
  
#*Derandomized Parallel Repetition of Structured PCPs.
#@Irit Dinur,Or Meir
#t2010
#cIEEE Conference on Computational Complexity
#index2780805
#% 
#!
  
#*Derandomized Parallel Repetition Theorems for Free Games.
#@Ronen Shaltiel
#t2010
#cIEEE Conference on Computational Complexity
#index2780798
#% 
#!
  
#*20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA
#@
#t2005
#cIEEE Conference on Computational Complexity
#index2780776
#% 
#!
  
#*Exact Threshold Circuits.
#@Kristoffer Arnsfelt Hansen,Vladimir V. Podolskii
#t2010
#cIEEE Conference on Computational Complexity
#index2780784
#% 
#!
  
#*19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA
#@
#t2004
#cIEEE Conference on Computational Complexity
#index2780775
#% 
#!
  
#*A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.
#@Derrick Stolee,Chris Bourke,N. V. Vinodchandran
#t2010
#cIEEE Conference on Computational Complexity
#index2780797
#% 
#!
  
#*A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions.
#@Ilias Diakonikolas,Rocco A. Servedio,Li-Yang Tan,Andrew Wan
#t2010
#cIEEE Conference on Computational Complexity
#index2780792
#% 
#!
  
#*On the Power of Randomized Reductions and the Checkability of SAT.
#@Mohammad Mahmoody,David Xiao
#t2010
#cIEEE Conference on Computational Complexity
#index2780799
#% 
#!
  
#*Approximation Algorithms for QMA-Complete Problems.
#@Sevag Gharibian,Julia Kempe
#t2011
#cIEEE Conference on Computational Complexity
#index3238198
#% 
#!
  
#*Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011
#@
#t2011
#cIEEE Conference on Computational Complexity
#index3238216
#% 
#!
  
#*Bounded-Depth Circuits Cannot Sample Good Codes.
#@Shachar Lovett,Emanuele Viola
#t2011
#cIEEE Conference on Computational Complexity
#index3238210
#% 
#!
  
#*Linear-Algebraic List Decoding of Folded Reed-Solomon Codes.
#@Venkatesan Guruswami
#t2011
#cIEEE Conference on Computational Complexity
#index3238199
#% 
#!
  
#*Noisy Interpolation of Sparse Polynomials, and Applications.
#@Shubhangi Saraf,Sergey Yekhanin
#t2011
#cIEEE Conference on Computational Complexity
#index3238212
#% 
#!
  
#*A New Approach to Affine Extractors and Dispersers.
#@Xin Li
#t2011
#cIEEE Conference on Computational Complexity
#index3238209
#% 
#!
  
#*Explicit Dimension Reduction and Its Applications.
#@Zohar Shay Karnin,Yuval Rabani,Amir Shpilka
#t2011
#cIEEE Conference on Computational Complexity
#index3238196
#% 
#!
  
#*Relativized Separations of Worst-Case and Average-Case Complexities for NP.
#@Russell Impagliazzo
#t2011
#cIEEE Conference on Computational Complexity
#index3238194
#% 
#!
  
#*Symmetry-Assisted Adversaries for Quantum State Generation.
#@Andris Ambainis,Loïck Magnin,Martin Roetteler,Jérémie Roland
#t2011
#cIEEE Conference on Computational Complexity
#index3238222
#% 
#!
  
#*Pseudorandomness for Permutation and Regular Branching Programs.
#@Anindya De
#t2011
#cIEEE Conference on Computational Complexity
#index3238211
#% 
#!
  
#*Symmetric LDPC Codes are not Necessarily Locally Testable.
#@Eli Ben-Sasson,Ghid Maatouk,Amir Shpilka,Madhu Sudan
#t2011
#cIEEE Conference on Computational Complexity
#index3238204
#% 
#!
  
#*Paris-Harrington Tautologies.
#@Lorenzo Carlucci,Nicola Galesi,Massimo Lauria
#t2011
#cIEEE Conference on Computational Complexity
#index3238201
#% 
#!
  
#*Towards Lower Bounds on Locally Testable Codes via Density Arguments.
#@Eli Ben-Sasson,Michael Viderman
#t2011
#cIEEE Conference on Computational Complexity
#index3238228
#% 
#!
  
#*Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups.
#@Ryan O'Donnell,Yi Wu,Yuan Zhou
#t2011
#cIEEE Conference on Computational Complexity
#index3238214
#% 
#!
  
#*k-Independent Gaussians Fool Polynomial Threshold Functions.
#@Daniel M. Kane
#t2011
#cIEEE Conference on Computational Complexity
#index3238225
#% 
#!
  
#*Making Branching Programs Oblivious Requires Superlogarithmic Overhead.
#@Paul Beame,Widad Machmouchi
#t2011
#cIEEE Conference on Computational Complexity
#index3238227
#% 
#!
  
#*Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs.
#@Yuichi Yoshida
#t2011
#cIEEE Conference on Computational Complexity
#index3238200
#% 
#!
  
#*Improved Constructions of Three Source Extractors.
#@Xin Li
#t2011
#cIEEE Conference on Computational Complexity
#index3238226
#% 
#!
  
#*Improved Direct Product Theorems for Randomized Query Complexity.
#@Andrew Drucker
#t2011
#cIEEE Conference on Computational Complexity
#index3238208
#% 
#!
  
#*Non-negatively Weighted #CSP: An Effective Complexity Dichotomy.
#@Jin-yi Cai,Xi Chen,Pinyan Lu
#t2011
#cIEEE Conference on Computational Complexity
#index3238233
#% 
#!
  
#*Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae.
#@Matthew Anderson,Dieter van Melkebeek,Ilya Volkovich
#t2011
#cIEEE Conference on Computational Complexity
#index3238215
#% 
#!
  
#*On the Sum of Square Roots of Polynomials and Related Problems.
#@Neeraj Kayal,Chandan Saha
#t2011
#cIEEE Conference on Computational Complexity
#index3238197
#% 
#!
  
#*Pseudorandom Generators for Combinatorial Checkerboards.
#@Thomas Watson
#t2011
#cIEEE Conference on Computational Complexity
#index3238238
#% 
#!
  
#*Non-uniform ACC Circuit Lower Bounds.
#@Ryan Williams
#t2011
#cIEEE Conference on Computational Complexity
#index3238229
#% 
#!
  
#*Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors.
#@Marius Zimand
#t2011
#cIEEE Conference on Computational Complexity
#index3238218
#% 
#!
  
#*Near-Optimal and Explicit Bell Inequality Violations.
#@Harry Buhrman,Oded Regev,Giannicola Scarpa,Ronald de Wolf
#t2011
#cIEEE Conference on Computational Complexity
#index3238224
#% 
#!
  
#*Linear Systems over Finite Abelian Groups.
#@Arkadev Chattopadhyay,Shachar Lovett
#t2011
#cIEEE Conference on Computational Complexity
#index3238221
#% 
#!
  
#*Tensor Rank: Some Lower and Upper Bounds.
#@Boris Alexeev,Michael A. Forbes,Jacob Tsimerman
#t2011
#cIEEE Conference on Computational Complexity
#index3238230
#% 
#!
  
#*On the Minimal Fourier Degree of Symmetric Boolean Functions.
#@Amir Shpilka,Avishay Tal
#t2011
#cIEEE Conference on Computational Complexity
#index3238217
#% 
#!
  
#*On Arthur Merlin Games in Communication Complexity.
#@Hartmut Klauck
#t2011
#cIEEE Conference on Computational Complexity
#index3238207
#% 
#!
  
#*Property Testing Lower Bounds via Communication Complexity.
#@Eric Blais,Joshua Brody,Kevin Matulef
#t2011
#cIEEE Conference on Computational Complexity
#index3238237
#% 
#!
  
#*Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996
#@Steven Homer,Jin-Yi Cai
#t1996
#cIEEE Conference on Computational Complexity
#index3641523
#% 
#!
  
#*Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002
#@
#t2002
#cIEEE Conference on Computational Complexity
#index3641469
#% 
#!
  
#*Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998
#@
#t1998
#cIEEE Conference on Computational Complexity
#index3641488
#% 
#!
  
#*Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001
#@
#t2001
#cIEEE Conference on Computational Complexity
#index3641475
#% 
#!
  
#*Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000
#@
#t2000
#cIEEE Conference on Computational Complexity
#index3641476
#% 
#!
  
#*Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999
#@
#t1999
#cIEEE Conference on Computational Complexity
#index3641463
#% 
#!
  
#*Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997
#@
#t1997
#cIEEE Conference on Computational Complexity
#index3641499
#% 
#!
  
